./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4ee4c407-2379-4ce4-9670-1f1096de745d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4ee4c407-2379-4ce4-9670-1f1096de745d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4ee4c407-2379-4ce4-9670-1f1096de745d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4ee4c407-2379-4ce4-9670-1f1096de745d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4ee4c407-2379-4ce4-9670-1f1096de745d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4ee4c407-2379-4ce4-9670-1f1096de745d/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 bb65be693a5a8084c5f6f02ff3a6e18ec8f053b3 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 17:45:29,292 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 17:45:29,293 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 17:45:29,299 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 17:45:29,299 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 17:45:29,299 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 17:45:29,300 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 17:45:29,301 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 17:45:29,302 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 17:45:29,302 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 17:45:29,303 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 17:45:29,303 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 17:45:29,303 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 17:45:29,304 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 17:45:29,304 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 17:45:29,305 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 17:45:29,305 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 17:45:29,306 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 17:45:29,307 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 17:45:29,308 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 17:45:29,308 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 17:45:29,309 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 17:45:29,310 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 17:45:29,310 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 17:45:29,310 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 17:45:29,311 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 17:45:29,311 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 17:45:29,312 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 17:45:29,312 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 17:45:29,312 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 17:45:29,313 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 17:45:29,313 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 17:45:29,313 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 17:45:29,313 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 17:45:29,314 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 17:45:29,314 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 17:45:29,314 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4ee4c407-2379-4ce4-9670-1f1096de745d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-01 17:45:29,322 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 17:45:29,322 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 17:45:29,323 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 17:45:29,323 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 17:45:29,323 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 17:45:29,323 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 17:45:29,323 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 17:45:29,324 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 17:45:29,324 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 17:45:29,324 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 17:45:29,324 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 17:45:29,324 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 17:45:29,324 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 17:45:29,324 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 17:45:29,324 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 17:45:29,325 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 17:45:29,325 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 17:45:29,325 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 17:45:29,325 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 17:45:29,325 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 17:45:29,325 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 17:45:29,325 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 17:45:29,325 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 17:45:29,326 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 17:45:29,326 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 17:45:29,326 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 17:45:29,326 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 17:45:29,326 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 17:45:29,326 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 17:45:29,326 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 17:45:29,326 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 17:45:29,327 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 17:45:29,327 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_4ee4c407-2379-4ce4-9670-1f1096de745d/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 -> bb65be693a5a8084c5f6f02ff3a6e18ec8f053b3 [2018-12-01 17:45:29,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 17:45:29,354 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 17:45:29,356 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 17:45:29,357 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 17:45:29,357 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 17:45:29,358 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4ee4c407-2379-4ce4-9670-1f1096de745d/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-01 17:45:29,391 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4ee4c407-2379-4ce4-9670-1f1096de745d/bin-2019/uautomizer/data/150e4257a/59dba423edd54fb9a1511ea20f4ef2a5/FLAGd19c1e408 [2018-12-01 17:45:29,831 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 17:45:29,831 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4ee4c407-2379-4ce4-9670-1f1096de745d/sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-01 17:45:29,837 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4ee4c407-2379-4ce4-9670-1f1096de745d/bin-2019/uautomizer/data/150e4257a/59dba423edd54fb9a1511ea20f4ef2a5/FLAGd19c1e408 [2018-12-01 17:45:29,845 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4ee4c407-2379-4ce4-9670-1f1096de745d/bin-2019/uautomizer/data/150e4257a/59dba423edd54fb9a1511ea20f4ef2a5 [2018-12-01 17:45:29,847 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 17:45:29,848 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 17:45:29,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 17:45:29,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 17:45:29,850 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 17:45:29,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:45:29" (1/1) ... [2018-12-01 17:45:29,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52fe4f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:45:29, skipping insertion in model container [2018-12-01 17:45:29,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:45:29" (1/1) ... [2018-12-01 17:45:29,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 17:45:29,874 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 17:45:30,013 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:45:30,019 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 17:45:30,077 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:45:30,105 INFO L195 MainTranslator]: Completed translation [2018-12-01 17:45:30,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:45:30 WrapperNode [2018-12-01 17:45:30,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 17:45:30,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 17:45:30,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 17:45:30,106 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 17:45:30,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:45:30" (1/1) ... [2018-12-01 17:45:30,118 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:45:30" (1/1) ... [2018-12-01 17:45:30,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 17:45:30,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 17:45:30,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 17:45:30,131 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 17:45:30,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:45:30" (1/1) ... [2018-12-01 17:45:30,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:45:30" (1/1) ... [2018-12-01 17:45:30,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:45:30" (1/1) ... [2018-12-01 17:45:30,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:45:30" (1/1) ... [2018-12-01 17:45:30,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:45:30" (1/1) ... [2018-12-01 17:45:30,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:45:30" (1/1) ... [2018-12-01 17:45:30,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:45:30" (1/1) ... [2018-12-01 17:45:30,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 17:45:30,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 17:45:30,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 17:45:30,146 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 17:45:30,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:45:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ee4c407-2379-4ce4-9670-1f1096de745d/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-12-01 17:45:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 17:45:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 17:45:30,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 17:45:30,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 17:45:30,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 17:45:30,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 17:45:30,314 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 17:45:30,315 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 17:45:30,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:45:30 BoogieIcfgContainer [2018-12-01 17:45:30,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 17:45:30,315 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 17:45:30,315 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 17:45:30,318 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 17:45:30,318 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 17:45:30,318 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 05:45:29" (1/3) ... [2018-12-01 17:45:30,319 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@737cd8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 05:45:30, skipping insertion in model container [2018-12-01 17:45:30,319 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 17:45:30,319 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:45:30" (2/3) ... [2018-12-01 17:45:30,319 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@737cd8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 05:45:30, skipping insertion in model container [2018-12-01 17:45:30,320 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 17:45:30,320 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:45:30" (3/3) ... [2018-12-01 17:45:30,321 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-01 17:45:30,354 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 17:45:30,354 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 17:45:30,354 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 17:45:30,354 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 17:45:30,354 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 17:45:30,355 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 17:45:30,355 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 17:45:30,355 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 17:45:30,355 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 17:45:30,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-01 17:45:30,376 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-01 17:45:30,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:45:30,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:45:30,381 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-01 17:45:30,381 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 17:45:30,381 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 17:45:30,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-01 17:45:30,382 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-01 17:45:30,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:45:30,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:45:30,382 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-01 17:45:30,382 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 17:45:30,387 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.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~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 19#L559true assume !(main_~length~0 < 1); 6#L559-2true assume !(main_~n~0 < 1); 17#L562-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset, cstrncpy_#in~src.base, cstrncpy_#in~src.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~pre6, cstrncpy_#t~pre2, cstrncpy_~d~0.base, cstrncpy_~d~0.offset, cstrncpy_~s~0.base, cstrncpy_~s~0.offset, cstrncpy_~dst.base, cstrncpy_~dst.offset, cstrncpy_~src.base, cstrncpy_~src.offset, cstrncpy_~n;cstrncpy_~dst.base, cstrncpy_~dst.offset := cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset;cstrncpy_~src.base, cstrncpy_~src.offset := cstrncpy_#in~src.base, cstrncpy_#in~src.offset;cstrncpy_~n := cstrncpy_#in~n; 11#L543true assume 0 != cstrncpy_~n % 4294967296;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_~dst.base, cstrncpy_~dst.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_~src.base, cstrncpy_~src.offset; 13#L546-4true [2018-12-01 17:45:30,387 INFO L796 eck$LassoCheckResult]: Loop: 13#L546-4true cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~d~0.base, cstrncpy_~d~0.offset;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~s~0.base, cstrncpy_~s~0.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 4#L547true assume !(0 == cstrncpy_#t~mem5);havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~mem5; 8#L546-1true cstrncpy_#t~pre2 := cstrncpy_~n - 1;cstrncpy_~n := cstrncpy_~n - 1; 9#L546-2true assume !!(0 != cstrncpy_#t~pre2 % 4294967296);havoc cstrncpy_#t~pre2; 13#L546-4true [2018-12-01 17:45:30,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:45:30,391 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2018-12-01 17:45:30,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:45:30,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:45:30,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:45:30,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:45:30,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:45:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:45:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:45:30,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:45:30,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1618712, now seen corresponding path program 1 times [2018-12-01 17:45:30,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:45:30,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:45:30,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:45:30,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:45:30,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:45:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:45:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:45:30,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:45:30,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1592246563, now seen corresponding path program 1 times [2018-12-01 17:45:30,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:45:30,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:45:30,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:45:30,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:45:30,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:45:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:45:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:45:30,820 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2018-12-01 17:45:30,891 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 17:45:30,892 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 17:45:30,892 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 17:45:30,892 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 17:45:30,892 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 17:45:30,892 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 17:45:30,892 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 17:45:30,893 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 17:45:30,893 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-12-01 17:45:30,893 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 17:45:30,893 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 17:45:30,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:30,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:30,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:30,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:30,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:30,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:30,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:30,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:31,105 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2018-12-01 17:45:31,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:31,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:31,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:31,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:31,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:31,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:31,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:31,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:31,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:31,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:31,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:31,353 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-12-01 17:45:31,660 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 17:45:31,663 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 17:45:31,664 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-12-01 17:45:31,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:45:31,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:45:31,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:45:31,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:45:31,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:45:31,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:45:31,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:45:31,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:45:31,668 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-12-01 17:45:31,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:45:31,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:45:31,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:45:31,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:45:31,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:45:31,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:45:31,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:45:31,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:45:31,670 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-12-01 17:45:31,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:45:31,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:45:31,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:45:31,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:45:31,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:45:31,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:45:31,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:45:31,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:45:31,671 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-12-01 17:45:31,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:45:31,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:45:31,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:45:31,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:45:31,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:45:31,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:45:31,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:45:31,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:45:31,673 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-12-01 17:45:31,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:45:31,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:45:31,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:45:31,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:45:31,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:45:31,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:45:31,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:45:31,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:45:31,674 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-12-01 17:45:31,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:45:31,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:45:31,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:45:31,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:45:31,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:45:31,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:45:31,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:45:31,678 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-12-01 17:45:31,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:45:31,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:45:31,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:45:31,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:45:31,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:45:31,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:45:31,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:45:31,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:45:31,680 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-12-01 17:45:31,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:45:31,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:45:31,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:45:31,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:45:31,688 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:45:31,688 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:45:31,750 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 17:45:31,802 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 17:45:31,803 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-01 17:45:31,804 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 17:45:31,806 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 17:45:31,806 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 17:45:31,806 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1) = -1*ULTIMATE.start_cstrncpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 Supporting invariants [] [2018-12-01 17:45:31,851 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-12-01 17:45:31,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 17:45:31,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:45:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:45:31,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:45:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:45:31,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:45:31,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:45:31,941 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-01 17:45:31,942 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2018-12-01 17:45:31,999 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 36 states and 44 transitions. Complement of second has 7 states. [2018-12-01 17:45:31,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 17:45:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 17:45:32,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-12-01 17:45:32,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-01 17:45:32,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:45:32,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-01 17:45:32,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:45:32,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 8 letters. [2018-12-01 17:45:32,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:45:32,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2018-12-01 17:45:32,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 17:45:32,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 14 states and 17 transitions. [2018-12-01 17:45:32,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-01 17:45:32,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-01 17:45:32,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-12-01 17:45:32,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 17:45:32,009 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-12-01 17:45:32,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-12-01 17:45:32,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-12-01 17:45:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-01 17:45:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-12-01 17:45:32,025 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-12-01 17:45:32,025 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-12-01 17:45:32,025 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 17:45:32,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-12-01 17:45:32,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 17:45:32,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:45:32,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:45:32,026 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:45:32,026 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 17:45:32,026 INFO L794 eck$LassoCheckResult]: Stem: 175#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 168#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.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~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 169#L559 assume !(main_~length~0 < 1); 177#L559-2 assume !(main_~n~0 < 1); 178#L562-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset, cstrncpy_#in~src.base, cstrncpy_#in~src.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~pre6, cstrncpy_#t~pre2, cstrncpy_~d~0.base, cstrncpy_~d~0.offset, cstrncpy_~s~0.base, cstrncpy_~s~0.offset, cstrncpy_~dst.base, cstrncpy_~dst.offset, cstrncpy_~src.base, cstrncpy_~src.offset, cstrncpy_~n;cstrncpy_~dst.base, cstrncpy_~dst.offset := cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset;cstrncpy_~src.base, cstrncpy_~src.offset := cstrncpy_#in~src.base, cstrncpy_#in~src.offset;cstrncpy_~n := cstrncpy_#in~n; 180#L543 assume 0 != cstrncpy_~n % 4294967296;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_~dst.base, cstrncpy_~dst.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_~src.base, cstrncpy_~src.offset; 170#L546-4 cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~d~0.base, cstrncpy_~d~0.offset;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~s~0.base, cstrncpy_~s~0.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 171#L547 assume 0 == cstrncpy_#t~mem5;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~mem5; 174#L548-3 [2018-12-01 17:45:32,026 INFO L796 eck$LassoCheckResult]: Loop: 174#L548-3 cstrncpy_#t~pre6 := cstrncpy_~n - 1;cstrncpy_~n := cstrncpy_~n - 1; 176#L548-1 assume !!(0 != cstrncpy_#t~pre6 % 4294967296);havoc cstrncpy_#t~pre6;cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset := cstrncpy_~d~0.base, cstrncpy_~d~0.offset;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_#t~post7.base, 1 + cstrncpy_#t~post7.offset;call write~int(0, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, 1);havoc cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset; 174#L548-3 [2018-12-01 17:45:32,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:45:32,026 INFO L82 PathProgramCache]: Analyzing trace with hash 180427599, now seen corresponding path program 1 times [2018-12-01 17:45:32,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:45:32,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:45:32,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:45:32,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:45:32,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:45:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:45:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:45:32,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:45:32,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2018-12-01 17:45:32,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:45:32,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:45:32,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:45:32,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:45:32,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:45:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:45:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:45:32,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:45:32,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231764, now seen corresponding path program 1 times [2018-12-01 17:45:32,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:45:32,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:45:32,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:45:32,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:45:32,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:45:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:45:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:45:32,349 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 120 [2018-12-01 17:45:32,432 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 17:45:32,433 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 17:45:32,433 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 17:45:32,433 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 17:45:32,433 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 17:45:32,433 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 17:45:32,433 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 17:45:32,433 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 17:45:32,433 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-12-01 17:45:32,433 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 17:45:32,433 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 17:45:32,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:32,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:32,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:32,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:32,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:32,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:32,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:32,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:32,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:32,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:32,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:32,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:32,596 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2018-12-01 17:45:32,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:32,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:32,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:32,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:32,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:32,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:32,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:45:33,017 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 17:45:33,018 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 17:45:33,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:45:33,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:45:33,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:45:33,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:45:33,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:45:33,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:45:33,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:45:33,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:45:33,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:45:33,020 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-12-01 17:45:33,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:45:33,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:45:33,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:45:33,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:45:33,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:45:33,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:45:33,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:45:33,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:45:33,021 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-12-01 17:45:33,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:45:33,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:45:33,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:45:33,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:45:33,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:45:33,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:45:33,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:45:33,024 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-12-01 17:45:33,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:45:33,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:45:33,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:45:33,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:45:33,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:45:33,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:45:33,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:45:33,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:45:33,026 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-12-01 17:45:33,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:45:33,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:45:33,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:45:33,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:45:33,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:45:33,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:45:33,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:45:33,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:45:33,027 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-12-01 17:45:33,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:45:33,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:45:33,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:45:33,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:45:33,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:45:33,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:45:33,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:45:33,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:45:33,029 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-12-01 17:45:33,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:45:33,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:45:33,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:45:33,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:45:33,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:45:33,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:45:33,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:45:33,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:45:33,031 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-12-01 17:45:33,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:45:33,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:45:33,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:45:33,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:45:33,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:45:33,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:45:33,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:45:33,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:45:33,033 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-12-01 17:45:33,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:45:33,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:45:33,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:45:33,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:45:33,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:45:33,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:45:33,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:45:33,036 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-12-01 17:45:33,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:45:33,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:45:33,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:45:33,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:45:33,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:45:33,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:45:33,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:45:33,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:45:33,038 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-12-01 17:45:33,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:45:33,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:45:33,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:45:33,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:45:33,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:45:33,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:45:33,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:45:33,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:45:33,040 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-12-01 17:45:33,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:45:33,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:45:33,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:45:33,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:45:33,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:45:33,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:45:33,064 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 17:45:33,083 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 17:45:33,084 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-01 17:45:33,084 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 17:45:33,085 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 17:45:33,085 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 17:45:33,085 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~d~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2) = -1*ULTIMATE.start_cstrncpy_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2 Supporting invariants [] [2018-12-01 17:45:33,109 INFO L297 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2018-12-01 17:45:33,110 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 17:45:33,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:45:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:45:33,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:45:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:45:33,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:45:33,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:45:33,162 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-12-01 17:45:33,162 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-12-01 17:45:33,194 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 6 states. [2018-12-01 17:45:33,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 17:45:33,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 17:45:33,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-12-01 17:45:33,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 2 letters. [2018-12-01 17:45:33,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:45:33,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 10 letters. Loop has 2 letters. [2018-12-01 17:45:33,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:45:33,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-01 17:45:33,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:45:33,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-12-01 17:45:33,196 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 17:45:33,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2018-12-01 17:45:33,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 17:45:33,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 17:45:33,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 17:45:33,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 17:45:33,197 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 17:45:33,197 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 17:45:33,197 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 17:45:33,197 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 17:45:33,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 17:45:33,197 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 17:45:33,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 17:45:33,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 05:45:33 BoogieIcfgContainer [2018-12-01 17:45:33,201 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 17:45:33,201 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 17:45:33,201 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 17:45:33,201 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 17:45:33,201 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:45:30" (3/4) ... [2018-12-01 17:45:33,204 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 17:45:33,204 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 17:45:33,204 INFO L168 Benchmark]: Toolchain (without parser) took 3356.83 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 320.9 MB). Free memory was 957.1 MB in the beginning and 1.2 GB in the end (delta: -284.4 MB). Peak memory consumption was 36.4 MB. Max. memory is 11.5 GB. [2018-12-01 17:45:33,205 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:45:33,205 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-01 17:45:33,205 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.17 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-12-01 17:45:33,205 INFO L168 Benchmark]: Boogie Preprocessor took 15.28 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-12-01 17:45:33,206 INFO L168 Benchmark]: RCFGBuilder took 168.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-01 17:45:33,206 INFO L168 Benchmark]: BuchiAutomizer took 2885.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -145.4 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. [2018-12-01 17:45:33,206 INFO L168 Benchmark]: Witness Printer took 2.63 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:45:33,208 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 257.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.28 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 168.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2885.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -145.4 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.63 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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 -1 * s + unknown-#length-unknown[__builtin_alloca (length * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function -1 * d + unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. 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: 31 SDtfs, 37 SDslu, 26 SDs, 0 SdLazy, 16 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital231 mio100 ax100 hnf99 lsp97 ukn84 mio100 lsp52 div181 bol100 ite100 ukn100 eq173 hnf68 smp93 dnf100 smp100 tf100 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...