./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/ldv-memsafety-bitfields/test-bitfields-3.1_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/ldv-memsafety-bitfields/test-bitfields-3.1_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 72da1f6907bc4b842c40cca6c3dd762e325d6dec .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 05:01:14,801 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 05:01:14,803 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 05:01:14,814 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 05:01:14,815 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 05:01:14,816 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 05:01:14,817 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 05:01:14,819 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 05:01:14,821 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 05:01:14,822 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 05:01:14,823 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 05:01:14,824 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 05:01:14,824 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 05:01:14,826 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 05:01:14,827 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 05:01:14,828 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 05:01:14,829 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 05:01:14,831 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 05:01:14,833 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 05:01:14,835 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 05:01:14,836 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 05:01:14,837 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 05:01:14,840 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 05:01:14,840 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 05:01:14,841 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 05:01:14,842 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 05:01:14,847 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 05:01:14,848 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 05:01:14,849 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 05:01:14,850 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 05:01:14,851 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 05:01:14,851 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 05:01:14,851 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 05:01:14,852 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 05:01:14,853 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 05:01:14,854 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 05:01:14,854 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 05:01:14,881 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 05:01:14,881 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 05:01:14,883 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 05:01:14,883 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 05:01:14,884 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 05:01:14,884 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 05:01:14,884 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 05:01:14,884 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 05:01:14,884 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 05:01:14,885 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 05:01:14,886 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 05:01:14,886 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 05:01:14,886 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 05:01:14,886 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 05:01:14,886 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 05:01:14,887 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 05:01:14,887 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 05:01:14,887 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 05:01:14,887 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 05:01:14,887 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 05:01:14,887 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 05:01:14,888 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 05:01:14,889 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 05:01:14,889 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 05:01:14,889 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 05:01:14,889 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 05:01:14,890 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 05:01:14,890 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 05:01:14,890 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 05:01:14,890 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 05:01:14,890 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 05:01:14,891 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 05:01:14,891 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 72da1f6907bc4b842c40cca6c3dd762e325d6dec [2019-01-14 05:01:14,940 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 05:01:14,955 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 05:01:14,962 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 05:01:14,964 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 05:01:14,964 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 05:01:14,966 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety-bitfields/test-bitfields-3.1_true-valid-memsafety_true-termination.i [2019-01-14 05:01:15,018 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a06018e1d/cc688626558d4109b023bd2e89dec292/FLAG9642e7877 [2019-01-14 05:01:15,483 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 05:01:15,483 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety-bitfields/test-bitfields-3.1_true-valid-memsafety_true-termination.i [2019-01-14 05:01:15,491 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a06018e1d/cc688626558d4109b023bd2e89dec292/FLAG9642e7877 [2019-01-14 05:01:15,821 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a06018e1d/cc688626558d4109b023bd2e89dec292 [2019-01-14 05:01:15,825 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 05:01:15,827 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 05:01:15,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 05:01:15,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 05:01:15,832 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 05:01:15,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:01:15" (1/1) ... [2019-01-14 05:01:15,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c433c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:15, skipping insertion in model container [2019-01-14 05:01:15,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:01:15" (1/1) ... [2019-01-14 05:01:15,844 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 05:01:15,864 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 05:01:16,046 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 05:01:16,075 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 05:01:16,098 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 05:01:16,130 INFO L195 MainTranslator]: Completed translation [2019-01-14 05:01:16,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:16 WrapperNode [2019-01-14 05:01:16,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 05:01:16,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 05:01:16,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 05:01:16,132 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 05:01:16,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:16" (1/1) ... [2019-01-14 05:01:16,154 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:16" (1/1) ... [2019-01-14 05:01:16,180 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 05:01:16,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 05:01:16,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 05:01:16,181 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 05:01:16,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:16" (1/1) ... [2019-01-14 05:01:16,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:16" (1/1) ... [2019-01-14 05:01:16,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:16" (1/1) ... [2019-01-14 05:01:16,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:16" (1/1) ... [2019-01-14 05:01:16,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:16" (1/1) ... [2019-01-14 05:01:16,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:16" (1/1) ... [2019-01-14 05:01:16,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:16" (1/1) ... [2019-01-14 05:01:16,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 05:01:16,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 05:01:16,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 05:01:16,299 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 05:01:16,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 05:01:16,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-01-14 05:01:16,367 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-01-14 05:01:16,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-01-14 05:01:16,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 05:01:16,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 05:01:16,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-01-14 05:01:16,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 05:01:16,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 05:01:16,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 05:01:16,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 05:01:16,763 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 05:01:16,826 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 05:01:16,826 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 05:01:16,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:01:16 BoogieIcfgContainer [2019-01-14 05:01:16,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 05:01:16,828 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 05:01:16,828 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 05:01:16,831 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 05:01:16,832 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 05:01:16,832 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 05:01:15" (1/3) ... [2019-01-14 05:01:16,833 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b6a2cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 05:01:16, skipping insertion in model container [2019-01-14 05:01:16,833 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 05:01:16,833 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:16" (2/3) ... [2019-01-14 05:01:16,834 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b6a2cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 05:01:16, skipping insertion in model container [2019-01-14 05:01:16,834 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 05:01:16,834 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:01:16" (3/3) ... [2019-01-14 05:01:16,836 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-bitfields-3.1_true-valid-memsafety_true-termination.i [2019-01-14 05:01:16,893 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 05:01:16,894 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 05:01:16,894 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 05:01:16,894 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 05:01:16,894 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 05:01:16,894 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 05:01:16,895 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 05:01:16,895 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 05:01:16,895 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 05:01:16,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-01-14 05:01:16,937 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-14 05:01:16,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 05:01:16,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 05:01:16,945 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 05:01:16,945 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 05:01:16,946 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 05:01:16,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-01-14 05:01:16,948 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-14 05:01:16,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 05:01:16,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 05:01:16,950 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 05:01:16,950 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 05:01:16,959 INFO L794 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(10);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#d~0.base);call write~unchecked~int(2, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~unchecked~int(3, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~unchecked~int(4, ~#d~0.base, 3 + ~#d~0.offset, 1); 7#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset, main_#t~mem2, main_#t~mem3, main_#t~mem4, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_~p~0.base, main_~p~0.offset;havoc main_~p~0.base, main_~p~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(10);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 18#L41true call main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset := #Ultimate.C_memcpy(main_~p~0.base, main_~p~0.offset, ~#d~0.base, ~#d~0.offset, 10);< 10##Ultimate.C_memcpyENTRYtrue assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 3#$Ultimate##0true #t~loopctr9 := 0; 19#L-1-1true [2019-01-14 05:01:16,959 INFO L796 eck$LassoCheckResult]: Loop: 19#L-1-1true assume #t~loopctr9 < size;call #t~mem10 := read~unchecked~int(src.base, src.offset + #t~loopctr9, 1);call write~unchecked~int(#t~mem10, dest.base, dest.offset + #t~loopctr9, 1);call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr9, 4);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr9, 4);#t~loopctr9 := 1 + #t~loopctr9; 19#L-1-1true [2019-01-14 05:01:16,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:01:16,965 INFO L82 PathProgramCache]: Analyzing trace with hash 28752799, now seen corresponding path program 1 times [2019-01-14 05:01:16,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:01:16,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:01:17,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:01:17,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 05:01:17,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:01:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:01:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:01:17,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:01:17,114 INFO L82 PathProgramCache]: Analyzing trace with hash 86, now seen corresponding path program 1 times [2019-01-14 05:01:17,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:01:17,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:01:17,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:01:17,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 05:01:17,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:01:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:01:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:01:17,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:01:17,149 INFO L82 PathProgramCache]: Analyzing trace with hash 891336824, now seen corresponding path program 1 times [2019-01-14 05:01:17,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:01:17,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:01:17,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:01:17,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 05:01:17,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:01:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:01:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:01:17,694 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-01-14 05:01:17,904 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-14 05:01:18,598 WARN L181 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-01-14 05:01:18,733 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-14 05:01:18,743 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 05:01:18,744 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 05:01:18,745 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 05:01:18,745 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 05:01:18,745 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 05:01:18,745 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 05:01:18,745 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 05:01:18,745 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 05:01:18,746 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-3.1_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2019-01-14 05:01:18,746 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 05:01:18,746 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 05:01:18,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:18,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:18,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:18,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:18,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:18,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:18,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:18,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:18,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:18,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:18,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:18,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:18,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:18,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:18,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:18,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:18,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:18,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:18,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:18,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:19,154 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-01-14 05:01:19,263 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2019-01-14 05:01:19,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:19,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:19,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:19,681 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2019-01-14 05:01:19,777 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 05:01:19,781 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 05:01:19,783 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 [2019-01-14 05:01:19,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:19,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:19,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:19,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:19,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:19,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:19,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:19,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:19,791 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 [2019-01-14 05:01:19,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:19,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:19,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:19,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:19,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:19,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:19,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:19,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:19,794 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 [2019-01-14 05:01:19,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:19,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:19,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:19,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:19,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:19,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:19,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:19,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:19,797 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 [2019-01-14 05:01:19,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:19,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:19,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:19,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:19,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:19,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:19,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:19,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:19,801 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 [2019-01-14 05:01:19,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:19,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:19,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:19,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:19,805 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:01:19,805 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:01:19,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:19,810 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 [2019-01-14 05:01:19,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:19,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:19,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:19,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:19,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:19,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:19,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:19,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:19,813 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 [2019-01-14 05:01:19,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:19,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:19,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:19,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:19,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:19,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:19,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:19,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:19,816 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 [2019-01-14 05:01:19,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:19,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:19,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:19,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:19,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:19,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:19,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:19,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:19,819 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 [2019-01-14 05:01:19,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:19,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:19,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:19,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:19,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:19,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:19,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:19,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:19,823 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 [2019-01-14 05:01:19,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:19,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:19,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:19,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:19,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:19,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:19,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:19,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:19,826 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 [2019-01-14 05:01:19,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:19,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:19,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:19,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:19,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:19,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:19,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:19,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:19,829 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 [2019-01-14 05:01:19,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:19,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:19,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:19,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:19,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:19,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:19,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:19,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:19,832 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 [2019-01-14 05:01:19,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:19,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:19,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:19,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:19,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:19,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:19,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:19,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:19,836 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 [2019-01-14 05:01:19,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:19,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:19,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:19,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:19,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:01:19,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:01:19,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:19,843 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 [2019-01-14 05:01:19,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:19,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:19,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:19,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:19,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:19,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:19,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:19,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:19,847 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 [2019-01-14 05:01:19,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:19,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:19,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:19,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:19,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:19,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:19,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:19,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:19,850 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 [2019-01-14 05:01:19,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:19,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:19,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:19,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:19,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:19,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:19,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:19,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:19,853 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 [2019-01-14 05:01:19,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:19,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:19,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:19,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:19,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:19,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:19,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:19,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:19,857 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 [2019-01-14 05:01:19,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:19,858 INFO L205 nArgumentSynthesizer]: 3 stem disjuncts [2019-01-14 05:01:19,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:19,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:19,863 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 05:01:19,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:01:19,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:19,893 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 [2019-01-14 05:01:19,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:19,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:19,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:19,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:19,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:01:19,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:01:19,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:19,909 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 [2019-01-14 05:01:19,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:19,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:19,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:19,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:19,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:01:19,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:01:19,946 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 05:01:20,026 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-14 05:01:20,026 INFO L444 ModelExtractionUtils]: 11 out of 19 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 05:01:20,030 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 05:01:20,034 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 05:01:20,034 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 05:01:20,035 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr9, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr9 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2019-01-14 05:01:20,139 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-01-14 05:01:20,155 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2019-01-14 05:01:20,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:01:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 05:01:20,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 05:01:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 05:01:20,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 05:01:20,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 05:01:20,311 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 [2019-01-14 05:01:20,312 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 2 states. [2019-01-14 05:01:20,380 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 2 states. Result 30 states and 41 transitions. Complement of second has 6 states. [2019-01-14 05:01:20,381 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 [2019-01-14 05:01:20,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 05:01:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-14 05:01:20,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-14 05:01:20,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 05:01:20,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-14 05:01:20,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 05:01:20,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 05:01:20,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 05:01:20,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 41 transitions. [2019-01-14 05:01:20,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 05:01:20,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 9 states and 11 transitions. [2019-01-14 05:01:20,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 05:01:20,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 05:01:20,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-01-14 05:01:20,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 05:01:20,399 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-14 05:01:20,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-01-14 05:01:20,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-14 05:01:20,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 05:01:20,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-01-14 05:01:20,422 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-14 05:01:20,422 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-14 05:01:20,422 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 05:01:20,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-01-14 05:01:20,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 05:01:20,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 05:01:20,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 05:01:20,424 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 05:01:20,424 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 05:01:20,424 INFO L794 eck$LassoCheckResult]: Stem: 123#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(10);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#d~0.base);call write~unchecked~int(2, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~unchecked~int(3, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~unchecked~int(4, ~#d~0.base, 3 + ~#d~0.offset, 1); 121#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset, main_#t~mem2, main_#t~mem3, main_#t~mem4, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_~p~0.base, main_~p~0.offset;havoc main_~p~0.base, main_~p~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(10);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 122#L41 call main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset := #Ultimate.C_memcpy(main_~p~0.base, main_~p~0.offset, ~#d~0.base, ~#d~0.offset, 10);< 127##Ultimate.C_memcpyENTRY assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 124#$Ultimate##0 #t~loopctr9 := 0; 125#L-1-1 assume !(#t~loopctr9 < size);#t~loopctr12 := 0; 126#L-1-3 [2019-01-14 05:01:20,424 INFO L796 eck$LassoCheckResult]: Loop: 126#L-1-3 assume #t~loopctr12 < size;#t~loopctr12 := 4 + #t~loopctr12; 126#L-1-3 [2019-01-14 05:01:20,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:01:20,425 INFO L82 PathProgramCache]: Analyzing trace with hash 891336826, now seen corresponding path program 1 times [2019-01-14 05:01:20,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:01:20,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:01:20,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:01:20,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 05:01:20,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:01:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 05:01:20,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 05:01:20,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 05:01:20,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 05:01:20,504 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 05:01:20,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:01:20,505 INFO L82 PathProgramCache]: Analyzing trace with hash 92, now seen corresponding path program 1 times [2019-01-14 05:01:20,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:01:20,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:01:20,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:01:20,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 05:01:20,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:01:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:01:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:01:20,540 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 05:01:20,540 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 05:01:20,540 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 05:01:20,540 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 05:01:20,540 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 05:01:20,540 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 05:01:20,540 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 05:01:20,541 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 05:01:20,541 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-3.1_true-valid-memsafety_true-termination.i_Iteration2_Loop [2019-01-14 05:01:20,541 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 05:01:20,541 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 05:01:20,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:20,578 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 05:01:20,580 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 05:01:20,585 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 05:01:20,585 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 05:01:20,611 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 05:01:20,611 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 05:01:20,711 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 05:01:20,713 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 05:01:20,713 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 05:01:20,713 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 05:01:20,713 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 05:01:20,714 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 05:01:20,714 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 05:01:20,714 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 05:01:20,714 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 05:01:20,714 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-3.1_true-valid-memsafety_true-termination.i_Iteration2_Loop [2019-01-14 05:01:20,714 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 05:01:20,714 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 05:01:20,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:20,743 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 05:01:20,744 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 05:01:20,744 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 [2019-01-14 05:01:20,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:20,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:20,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:20,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:20,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:20,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:20,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:20,752 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 05:01:20,755 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 05:01:20,756 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 05:01:20,757 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 05:01:20,757 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 05:01:20,757 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 05:01:20,757 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr12, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr12 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2019-01-14 05:01:20,758 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 05:01:20,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2019-01-14 05:01:20,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:01:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 05:01:20,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 05:01:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 05:01:20,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 05:01:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 05:01:20,869 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 [2019-01-14 05:01:20,869 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 05:01:20,878 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 9 states and 11 transitions. Complement of second has 3 states. [2019-01-14 05:01:20,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2019-01-14 05:01:20,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 05:01:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2019-01-14 05:01:20,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-14 05:01:20,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 05:01:20,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 7 letters. Loop has 1 letters. [2019-01-14 05:01:20,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 05:01:20,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 05:01:20,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 05:01:20,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-01-14 05:01:20,882 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 05:01:20,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-01-14 05:01:20,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 05:01:20,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 05:01:20,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 05:01:20,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 05:01:20,884 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 05:01:20,884 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 05:01:20,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 05:01:20,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 05:01:20,888 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2019-01-14 05:01:20,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 05:01:20,890 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 05:01:20,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 05:01:20,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 05:01:20,891 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 05:01:20,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 05:01:20,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 05:01:20,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 05:01:20,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 05:01:20,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 05:01:20,892 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 05:01:20,892 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 05:01:20,892 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 05:01:20,892 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 05:01:20,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 05:01:20,892 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 05:01:20,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 05:01:20,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 05:01:20 BoogieIcfgContainer [2019-01-14 05:01:20,899 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 05:01:20,899 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 05:01:20,899 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 05:01:20,900 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 05:01:20,900 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:01:16" (3/4) ... [2019-01-14 05:01:20,903 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 05:01:20,903 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 05:01:20,904 INFO L168 Benchmark]: Toolchain (without parser) took 5078.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 952.7 MB in the beginning and 811.1 MB in the end (delta: 141.6 MB). Peak memory consumption was 250.1 MB. Max. memory is 11.5 GB. [2019-01-14 05:01:20,905 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 05:01:20,906 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.17 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 05:01:20,907 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.44 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 05:01:20,908 INFO L168 Benchmark]: Boogie Preprocessor took 117.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -160.1 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 05:01:20,909 INFO L168 Benchmark]: RCFGBuilder took 528.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-01-14 05:01:20,910 INFO L168 Benchmark]: BuchiAutomizer took 4070.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 811.1 MB in the end (delta: 259.6 MB). Peak memory consumption was 259.6 MB. Max. memory is 11.5 GB. [2019-01-14 05:01:20,910 INFO L168 Benchmark]: Witness Printer took 4.24 ms. Allocated memory is still 1.1 GB. Free memory is still 811.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 05:01:20,916 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 303.17 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.44 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 117.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -160.1 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 528.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4070.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 811.1 MB in the end (delta: 259.6 MB). Peak memory consumption was 259.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.24 ms. Allocated memory is still 1.1 GB. Free memory is still 811.1 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 - 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 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * aux-#t~loopctr9-aux + unknown-size-unknown and consists of 3 locations. One deterministic module has affine ranking function -1 * aux-#t~loopctr12-aux + unknown-size-unknown and consists of 2 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. 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 8 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13 SDtfs, 14 SDslu, 1 SDs, 0 SdLazy, 11 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso1 LassoPreprocessingBenchmarks: Lassos: inital62 mio100 ax100 hnf100 lsp98 ukn86 mio100 lsp81 div100 bol100 ite100 ukn100 eq167 hnf86 smp94 dnf136 smp89 tf108 neg97 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 3 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 10 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...