./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ab9b7130-55d8-4b7a-9517-691177969b77/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ab9b7130-55d8-4b7a-9517-691177969b77/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ab9b7130-55d8-4b7a-9517-691177969b77/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ab9b7130-55d8-4b7a-9517-691177969b77/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ab9b7130-55d8-4b7a-9517-691177969b77/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ab9b7130-55d8-4b7a-9517-691177969b77/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 3dbc6bab9a799b7f4b90bf959cd96947d3b192e5 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:03:13,808 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:03:13,809 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:03:13,815 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:03:13,816 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:03:13,816 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:03:13,817 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:03:13,818 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:03:13,819 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:03:13,820 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:03:13,821 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:03:13,821 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:03:13,821 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:03:13,822 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:03:13,823 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:03:13,823 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:03:13,824 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:03:13,825 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:03:13,826 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:03:13,827 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:03:13,828 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:03:13,829 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:03:13,830 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:03:13,830 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:03:13,830 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:03:13,831 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:03:13,832 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:03:13,832 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:03:13,833 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:03:13,834 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:03:13,834 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:03:13,834 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:03:13,834 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:03:13,835 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:03:13,835 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:03:13,836 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:03:13,836 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ab9b7130-55d8-4b7a-9517-691177969b77/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 05:03:13,844 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:03:13,844 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:03:13,845 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:03:13,845 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:03:13,845 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:03:13,845 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:03:13,845 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:03:13,846 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:03:13,846 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:03:13,846 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:03:13,846 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:03:13,846 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:03:13,846 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:03:13,846 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:03:13,846 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:03:13,848 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:03:13,848 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:03:13,848 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:03:13,848 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:03:13,848 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:03:13,849 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:03:13,849 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:03:13,849 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:03:13,849 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:03:13,849 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:03:13,849 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:03:13,849 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:03:13,849 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:03:13,850 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:03:13,850 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:03:13,850 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:03:13,851 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_ab9b7130-55d8-4b7a-9517-691177969b77/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 -> 3dbc6bab9a799b7f4b90bf959cd96947d3b192e5 [2018-11-10 05:03:13,873 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:03:13,881 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:03:13,884 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:03:13,885 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:03:13,885 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:03:13,886 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ab9b7130-55d8-4b7a-9517-691177969b77/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2_true-valid-memsafety_true-termination.i [2018-11-10 05:03:13,921 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab9b7130-55d8-4b7a-9517-691177969b77/bin-2019/uautomizer/data/4a9bddc48/b5616f88058c43619695c3a5c452feec/FLAG3bec7fc00 [2018-11-10 05:03:14,221 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:03:14,222 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ab9b7130-55d8-4b7a-9517-691177969b77/sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2_true-valid-memsafety_true-termination.i [2018-11-10 05:03:14,226 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab9b7130-55d8-4b7a-9517-691177969b77/bin-2019/uautomizer/data/4a9bddc48/b5616f88058c43619695c3a5c452feec/FLAG3bec7fc00 [2018-11-10 05:03:14,234 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ab9b7130-55d8-4b7a-9517-691177969b77/bin-2019/uautomizer/data/4a9bddc48/b5616f88058c43619695c3a5c452feec [2018-11-10 05:03:14,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:03:14,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:03:14,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:03:14,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:03:14,241 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:03:14,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:03:14" (1/1) ... [2018-11-10 05:03:14,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c31fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:03:14, skipping insertion in model container [2018-11-10 05:03:14,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:03:14" (1/1) ... [2018-11-10 05:03:14,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:03:14,260 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:03:14,347 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:03:14,354 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:03:14,364 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:03:14,376 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:03:14,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:03:14 WrapperNode [2018-11-10 05:03:14,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:03:14,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:03:14,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:03:14,377 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:03:14,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:03:14" (1/1) ... [2018-11-10 05:03:14,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:03:14" (1/1) ... [2018-11-10 05:03:14,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:03:14,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:03:14,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:03:14,405 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:03:14,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:03:14" (1/1) ... [2018-11-10 05:03:14,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:03:14" (1/1) ... [2018-11-10 05:03:14,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:03:14" (1/1) ... [2018-11-10 05:03:14,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:03:14" (1/1) ... [2018-11-10 05:03:14,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:03:14" (1/1) ... [2018-11-10 05:03:14,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:03:14" (1/1) ... [2018-11-10 05:03:14,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:03:14" (1/1) ... [2018-11-10 05:03:14,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:03:14,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:03:14,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:03:14,427 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:03:14,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:03:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab9b7130-55d8-4b7a-9517-691177969b77/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-10 05:03:14,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 05:03:14,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:03:14,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:03:14,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-10 05:03:14,505 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-10 05:03:14,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 05:03:14,720 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:03:14,736 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:03:14,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:03:14 BoogieIcfgContainer [2018-11-10 05:03:14,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:03:14,737 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:03:14,737 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:03:14,740 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:03:14,741 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:03:14,741 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:03:14" (1/3) ... [2018-11-10 05:03:14,742 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62aec905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:03:14, skipping insertion in model container [2018-11-10 05:03:14,742 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:03:14,742 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:03:14" (2/3) ... [2018-11-10 05:03:14,742 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62aec905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:03:14, skipping insertion in model container [2018-11-10 05:03:14,742 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:03:14,742 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:03:14" (3/3) ... [2018-11-10 05:03:14,744 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-bitfields-2_true-valid-memsafety_true-termination.i [2018-11-10 05:03:14,794 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:03:14,795 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:03:14,795 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:03:14,795 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:03:14,795 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:03:14,796 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:03:14,796 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:03:14,796 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:03:14,796 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:03:14,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 05:03:14,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-10 05:03:14,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:03:14,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:03:14,835 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:03:14,836 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-10 05:03:14,836 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:03:14,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 05:03:14,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-10 05:03:14,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:03:14,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:03:14,838 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:03:14,838 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-10 05:03:14,847 INFO L793 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#d~0.base, ~#d~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~unchecked~int_old_#memory_int := #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#d~0.base, ~#d~0.offset + 0, 1;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_int := #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#d~0.base, ~#d~0.offset + 1, 1;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_int := #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#d~0.base, ~#d~0.offset + 2, 1;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_int := #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#d~0.base, ~#d~0.offset + 3, 1;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_int := #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#d~0.base, ~#d~0.offset + 4, 1;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~memcpy1.base, main_#t~memcpy1.offset, main_#t~mem2, main_#t~mem3, main_#t~mem4, main_#t~mem5, main_#t~mem6, main_~p~0.base, main_~p~0.offset;havoc main_~p~0.base, main_~p~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 14#L26true SUMMARY for call write~int(1, ~#d~0.base, ~#d~0.offset + 0, 1); srcloc: L26 30#L26-1true SUMMARY for call write~int(2, ~#d~0.base, ~#d~0.offset + 1, 1); srcloc: L26-1 4#L27true SUMMARY for call write~int(3, ~#d~0.base, ~#d~0.offset + 2, 1); srcloc: L27 16#L28true SUMMARY for call write~int(4, ~#d~0.base, ~#d~0.offset + 3, 1); srcloc: L28 6#L29true SUMMARY for call write~int(5, ~#d~0.base, ~#d~0.offset + 4, 1); srcloc: L29 19#L30true call main_#t~memcpy1.base, main_#t~memcpy1.offset := #Ultimate.C_memcpy(main_~p~0.base, main_~p~0.offset, ~#d~0.base, ~#d~0.offset, 4);< 10##Ultimate.C_memcpyENTRYtrue assume #valid[dest.base] == 1;assume #valid[src.base] == 1;assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 3#$Ultimate##0true #t~loopctr8 := 0; 20#L-1-1true [2018-11-10 05:03:14,847 INFO L795 eck$LassoCheckResult]: Loop: 20#L-1-1true assume #t~loopctr8 < size;#memory_int := #memory_int[dest.base,dest.offset + #t~loopctr8 * 1 := #memory_int[src.base,src.offset + #t~loopctr8 * 1]];#t~loopctr8 := #t~loopctr8 + 1; 20#L-1-1true [2018-11-10 05:03:14,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:03:14,852 INFO L82 PathProgramCache]: Analyzing trace with hash -779429127, now seen corresponding path program 1 times [2018-11-10 05:03:14,854 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:03:14,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:03:14,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:03:14,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:03:14,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:03:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:03:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:03:14,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:03:14,994 INFO L82 PathProgramCache]: Analyzing trace with hash 85, now seen corresponding path program 1 times [2018-11-10 05:03:14,994 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:03:14,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:03:14,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:03:14,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:03:14,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:03:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:03:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:03:15,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:03:15,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1607500893, now seen corresponding path program 1 times [2018-11-10 05:03:15,002 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:03:15,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:03:15,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:03:15,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:03:15,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:03:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:03:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:03:15,698 WARN L179 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 130 [2018-11-10 05:03:15,815 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-11-10 05:03:16,078 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 105 [2018-11-10 05:03:16,145 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:03:16,146 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:03:16,146 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:03:16,146 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:03:16,147 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:03:16,147 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:03:16,147 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:03:16,147 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:03:16,147 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-10 05:03:16,147 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:03:16,148 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:03:16,170 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-10 05:03:16,175 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-10 05:03:16,178 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-10 05:03:16,180 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-10 05:03:16,183 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-10 05:03:16,185 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-10 05:03:16,192 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-10 05:03:16,195 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-10 05:03:16,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-11-10 05:03:16,269 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-10 05:03:16,270 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-10 05:03:16,271 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-10 05:03:16,273 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-10 05:03:16,274 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-10 05:03:16,275 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-10 05:03:16,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-10 05:03:16,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-10 05:03:16,279 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-10 05:03:16,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-10 05:03:16,282 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-10 05:03:16,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-10 05:03:16,285 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-10 05:03:16,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-10 05:03:16,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-10 05:03:16,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-10 05:03:16,291 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-10 05:03:16,293 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-10 05:03:16,294 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-10 05:03:16,296 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-10 05:03:16,303 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-10 05:03:16,304 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-10 05:03:16,306 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-10 05:03:16,308 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-10 05:03:16,312 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-10 05:03:16,314 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-10 05:03:16,454 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:03:16,457 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:03:16,459 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-10 05:03:16,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:03:16,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:03:16,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:03:16,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:03:16,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:03:16,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:03:16,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:03:16,464 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:03:16,465 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-10 05:03:16,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:03:16,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:03:16,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:03:16,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:03:16,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:03:16,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:03:16,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:03:16,467 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:03:16,468 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-10 05:03:16,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:03:16,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:03:16,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:03:16,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:03:16,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:03:16,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:03:16,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:03:16,469 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:03:16,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-10 05:03:16,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:03:16,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:03:16,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:03:16,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:03:16,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:03:16,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:03:16,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:03:16,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:03:16,472 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-10 05:03:16,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:03:16,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:03:16,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:03:16,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:03:16,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:03:16,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:03:16,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:03:16,474 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:03:16,474 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-10 05:03:16,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:03:16,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:03:16,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:03:16,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:03:16,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:03:16,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:03:16,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:03:16,476 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:03:16,477 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-10 05:03:16,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:03:16,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:03:16,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:03:16,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:03:16,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:03:16,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:03:16,483 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:03:16,483 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-10 05:03:16,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:03:16,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:03:16,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:03:16,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:03:16,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:03:16,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:03:16,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:03:16,486 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:03:16,486 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-10 05:03:16,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:03:16,487 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:03:16,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:03:16,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:03:16,489 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:03:16,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:03:16,496 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:03:16,497 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-10 05:03:16,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:03:16,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:03:16,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:03:16,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:03:16,499 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:03:16,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:03:16,505 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:03:16,505 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-10 05:03:16,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:03:16,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:03:16,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:03:16,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:03:16,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:03:16,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:03:16,528 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:03:16,538 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 05:03:16,538 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:03:16,540 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:03:16,542 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:03:16,543 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:03:16,543 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr8, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr8 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2018-11-10 05:03:16,557 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-10 05:03:16,563 WARN L1239 BoogieBacktranslator]: unknown boogie variable size [2018-11-10 05:03:16,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:03:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:03:16,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:03:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:03:16,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:03:16,621 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-10 05:03:16,636 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-10 05:03:16,637 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states. Second operand 2 states. [2018-11-10 05:03:16,675 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states.. Second operand 2 states. Result 31 states and 38 transitions. Complement of second has 6 states. [2018-11-10 05:03:16,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 05:03:16,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-10 05:03:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2018-11-10 05:03:16,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 1 letters. [2018-11-10 05:03:16,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:03:16,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 1 letters. [2018-11-10 05:03:16,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:03:16,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-10 05:03:16,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:03:16,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2018-11-10 05:03:16,682 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:03:16,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2018-11-10 05:03:16,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:03:16,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:03:16,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:03:16,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:03:16,685 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:03:16,685 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:03:16,685 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:03:16,686 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:03:16,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:03:16,686 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:03:16,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 05:03:16,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:03:16 BoogieIcfgContainer [2018-11-10 05:03:16,690 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:03:16,690 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:03:16,691 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:03:16,691 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:03:16,691 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:03:14" (3/4) ... [2018-11-10 05:03:16,694 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 05:03:16,694 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:03:16,694 INFO L168 Benchmark]: Toolchain (without parser) took 2457.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 959.2 MB in the beginning and 821.7 MB in the end (delta: 137.4 MB). Peak memory consumption was 287.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:03:16,695 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:03:16,695 INFO L168 Benchmark]: CACSL2BoogieTranslator took 138.99 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:03:16,696 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.68 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:03:16,696 INFO L168 Benchmark]: Boogie Preprocessor took 21.30 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:03:16,697 INFO L168 Benchmark]: RCFGBuilder took 310.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-10 05:03:16,697 INFO L168 Benchmark]: BuchiAutomizer took 1953.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 821.7 MB in the end (delta: 297.3 MB). Peak memory consumption was 297.3 MB. Max. memory is 11.5 GB. [2018-11-10 05:03:16,698 INFO L168 Benchmark]: Witness Printer took 3.27 ms. Allocated memory is still 1.2 GB. Free memory is still 821.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:03:16,701 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 138.99 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.68 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.30 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 310.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1953.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 821.7 MB in the end (delta: 297.3 MB). Peak memory consumption was 297.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.27 ms. Allocated memory is still 1.2 GB. Free memory is still 821.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable size * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * aux-#t~loopctr8-aux + unknown-size-unknown and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 11 SDtfs, 11 SDslu, 1 SDs, 0 SdLazy, 6 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital172 mio100 ax100 hnf100 lsp96 ukn43 mio100 lsp60 div100 bol100 ite100 ukn100 eq186 hnf71 smp79 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 2 VariablesLoop: 0 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...