./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c1f84c99-4371-4c10-8f98-43fa5cce9432/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c1f84c99-4371-4c10-8f98-43fa5cce9432/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c1f84c99-4371-4c10-8f98-43fa5cce9432/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c1f84c99-4371-4c10-8f98-43fa5cce9432/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c1f84c99-4371-4c10-8f98-43fa5cce9432/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c1f84c99-4371-4c10-8f98-43fa5cce9432/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 0b29929f70f48b1f1b1180a065dc51df3698b29b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 23:01:00,045 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:01:00,046 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:01:00,053 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:01:00,053 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:01:00,054 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:01:00,054 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:01:00,055 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:01:00,057 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:01:00,057 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:01:00,058 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:01:00,058 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:01:00,059 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:01:00,059 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:01:00,060 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:01:00,061 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:01:00,061 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:01:00,062 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:01:00,064 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:01:00,065 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:01:00,065 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:01:00,066 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:01:00,068 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:01:00,068 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:01:00,068 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:01:00,069 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:01:00,069 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:01:00,070 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:01:00,071 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:01:00,071 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:01:00,072 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:01:00,072 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:01:00,072 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:01:00,072 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:01:00,073 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:01:00,073 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:01:00,074 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c1f84c99-4371-4c10-8f98-43fa5cce9432/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-22 23:01:00,085 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:01:00,085 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:01:00,086 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 23:01:00,086 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 23:01:00,086 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 23:01:00,086 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 23:01:00,086 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 23:01:00,086 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 23:01:00,087 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 23:01:00,087 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 23:01:00,087 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 23:01:00,087 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:01:00,087 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 23:01:00,087 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 23:01:00,087 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:01:00,088 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 23:01:00,088 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:01:00,088 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 23:01:00,088 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 23:01:00,088 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 23:01:00,088 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 23:01:00,088 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:01:00,088 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 23:01:00,089 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:01:00,089 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 23:01:00,089 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:01:00,089 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:01:00,089 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 23:01:00,089 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:01:00,089 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 23:01:00,090 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 23:01:00,090 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 23:01:00,090 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_c1f84c99-4371-4c10-8f98-43fa5cce9432/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 -> 0b29929f70f48b1f1b1180a065dc51df3698b29b [2018-11-22 23:01:00,112 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:01:00,119 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:01:00,122 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:01:00,123 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:01:00,123 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:01:00,123 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c1f84c99-4371-4c10-8f98-43fa5cce9432/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-22 23:01:00,160 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c1f84c99-4371-4c10-8f98-43fa5cce9432/bin-2019/uautomizer/data/1e243eb60/c592129f1d8c48b6832cdb67b9c6f4b4/FLAGbf1434cde [2018-11-22 23:01:00,599 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:01:00,599 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c1f84c99-4371-4c10-8f98-43fa5cce9432/sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-22 23:01:00,605 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c1f84c99-4371-4c10-8f98-43fa5cce9432/bin-2019/uautomizer/data/1e243eb60/c592129f1d8c48b6832cdb67b9c6f4b4/FLAGbf1434cde [2018-11-22 23:01:00,613 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c1f84c99-4371-4c10-8f98-43fa5cce9432/bin-2019/uautomizer/data/1e243eb60/c592129f1d8c48b6832cdb67b9c6f4b4 [2018-11-22 23:01:00,615 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:01:00,616 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:01:00,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:01:00,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:01:00,619 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:01:00,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:01:00" (1/1) ... [2018-11-22 23:01:00,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4be9f308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:00, skipping insertion in model container [2018-11-22 23:01:00,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:01:00" (1/1) ... [2018-11-22 23:01:00,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:01:00,654 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:01:00,839 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:01:00,845 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:01:00,919 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:01:00,944 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:01:00,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:00 WrapperNode [2018-11-22 23:01:00,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:01:00,945 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:01:00,945 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:01:00,945 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:01:00,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:00" (1/1) ... [2018-11-22 23:01:00,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:00" (1/1) ... [2018-11-22 23:01:00,974 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:01:00,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:01:00,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:01:00,975 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:01:00,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:00" (1/1) ... [2018-11-22 23:01:00,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:00" (1/1) ... [2018-11-22 23:01:00,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:00" (1/1) ... [2018-11-22 23:01:00,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:00" (1/1) ... [2018-11-22 23:01:00,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:00" (1/1) ... [2018-11-22 23:01:00,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:00" (1/1) ... [2018-11-22 23:01:00,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:00" (1/1) ... [2018-11-22 23:01:00,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:01:00,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:01:00,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:01:00,991 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:01:00,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1f84c99-4371-4c10-8f98-43fa5cce9432/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-22 23:01:01,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 23:01:01,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 23:01:01,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 23:01:01,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-22 23:01:01,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-22 23:01:01,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 23:01:01,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:01:01,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:01:01,225 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:01:01,225 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-22 23:01:01,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:01:01 BoogieIcfgContainer [2018-11-22 23:01:01,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:01:01,226 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 23:01:01,226 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 23:01:01,229 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 23:01:01,230 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:01:01,230 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 11:01:00" (1/3) ... [2018-11-22 23:01:01,230 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b05568f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 11:01:01, skipping insertion in model container [2018-11-22 23:01:01,230 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:01:01,230 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:00" (2/3) ... [2018-11-22 23:01:01,231 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b05568f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 11:01:01, skipping insertion in model container [2018-11-22 23:01:01,231 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:01:01,231 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:01:01" (3/3) ... [2018-11-22 23:01:01,232 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-22 23:01:01,265 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 23:01:01,266 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 23:01:01,266 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 23:01:01,266 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 23:01:01,266 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:01:01,266 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:01:01,266 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 23:01:01,266 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:01:01,266 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 23:01:01,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-22 23:01:01,289 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-22 23:01:01,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:01:01,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:01:01,295 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-22 23:01:01,295 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 23:01:01,295 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 23:01:01,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-22 23:01:01,297 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-22 23:01:01,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:01:01,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:01:01,297 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-22 23:01:01,297 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 23:01:01,303 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 15#L561true assume !(main_~length~0 < 1); 19#L561-2true assume !(main_~n~0 < 1); 13#L564-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstpncpy_#in~dst.base, cstpncpy_#in~dst.offset, cstpncpy_#in~src.base, cstpncpy_#in~src.offset, cstpncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstpncpy_#res.base, cstpncpy_#res.offset;havoc cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset, cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset, cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset, cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset, cstpncpy_#t~mem7, cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset, cstpncpy_#t~pre8, cstpncpy_#t~pre4, cstpncpy_~d~0.base, cstpncpy_~d~0.offset, cstpncpy_~s~0.base, cstpncpy_~s~0.offset, cstpncpy_#t~mem10.base, cstpncpy_#t~mem10.offset, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, cstpncpy_~src.base, cstpncpy_~src.offset, cstpncpy_~n;call cstpncpy_~#dst.base, cstpncpy_~#dst.offset := #Ultimate.alloc(4);call write~$Pointer$(cstpncpy_#in~dst.base, cstpncpy_#in~dst.offset, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 4);cstpncpy_~src.base, cstpncpy_~src.offset := cstpncpy_#in~src.base, cstpncpy_#in~src.offset;cstpncpy_~n := cstpncpy_#in~n; 8#L543true assume 0 != cstpncpy_~n % 4294967296;call cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset := read~$Pointer$(cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 4);cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset;havoc cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset;cstpncpy_~s~0.base, cstpncpy_~s~0.offset := cstpncpy_~src.base, cstpncpy_~src.offset;call cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset := read~$Pointer$(cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 4);call write~$Pointer$(cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset + (if cstpncpy_~n % 4294967296 % 4294967296 <= 2147483647 then cstpncpy_~n % 4294967296 % 4294967296 else cstpncpy_~n % 4294967296 % 4294967296 - 4294967296), cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 4);havoc cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset; 9#L547-4true [2018-11-22 23:01:01,304 INFO L796 eck$LassoCheckResult]: Loop: 9#L547-4true cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset := cstpncpy_~d~0.base, cstpncpy_~d~0.offset;cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~post5.base, 1 + cstpncpy_#t~post5.offset;cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset := cstpncpy_~s~0.base, cstpncpy_~s~0.offset;cstpncpy_~s~0.base, cstpncpy_~s~0.offset := cstpncpy_#t~post6.base, 1 + cstpncpy_#t~post6.offset;call cstpncpy_#t~mem7 := read~int(cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset, 1);call write~int(cstpncpy_#t~mem7, cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset, 1); 3#L548true assume !(0 == cstpncpy_#t~mem7);havoc cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset;havoc cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset;havoc cstpncpy_#t~mem7; 5#L547-1true cstpncpy_#t~pre4 := cstpncpy_~n - 1;cstpncpy_~n := cstpncpy_~n - 1; 7#L547-2true assume !!(0 != cstpncpy_#t~pre4 % 4294967296);havoc cstpncpy_#t~pre4; 9#L547-4true [2018-11-22 23:01:01,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:01:01,307 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2018-11-22 23:01:01,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:01:01,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:01:01,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:01:01,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:01:01,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:01:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:01:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:01:01,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:01:01,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1618712, now seen corresponding path program 1 times [2018-11-22 23:01:01,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:01:01,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:01:01,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:01:01,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:01:01,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:01:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:01:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:01:01,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:01:01,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1592246563, now seen corresponding path program 1 times [2018-11-22 23:01:01,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:01:01,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:01:01,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:01:01,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:01:01,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:01:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:01:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:01:02,267 WARN L180 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 149 [2018-11-22 23:01:02,294 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:02,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:02,547 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:02,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:03,699 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 23:01:03,885 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:01:03,888 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-22 23:01:04,048 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:01:04,700 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:04,857 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:04,859 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:05,022 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:05,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-22 23:01:05,774 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:553, output treesize:521 [2018-11-22 23:01:06,472 WARN L180 SmtUtils]: Spent 697.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-11-22 23:01:06,480 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 23:01:06,481 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 23:01:06,481 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 23:01:06,481 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 23:01:06,481 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 23:01:06,481 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:01:06,481 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 23:01:06,482 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 23:01:06,482 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-22 23:01:06,482 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 23:01:06,482 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 23:01:06,502 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-22 23:01:06,516 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-22 23:01:06,518 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-22 23:01:06,521 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-22 23:01:06,522 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-22 23:01:06,523 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-22 23:01:06,525 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-22 23:01:06,526 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-22 23:01:06,531 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-22 23:01:06,532 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-22 23:01:06,534 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-22 23:01:06,534 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-22 23:01:06,535 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-22 23:01:06,536 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-22 23:01:06,537 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-22 23:01:06,538 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-22 23:01:06,757 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-22 23:01:07,154 WARN L180 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2018-11-22 23:01:07,276 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2018-11-22 23:01:07,276 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-22 23:01:07,278 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-22 23:01:07,280 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-22 23:01:07,281 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-22 23:01:07,283 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-22 23:01:07,284 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-22 23:01:07,286 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-22 23:01:07,288 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-22 23:01:07,289 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-22 23:01:07,754 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2018-11-22 23:01:07,879 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-11-22 23:01:07,885 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-22 23:01:08,324 WARN L180 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2018-11-22 23:01:08,377 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 23:01:08,380 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 23:01:08,382 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-22 23:01:08,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:01:08,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:01:08,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:01:08,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,387 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-22 23:01:08,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:01:08,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:01:08,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:01:08,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,389 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-22 23:01:08,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:01:08,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:01:08,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,394 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-22 23:01:08,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:01:08,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:01:08,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:01:08,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,396 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-22 23:01:08,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:01:08,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:01:08,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:01:08,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,398 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-22 23:01:08,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:01:08,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:01:08,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:01:08,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,404 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-22 23:01:08,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:01:08,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:01:08,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,408 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-22 23:01:08,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:01:08,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:01:08,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:01:08,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,410 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-22 23:01:08,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:01:08,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:01:08,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:01:08,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,412 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-22 23:01:08,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:01:08,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:01:08,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:01:08,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,414 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-22 23:01:08,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:01:08,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:01:08,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:01:08,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,416 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-22 23:01:08,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:01:08,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:01:08,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:01:08,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,417 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-22 23:01:08,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:01:08,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:01:08,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:01:08,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,419 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-22 23:01:08,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:01:08,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:01:08,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:01:08,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,420 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-22 23:01:08,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:01:08,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:01:08,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:01:08,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,422 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-22 23:01:08,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:01:08,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,422 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:01:08,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,422 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:01:08,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:01:08,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,425 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-22 23:01:08,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:01:08,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:01:08,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,429 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-22 23:01:08,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:01:08,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:01:08,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,434 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-22 23:01:08,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,434 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:01:08,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,437 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:01:08,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:01:08,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,450 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-22 23:01:08,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,454 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:01:08,454 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:01:08,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,456 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-22 23:01:08,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:01:08,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:01:08,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,462 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-22 23:01:08,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:01:08,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:01:08,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,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-11-22 23:01:08,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:01:08,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:01:08,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:01:08,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,469 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-22 23:01:08,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:01:08,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:01:08,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:01:08,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,471 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-22 23:01:08,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,473 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:01:08,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:01:08,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,479 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-22 23:01:08,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:01:08,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:01:08,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:01:08,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,481 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-22 23:01:08,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,482 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:01:08,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,484 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:01:08,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:01:08,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,498 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-22 23:01:08,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:01:08,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:01:08,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,508 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-22 23:01:08,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:01:08,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:01:08,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:01:08,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:01:08,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:01:08,510 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-22 23:01:08,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:01:08,510 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:01:08,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:01:08,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:01:08,520 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:01:08,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:01:08,570 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 23:01:08,622 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-22 23:01:08,622 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-22 23:01:08,624 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 23:01:08,625 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 23:01:08,626 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 23:01:08,626 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstpncpy_~s~0.base)_1, ULTIMATE.start_cstpncpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstpncpy_~s~0.base)_1 - 1*ULTIMATE.start_cstpncpy_~s~0.offset Supporting invariants [] [2018-11-22 23:01:08,728 INFO L297 tatePredicateManager]: 19 out of 19 supporting invariants were superfluous and have been removed [2018-11-22 23:01:08,734 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 23:01:08,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:01:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:01:08,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:01:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:01:08,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:01:08,817 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-22 23:01:08,826 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 23:01:08,827 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2018-11-22 23:01:08,864 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 39 states and 47 transitions. Complement of second has 5 states. [2018-11-22 23:01:08,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 23:01:08,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 23:01:08,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2018-11-22 23:01:08,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-22 23:01:08,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:01:08,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-22 23:01:08,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:01:08,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-22 23:01:08,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:01:08,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 47 transitions. [2018-11-22 23:01:08,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 23:01:08,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 14 states and 17 transitions. [2018-11-22 23:01:08,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-22 23:01:08,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-22 23:01:08,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-11-22 23:01:08,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:01:08,879 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-22 23:01:08,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-11-22 23:01:08,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-22 23:01:08,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-22 23:01:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-11-22 23:01:08,897 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-22 23:01:08,897 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-22 23:01:08,897 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 23:01:08,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-11-22 23:01:08,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 23:01:08,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:01:08,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:01:08,898 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:01:08,898 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:01:08,898 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 186#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 187#L561 assume !(main_~length~0 < 1); 197#L561-2 assume !(main_~n~0 < 1); 193#L564-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstpncpy_#in~dst.base, cstpncpy_#in~dst.offset, cstpncpy_#in~src.base, cstpncpy_#in~src.offset, cstpncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstpncpy_#res.base, cstpncpy_#res.offset;havoc cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset, cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset, cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset, cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset, cstpncpy_#t~mem7, cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset, cstpncpy_#t~pre8, cstpncpy_#t~pre4, cstpncpy_~d~0.base, cstpncpy_~d~0.offset, cstpncpy_~s~0.base, cstpncpy_~s~0.offset, cstpncpy_#t~mem10.base, cstpncpy_#t~mem10.offset, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, cstpncpy_~src.base, cstpncpy_~src.offset, cstpncpy_~n;call cstpncpy_~#dst.base, cstpncpy_~#dst.offset := #Ultimate.alloc(4);call write~$Pointer$(cstpncpy_#in~dst.base, cstpncpy_#in~dst.offset, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 4);cstpncpy_~src.base, cstpncpy_~src.offset := cstpncpy_#in~src.base, cstpncpy_#in~src.offset;cstpncpy_~n := cstpncpy_#in~n; 194#L543 assume 0 != cstpncpy_~n % 4294967296;call cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset := read~$Pointer$(cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 4);cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset;havoc cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset;cstpncpy_~s~0.base, cstpncpy_~s~0.offset := cstpncpy_~src.base, cstpncpy_~src.offset;call cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset := read~$Pointer$(cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 4);call write~$Pointer$(cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset + (if cstpncpy_~n % 4294967296 % 4294967296 <= 2147483647 then cstpncpy_~n % 4294967296 % 4294967296 else cstpncpy_~n % 4294967296 % 4294967296 - 4294967296), cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 4);havoc cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset; 198#L547-4 cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset := cstpncpy_~d~0.base, cstpncpy_~d~0.offset;cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~post5.base, 1 + cstpncpy_#t~post5.offset;cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset := cstpncpy_~s~0.base, cstpncpy_~s~0.offset;cstpncpy_~s~0.base, cstpncpy_~s~0.offset := cstpncpy_#t~post6.base, 1 + cstpncpy_#t~post6.offset;call cstpncpy_#t~mem7 := read~int(cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset, 1);call write~int(cstpncpy_#t~mem7, cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset, 1); 188#L548 assume 0 == cstpncpy_#t~mem7;havoc cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset;havoc cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset;havoc cstpncpy_#t~mem7;call write~$Pointer$(cstpncpy_~d~0.base, cstpncpy_~d~0.offset - 1, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 4); 190#L550-3 [2018-11-22 23:01:08,898 INFO L796 eck$LassoCheckResult]: Loop: 190#L550-3 cstpncpy_#t~pre8 := cstpncpy_~n - 1;cstpncpy_~n := cstpncpy_~n - 1; 191#L550-1 assume !!(0 != cstpncpy_#t~pre8 % 4294967296);havoc cstpncpy_#t~pre8;cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset := cstpncpy_~d~0.base, cstpncpy_~d~0.offset;cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~post9.base, 1 + cstpncpy_#t~post9.offset;call write~int(0, cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset, 1);havoc cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset; 190#L550-3 [2018-11-22 23:01:08,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:01:08,898 INFO L82 PathProgramCache]: Analyzing trace with hash 180427599, now seen corresponding path program 1 times [2018-11-22 23:01:08,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:01:08,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:01:08,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:01:08,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:01:08,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:01:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:01:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:01:08,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:01:08,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2018-11-22 23:01:08,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:01:08,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:01:08,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:01:08,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:01:08,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:01:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:01:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:01:08,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:01:08,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231764, now seen corresponding path program 1 times [2018-11-22 23:01:08,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:01:08,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:01:08,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:01:08,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:01:08,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:01:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:01:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:01:12,170 WARN L180 SmtUtils]: Spent 3.14 s on a formula simplification. DAG size of input: 231 DAG size of output: 212 [2018-11-22 23:01:12,201 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:12,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:12,948 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:13,793 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:17,922 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:18,867 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:18,869 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:19,592 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:24,929 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:25,896 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:25,899 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:26,861 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:33,482 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-22 23:01:34,273 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:01:34,275 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-22 23:01:35,041 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:01:40,276 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:40,998 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:41,000 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:41,775 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:46,913 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:47,648 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:47,650 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:48,395 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:01:55,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-11-22 23:01:55,366 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 6 variables, input treesize:806, output treesize:1350 [2018-11-22 23:02:02,522 WARN L180 SmtUtils]: Spent 7.16 s on a formula simplification that was a NOOP. DAG size: 196 [2018-11-22 23:02:02,525 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 23:02:02,525 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 23:02:02,525 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 23:02:02,525 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 23:02:02,525 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 23:02:02,525 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:02:02,525 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 23:02:02,525 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 23:02:02,526 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-22 23:02:02,526 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 23:02:02,526 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 23:02:02,535 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-22 23:02:02,539 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-22 23:02:02,543 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-22 23:02:02,547 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-22 23:02:02,550 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-22 23:02:02,552 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-22 23:02:02,555 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-22 23:02:02,557 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-22 23:02:02,559 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-22 23:02:04,304 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2018-11-22 23:02:04,758 WARN L180 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 116 [2018-11-22 23:02:04,833 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-22 23:02:04,834 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-22 23:02:04,835 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-22 23:02:04,836 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-22 23:02:04,837 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-22 23:02:04,840 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-22 23:02:04,842 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-22 23:02:04,843 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-22 23:02:04,844 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-22 23:02:04,845 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-22 23:02:04,847 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-22 23:02:04,850 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-22 23:02:04,851 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-22 23:02:04,852 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-22 23:02:04,854 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-22 23:02:04,855 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-22 23:02:04,856 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-22 23:02:05,271 WARN L180 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 113 [2018-11-22 23:02:05,382 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2018-11-22 23:02:05,433 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-22 23:02:05,844 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2018-11-22 23:02:05,957 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 23:02:05,957 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 23:02:05,957 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-22 23:02:05,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:02:05,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:02:05,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:02:05,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:02:05,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:02:05,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:02:05,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:02:05,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:02:05,961 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-22 23:02:05,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:02:05,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:02:05,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:02:05,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:02:05,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:02:05,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:02:05,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:02:05,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:02:05,966 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-22 23:02:05,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:02:05,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:02:05,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:02:05,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:02:05,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:02:05,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:02:05,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:02:05,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:02:05,968 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-22 23:02:05,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:02:05,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:02:05,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:02:05,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:02:05,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:02:05,969 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:02:05,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:02:05,970 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-22 23:02:05,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:02:05,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:02:05,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:02:05,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:02:05,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:02:05,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:02:05,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:02:05,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:02:05,971 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-22 23:02:05,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:02:05,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:02:05,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:02:05,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:02:05,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:02:05,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:02:05,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:02:05,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:02:05,971 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-22 23:02:05,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:02:05,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:02:05,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:02:05,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:02:05,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:02:05,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:02:05,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:02:05,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:02:05,972 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-22 23:02:05,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:02:05,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:02:05,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:02:05,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:02:05,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:02:05,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:02:05,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:02:05,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:02:05,973 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-22 23:02:05,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:02:05,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:02:05,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:02:05,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:02:05,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:02:05,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:02:05,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:02:05,975 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-22 23:02:05,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:02:05,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:02:05,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:02:05,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:02:05,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:02:05,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:02:05,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:02:05,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:02:05,976 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-22 23:02:05,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:02:05,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:02:05,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:02:05,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:02:05,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:02:05,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:02:05,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:02:05,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:02:05,978 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-22 23:02:05,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:02:05,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:02:05,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:02:05,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:02:05,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:02:05,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:02:05,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:02:05,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:02:05,980 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-22 23:02:05,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:02:05,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:02:05,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:02:05,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:02:05,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:02:05,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:02:05,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:02:05,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:02:05,981 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-22 23:02:05,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:02:05,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:02:05,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:02:05,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:02:05,982 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:02:05,982 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:02:05,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:02:05,984 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-22 23:02:05,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:02:05,984 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:02:05,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:02:05,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:02:05,985 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:02:05,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:02:05,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:02:05,987 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-22 23:02:05,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:02:05,987 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:02:05,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:02:05,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:02:05,993 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:02:05,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:02:06,025 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 23:02:06,052 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-22 23:02:06,052 INFO L444 ModelExtractionUtils]: 61 out of 67 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-22 23:02:06,052 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 23:02:06,053 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 23:02:06,053 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 23:02:06,053 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstpncpy_~d~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2) = -1*ULTIMATE.start_cstpncpy_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 Supporting invariants [] [2018-11-22 23:02:06,188 INFO L297 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2018-11-22 23:02:06,190 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 23:02:06,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:02:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:02:06,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:02:06,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-22 23:02:06,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-22 23:02:06,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 23:02:06,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:02:06,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:02:06,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-22 23:02:06,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-22 23:02:06,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-22 23:02:06,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 23:02:06,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:02:06,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:02:06,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:5 [2018-11-22 23:02:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:02:06,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:02:06,281 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-22 23:02:06,281 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2018-11-22 23:02:06,281 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-22 23:02:06,343 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 15 states and 19 transitions. Complement of second has 7 states. [2018-11-22 23:02:06,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 23:02:06,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 23:02:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2018-11-22 23:02:06,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-22 23:02:06,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:02:06,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-22 23:02:06,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:02:06,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-22 23:02:06,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:02:06,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-11-22 23:02:06,346 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 23:02:06,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2018-11-22 23:02:06,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-22 23:02:06,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-22 23:02:06,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-22 23:02:06,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:02:06,346 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 23:02:06,346 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 23:02:06,346 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 23:02:06,347 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 23:02:06,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-22 23:02:06,347 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 23:02:06,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-22 23:02:06,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 11:02:06 BoogieIcfgContainer [2018-11-22 23:02:06,352 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 23:02:06,353 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:02:06,353 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:02:06,353 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:02:06,353 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:01:01" (3/4) ... [2018-11-22 23:02:06,356 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 23:02:06,356 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:02:06,357 INFO L168 Benchmark]: Toolchain (without parser) took 65741.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.2 MB). Free memory was 954.4 MB in the beginning and 1.0 GB in the end (delta: -68.0 MB). Peak memory consumption was 151.1 MB. Max. memory is 11.5 GB. [2018-11-22 23:02:06,357 INFO L168 Benchmark]: CDTParser took 0.12 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-22 23:02:06,358 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 954.4 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2018-11-22 23:02:06,358 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.64 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-22 23:02:06,359 INFO L168 Benchmark]: Boogie Preprocessor took 16.01 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-22 23:02:06,359 INFO L168 Benchmark]: RCFGBuilder took 234.69 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-22 23:02:06,359 INFO L168 Benchmark]: BuchiAutomizer took 65126.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.1 MB). Peak memory consumption was 159.5 MB. Max. memory is 11.5 GB. [2018-11-22 23:02:06,360 INFO L168 Benchmark]: Witness Printer took 3.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:02:06,362 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.12 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 328.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 954.4 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.64 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. * Boogie Preprocessor took 16.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 234.69 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 65126.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.1 MB). Peak memory consumption was 159.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 4 locations. One deterministic module has affine ranking function -1 * d + unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 65.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 64.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 33 SDtfs, 35 SDslu, 23 SDs, 0 SdLazy, 15 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital1031 mio100 ax100 hnf99 lsp273 ukn25 mio100 lsp89 div112 bol100 ite100 ukn100 eq183 hnf86 smp55 dnf250 smp48 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 5 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...