./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/ldv-memsafety-bitfields/test-bitfields-2_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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-2_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 3dbc6bab9a799b7f4b90bf959cd96947d3b192e5 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:12:40,496 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:12:40,498 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:12:40,517 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:12:40,517 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:12:40,521 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:12:40,522 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:12:40,525 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:12:40,527 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:12:40,529 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:12:40,530 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:12:40,530 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:12:40,531 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:12:40,535 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:12:40,537 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:12:40,538 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:12:40,546 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:12:40,548 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:12:40,552 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:12:40,555 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:12:40,557 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:12:40,560 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:12:40,564 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:12:40,564 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:12:40,564 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:12:40,565 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:12:40,566 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:12:40,566 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:12:40,567 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:12:40,568 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:12:40,568 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:12:40,569 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:12:40,569 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:12:40,569 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:12:40,570 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:12:40,571 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:12:40,571 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:12:40,587 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:12:40,587 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:12:40,588 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:12:40,588 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:12:40,589 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:12:40,589 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:12:40,589 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:12:40,589 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:12:40,589 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:12:40,589 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:12:40,590 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:12:40,590 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:12:40,590 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:12:40,590 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:12:40,590 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:12:40,591 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:12:40,591 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:12:40,591 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:12:40,591 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:12:40,591 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:12:40,591 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:12:40,592 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:12:40,592 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:12:40,592 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:12:40,592 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:12:40,592 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:12:40,592 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:12:40,593 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:12:40,593 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:12:40,593 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:12:40,593 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:12:40,594 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:12:40,594 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 -> 3dbc6bab9a799b7f4b90bf959cd96947d3b192e5 [2018-11-29 00:12:40,639 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:12:40,654 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:12:40,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:12:40,662 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:12:40,663 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:12:40,663 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety-bitfields/test-bitfields-2_true-valid-memsafety_true-termination.i [2018-11-29 00:12:40,729 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/963744c4d/86af552f7b80435894ab77afde096f3e/FLAG12fdc1960 [2018-11-29 00:12:41,132 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:12:41,132 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety-bitfields/test-bitfields-2_true-valid-memsafety_true-termination.i [2018-11-29 00:12:41,139 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/963744c4d/86af552f7b80435894ab77afde096f3e/FLAG12fdc1960 [2018-11-29 00:12:41,492 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/963744c4d/86af552f7b80435894ab77afde096f3e [2018-11-29 00:12:41,496 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:12:41,497 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:12:41,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:12:41,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:12:41,504 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:12:41,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:12:41" (1/1) ... [2018-11-29 00:12:41,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60a903c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:41, skipping insertion in model container [2018-11-29 00:12:41,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:12:41" (1/1) ... [2018-11-29 00:12:41,516 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:12:41,533 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:12:41,756 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:12:41,780 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:12:41,807 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:12:41,835 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:12:41,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:41 WrapperNode [2018-11-29 00:12:41,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:12:41,836 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:12:41,836 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:12:41,837 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:12:41,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:41" (1/1) ... [2018-11-29 00:12:41,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:41" (1/1) ... [2018-11-29 00:12:41,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:12:41,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:12:41,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:12:41,882 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:12:41,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:41" (1/1) ... [2018-11-29 00:12:41,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:41" (1/1) ... [2018-11-29 00:12:41,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:41" (1/1) ... [2018-11-29 00:12:41,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:41" (1/1) ... [2018-11-29 00:12:41,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:41" (1/1) ... [2018-11-29 00:12:41,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:41" (1/1) ... [2018-11-29 00:12:41,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:41" (1/1) ... [2018-11-29 00:12:41,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:12:41,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:12:41,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:12:41,941 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:12:41,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:41" (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 [2018-11-29 00:12:42,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-29 00:12:42,064 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-29 00:12:42,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-29 00:12:42,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-29 00:12:42,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-29 00:12:42,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:12:42,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2018-11-29 00:12:42,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:12:42,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:12:42,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-29 00:12:42,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:12:42,458 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-29 00:12:42,493 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:12:42,494 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-29 00:12:42,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:12:42 BoogieIcfgContainer [2018-11-29 00:12:42,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:12:42,495 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:12:42,495 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:12:42,499 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:12:42,500 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:12:42,500 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:12:41" (1/3) ... [2018-11-29 00:12:42,501 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ca1bb11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:12:42, skipping insertion in model container [2018-11-29 00:12:42,504 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:12:42,504 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:41" (2/3) ... [2018-11-29 00:12:42,505 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ca1bb11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:12:42, skipping insertion in model container [2018-11-29 00:12:42,505 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:12:42,505 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:12:42" (3/3) ... [2018-11-29 00:12:42,509 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-bitfields-2_true-valid-memsafety_true-termination.i [2018-11-29 00:12:42,570 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:12:42,571 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:12:42,571 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:12:42,571 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:12:42,571 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:12:42,572 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:12:42,572 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:12:42,572 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:12:42,573 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:12:42,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-29 00:12:42,611 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2018-11-29 00:12:42,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:12:42,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:12:42,619 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:12:42,619 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-29 00:12:42,619 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:12:42,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-29 00:12:42,622 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2018-11-29 00:12:42,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:12:42,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:12:42,623 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:12:42,623 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-29 00:12:42,632 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.alloc(5);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 4 + ~#d~0.offset, 1); 11#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_~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.alloc(4);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~int(1, ~#d~0.base, ~#d~0.offset, 1);call write~int(2, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~int(3, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~int(4, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~int(5, ~#d~0.base, 4 + ~#d~0.offset, 1); 12#L31true 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, 4);< 18##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~loopctr8 := 0; 9#L-1-1true [2018-11-29 00:12:42,632 INFO L796 eck$LassoCheckResult]: Loop: 9#L-1-1true assume #t~loopctr8 < size;call #t~mem9 := read~unchecked~int(src.base, src.offset + #t~loopctr8, 1);call write~unchecked~int(#t~mem9, dest.base, dest.offset + #t~loopctr8, 1);#t~loopctr8 := 1 + #t~loopctr8; 9#L-1-1true [2018-11-29 00:12:42,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:42,639 INFO L82 PathProgramCache]: Analyzing trace with hash 28745848, now seen corresponding path program 1 times [2018-11-29 00:12:42,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:42,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:42,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:42,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:42,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:42,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:42,799 INFO L82 PathProgramCache]: Analyzing trace with hash 79, now seen corresponding path program 1 times [2018-11-29 00:12:42,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:42,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:42,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:42,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:42,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:42,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:42,811 INFO L82 PathProgramCache]: Analyzing trace with hash 891121336, now seen corresponding path program 1 times [2018-11-29 00:12:42,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:42,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:42,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:42,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:42,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:43,834 WARN L180 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2018-11-29 00:12:44,322 WARN L180 SmtUtils]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-11-29 00:12:44,732 WARN L180 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-11-29 00:12:44,850 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-11-29 00:12:44,868 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:12:44,869 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:12:44,870 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:12:44,870 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:12:44,870 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:12:44,870 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:12:44,870 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:12:44,871 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:12:44,871 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-29 00:12:44,871 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:12:44,871 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:12:44,896 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-29 00:12:44,905 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-29 00:12:44,908 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-29 00:12:44,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:44,930 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-29 00:12:44,935 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-29 00:12:44,951 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-29 00:12:44,975 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-29 00:12:44,982 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-29 00:12:44,985 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-29 00:12:45,000 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-29 00:12:45,002 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-29 00:12:45,018 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-29 00:12:45,454 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2018-11-29 00:12:45,578 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-29 00:12:45,581 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-29 00:12:45,613 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-29 00:12:45,624 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-29 00:12:45,626 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-29 00:12:45,628 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-29 00:12:45,630 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-29 00:12:45,637 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-29 00:12:45,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:46,078 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:12:46,083 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:12:46,086 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-29 00:12:46,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:46,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:46,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:46,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:46,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:46,093 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-29 00:12:46,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:46,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:46,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:46,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:46,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:46,096 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-29 00:12:46,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:46,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:46,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:46,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:46,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:46,098 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-29 00:12:46,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:46,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:46,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:46,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:46,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:46,101 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-29 00:12:46,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:46,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:46,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:46,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:46,109 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-29 00:12:46,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:46,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:46,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:46,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:46,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:46,112 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-29 00:12:46,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:46,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:46,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:46,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:46,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:46,115 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-29 00:12:46,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:46,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:46,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:46,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:46,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:46,117 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-29 00:12:46,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:46,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:46,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:46,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:46,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:46,120 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-29 00:12:46,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:46,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:46,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:46,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:46,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:46,123 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-29 00:12:46,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:46,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:46,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:46,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:46,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:46,126 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-29 00:12:46,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:46,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:46,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:46,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:46,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:46,128 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-29 00:12:46,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:46,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:46,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:46,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:46,138 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-29 00:12:46,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:46,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:46,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:46,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:46,151 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-29 00:12:46,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:46,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:46,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:46,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:46,164 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-29 00:12:46,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:46,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:46,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:46,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:46,173 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-29 00:12:46,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:46,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:46,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:46,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:46,183 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-29 00:12:46,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,184 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:12:46,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,187 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:12:46,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:46,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:46,214 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-29 00:12:46,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:46,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:46,222 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:46,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:46,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:46,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,227 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:12:46,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,229 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:12:46,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:46,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:46,235 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-29 00:12:46,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:46,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:46,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:46,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:46,244 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-29 00:12:46,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:46,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:46,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:46,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:46,253 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-29 00:12:46,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:46,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,259 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:46,259 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:46,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:46,281 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-29 00:12:46,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:46,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:46,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:46,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:46,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:46,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:46,330 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:12:46,349 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-29 00:12:46,350 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:12:46,353 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:12:46,354 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:12:46,355 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:12:46,356 INFO L520 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-29 00:12:46,611 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-29 00:12:46,617 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2018-11-29 00:12:46,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:46,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:12:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:46,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:12:46,704 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-29 00:12:46,719 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-29 00:12:46,720 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states. Second operand 2 states. [2018-11-29 00:12:46,812 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states.. Second operand 2 states. Result 28 states and 38 transitions. Complement of second has 6 states. [2018-11-29 00:12:46,813 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-29 00:12:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-29 00:12:46,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-29 00:12:46,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2018-11-29 00:12:46,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:46,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2018-11-29 00:12:46,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:46,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-29 00:12:46,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:46,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 38 transitions. [2018-11-29 00:12:46,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-29 00:12:46,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 11 transitions. [2018-11-29 00:12:46,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-29 00:12:46,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-29 00:12:46,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2018-11-29 00:12:46,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:12:46,837 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-29 00:12:46,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2018-11-29 00:12:46,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-11-29 00:12:46,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-29 00:12:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-11-29 00:12:46,863 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-29 00:12:46,863 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-29 00:12:46,863 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:12:46,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2018-11-29 00:12:46,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-29 00:12:46,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:12:46,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:12:46,865 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:12:46,865 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-29 00:12:46,865 INFO L794 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.alloc(5);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 4 + ~#d~0.offset, 1); 157#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_~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.alloc(4);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~int(1, ~#d~0.base, ~#d~0.offset, 1);call write~int(2, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~int(3, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~int(4, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~int(5, ~#d~0.base, 4 + ~#d~0.offset, 1); 158#L31 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, 4);< 159##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; 161#$Ultimate##0 #t~loopctr8 := 0; 162#L-1-1 assume !(#t~loopctr8 < size);#t~loopctr10 := 0; 163#L-1-3 [2018-11-29 00:12:46,865 INFO L796 eck$LassoCheckResult]: Loop: 163#L-1-3 assume #t~loopctr10 < size;#t~loopctr10 := 4 + #t~loopctr10; 163#L-1-3 [2018-11-29 00:12:46,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:46,866 INFO L82 PathProgramCache]: Analyzing trace with hash 891121338, now seen corresponding path program 1 times [2018-11-29 00:12:46,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:46,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:46,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:46,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:46,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:47,001 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-29 00:12:47,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:12:47,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:12:47,005 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:12:47,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:47,006 INFO L82 PathProgramCache]: Analyzing trace with hash 85, now seen corresponding path program 1 times [2018-11-29 00:12:47,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:47,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:47,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:47,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:47,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:47,030 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:12:47,030 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:12:47,030 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:12:47,030 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:12:47,030 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:12:47,031 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:12:47,031 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:12:47,031 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:12:47,031 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-11-29 00:12:47,031 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:12:47,031 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:12:47,035 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-29 00:12:47,141 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:12:47,142 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 [2018-11-29 00:12:47,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:12:47,149 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 [2018-11-29 00:12:47,176 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:12:47,176 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:12:47,304 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:12:47,306 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:12:47,306 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:12:47,306 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:12:47,306 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:12:47,306 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:12:47,306 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:12:47,306 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:12:47,306 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:12:47,307 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-11-29 00:12:47,307 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:12:47,307 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:12:47,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-29 00:12:47,334 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:12:47,335 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:12:47,335 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-29 00:12:47,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:47,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:47,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:47,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:47,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:47,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:47,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:47,340 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:12:47,344 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-29 00:12:47,344 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:12:47,344 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:12:47,344 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:12:47,344 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:12:47,345 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_size, #Ultimate.C_memcpy_#t~loopctr10) = 1*#Ultimate.C_memcpy_size - 1*#Ultimate.C_memcpy_#t~loopctr10 Supporting invariants [] [2018-11-29 00:12:47,345 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:12:47,365 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2018-11-29 00:12:47,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:47,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:12:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:47,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:12:47,697 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-29 00:12:47,697 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-29 00:12:47,697 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 2 states. [2018-11-29 00:12:47,718 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. [2018-11-29 00:12:47,719 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 [2018-11-29 00:12:47,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-29 00:12:47,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2018-11-29 00:12:47,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 1 letters. [2018-11-29 00:12:47,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:47,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 7 letters. Loop has 1 letters. [2018-11-29 00:12:47,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:47,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-29 00:12:47,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:47,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2018-11-29 00:12:47,722 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:12:47,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2018-11-29 00:12:47,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:12:47,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:12:47,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:12:47,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:12:47,723 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:12:47,723 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:12:47,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-29 00:12:47,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-29 00:12:47,727 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2018-11-29 00:12:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:12:47,730 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-29 00:12:47,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-29 00:12:47,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-29 00:12:47,730 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:12:47,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-29 00:12:47,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:12:47,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:12:47,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:12:47,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:12:47,731 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:12:47,731 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:12:47,731 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:12:47,731 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:12:47,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:12:47,732 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:12:47,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:12:47,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:12:47 BoogieIcfgContainer [2018-11-29 00:12:47,738 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:12:47,739 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:12:47,739 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:12:47,739 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:12:47,740 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:12:42" (3/4) ... [2018-11-29 00:12:47,743 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:12:47,743 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:12:47,744 INFO L168 Benchmark]: Toolchain (without parser) took 6248.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.2 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -214.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:12:47,745 INFO L168 Benchmark]: CDTParser took 0.16 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. [2018-11-29 00:12:47,746 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.87 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:47,747 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.25 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:47,748 INFO L168 Benchmark]: Boogie Preprocessor took 58.65 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:12:47,748 INFO L168 Benchmark]: RCFGBuilder took 553.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:47,749 INFO L168 Benchmark]: BuchiAutomizer took 5243.73 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -63.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:47,750 INFO L168 Benchmark]: Witness Printer took 4.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:12:47,755 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.16 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 337.87 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 45.25 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.65 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 553.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5243.73 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -63.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable 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~loopctr8-aux + unknown-size-unknown and consists of 3 locations. One deterministic module has affine ranking function unknown-size-unknown + -1 * aux-#t~loopctr10-aux 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 5.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 4.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. 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: inital67 mio100 ax100 hnf100 lsp98 ukn87 mio100 lsp78 div100 bol100 ite100 ukn100 eq175 hnf86 smp100 dnf100 smp100 tf108 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...