./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 2e94e6aa 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-2e94e6a [2019-01-02 00:23:23,183 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:23:23,185 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:23:23,197 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:23:23,197 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:23:23,198 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:23:23,200 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:23:23,201 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:23:23,203 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:23:23,204 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:23:23,207 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:23:23,208 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:23:23,208 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:23:23,209 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:23:23,211 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:23:23,212 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:23:23,217 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:23:23,221 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:23:23,229 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:23:23,231 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:23:23,232 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:23:23,234 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:23:23,239 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:23:23,239 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:23:23,239 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:23:23,242 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:23:23,243 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:23:23,244 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:23:23,245 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:23:23,246 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:23:23,246 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:23:23,247 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:23:23,247 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:23:23,247 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:23:23,248 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:23:23,249 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:23:23,249 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:23:23,265 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:23:23,265 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:23:23,267 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:23:23,267 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:23:23,267 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:23:23,267 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:23:23,268 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:23:23,268 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:23:23,268 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:23:23,268 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:23:23,268 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:23:23,268 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:23:23,269 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:23:23,269 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:23:23,269 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:23:23,269 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:23:23,269 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:23:23,270 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:23:23,270 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:23:23,270 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:23:23,270 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:23:23,270 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:23:23,270 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:23:23,271 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:23:23,271 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:23:23,271 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:23:23,271 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:23:23,271 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:23:23,272 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:23:23,272 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:23:23,272 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:23:23,273 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:23:23,273 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 [2019-01-02 00:23:23,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:23:23,328 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:23:23,335 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:23:23,337 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:23:23,337 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:23:23,338 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 [2019-01-02 00:23:23,408 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a2a92a5/a57663d5e1544852a4f7679602bf0aed/FLAG25fe546c6 [2019-01-02 00:23:23,848 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:23:23,848 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety-bitfields/test-bitfields-2_true-valid-memsafety_true-termination.i [2019-01-02 00:23:23,856 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a2a92a5/a57663d5e1544852a4f7679602bf0aed/FLAG25fe546c6 [2019-01-02 00:23:24,235 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a2a92a5/a57663d5e1544852a4f7679602bf0aed [2019-01-02 00:23:24,238 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:23:24,240 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:23:24,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:23:24,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:23:24,245 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:23:24,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:23:24" (1/1) ... [2019-01-02 00:23:24,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16566cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:24, skipping insertion in model container [2019-01-02 00:23:24,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:23:24" (1/1) ... [2019-01-02 00:23:24,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:23:24,281 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:23:24,504 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:23:24,535 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:23:24,561 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:23:24,583 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:23:24,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:24 WrapperNode [2019-01-02 00:23:24,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:23:24,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:23:24,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:23:24,585 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:23:24,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:24" (1/1) ... [2019-01-02 00:23:24,608 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:24" (1/1) ... [2019-01-02 00:23:24,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:23:24,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:23:24,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:23:24,634 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:23:24,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:24" (1/1) ... [2019-01-02 00:23:24,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:24" (1/1) ... [2019-01-02 00:23:24,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:24" (1/1) ... [2019-01-02 00:23:24,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:24" (1/1) ... [2019-01-02 00:23:24,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:24" (1/1) ... [2019-01-02 00:23:24,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:24" (1/1) ... [2019-01-02 00:23:24,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:24" (1/1) ... [2019-01-02 00:23:24,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:23:24,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:23:24,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:23:24,670 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:23:24,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:24" (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-02 00:23:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-01-02 00:23:24,815 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-01-02 00:23:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-02 00:23:24,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-01-02 00:23:24,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:23:24,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:23:24,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-02 00:23:24,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-01-02 00:23:24,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:23:24,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:23:24,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:23:24,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:23:25,291 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-02 00:23:25,354 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:23:25,354 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-02 00:23:25,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:23:25 BoogieIcfgContainer [2019-01-02 00:23:25,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:23:25,355 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:23:25,356 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:23:25,360 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:23:25,361 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:23:25,362 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:23:24" (1/3) ... [2019-01-02 00:23:25,363 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c4575da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:23:25, skipping insertion in model container [2019-01-02 00:23:25,363 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:23:25,363 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:24" (2/3) ... [2019-01-02 00:23:25,365 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c4575da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:23:25, skipping insertion in model container [2019-01-02 00:23:25,365 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:23:25,365 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:23:25" (3/3) ... [2019-01-02 00:23:25,368 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-bitfields-2_true-valid-memsafety_true-termination.i [2019-01-02 00:23:25,437 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:23:25,438 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:23:25,438 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:23:25,439 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:23:25,439 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:23:25,439 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:23:25,439 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:23:25,440 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:23:25,440 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:23:25,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2019-01-02 00:23:25,482 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-02 00:23:25,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:23:25,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:23:25,489 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:23:25,489 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-02 00:23:25,489 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:23:25,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2019-01-02 00:23:25,492 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-02 00:23:25,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:23:25,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:23:25,493 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:23:25,493 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-02 00:23:25,501 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.allocOnStack(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.allocOnHeap(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 [2019-01-02 00:23:25,502 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 [2019-01-02 00:23:25,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:23:25,509 INFO L82 PathProgramCache]: Analyzing trace with hash 28745848, now seen corresponding path program 1 times [2019-01-02 00:23:25,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:23:25,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:23:25,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:25,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:23:25,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:25,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:23:25,702 INFO L82 PathProgramCache]: Analyzing trace with hash 79, now seen corresponding path program 1 times [2019-01-02 00:23:25,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:23:25,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:23:25,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:25,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:23:25,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:25,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:23:25,717 INFO L82 PathProgramCache]: Analyzing trace with hash 891121336, now seen corresponding path program 1 times [2019-01-02 00:23:25,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:23:25,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:23:25,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:25,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:23:25,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:26,927 WARN L181 SmtUtils]: Spent 898.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-01-02 00:23:27,336 WARN L181 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-02 00:23:27,775 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-01-02 00:23:27,970 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-01-02 00:23:27,983 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:23:27,984 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:23:27,984 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:23:27,984 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:23:27,985 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:23:27,985 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:23:27,985 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:23:27,985 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:23:27,985 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2019-01-02 00:23:27,985 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:23:27,986 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:23:28,014 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-02 00:23:28,027 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-02 00:23:28,029 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-02 00:23:28,036 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-02 00:23:28,041 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-02 00:23:28,054 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-02 00:23:28,063 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-02 00:23:28,067 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-02 00:23:28,069 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-02 00:23:28,089 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-02 00:23:28,095 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-02 00:23:28,104 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-02 00:23:28,105 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-02 00:23:28,112 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-02 00:23:28,116 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-02 00:23:28,118 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-02 00:23:28,121 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-02 00:23:28,124 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-02 00:23:28,130 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-02 00:23:28,662 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-01-02 00:23:28,786 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-02 00:23:28,789 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-02 00:23:28,791 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-02 00:23:29,378 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:23:29,384 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:23:29,386 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-02 00:23:29,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:29,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:29,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:29,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:29,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:29,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:29,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:29,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,399 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-02 00:23:29,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:29,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:29,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:29,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,402 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-02 00:23:29,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:29,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:29,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:29,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,405 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-02 00:23:29,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:29,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:29,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,413 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-02 00:23:29,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:29,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:29,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:29,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:29,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:29,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:29,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:29,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:29,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:29,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:29,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:29,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,423 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-02 00:23:29,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:29,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,425 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:29,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:29,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,426 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-02 00:23:29,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:29,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:29,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:29,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,430 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-02 00:23:29,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:29,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:29,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:29,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,433 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-02 00:23:29,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:29,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:29,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:29,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,439 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-02 00:23:29,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,443 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:29,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:29,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,451 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-02 00:23:29,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:29,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:29,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:29,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,464 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-02 00:23:29,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:29,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:29,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:29,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,470 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-02 00:23:29,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:29,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:29,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:29,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,478 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-02 00:23:29,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:29,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:29,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:29,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,488 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-02 00:23:29,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:29,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:29,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,503 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-02 00:23:29,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:29,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:29,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,519 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-02 00:23:29,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:29,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:29,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,530 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-02 00:23:29,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:29,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:29,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,541 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-02 00:23:29,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:29,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:29,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,561 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-02 00:23:29,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,564 INFO L205 nArgumentSynthesizer]: 3 stem disjuncts [2019-01-02 00:23:29,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,568 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-02 00:23:29,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:29,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,612 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-02 00:23:29,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:29,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:29,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,620 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-02 00:23:29,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:29,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:29,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,628 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-02 00:23:29,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,635 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:29,640 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:29,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,647 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-02 00:23:29,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,653 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:29,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:29,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:29,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:29,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:29,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:29,716 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:23:29,745 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-02 00:23:29,745 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-02 00:23:29,747 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:23:29,749 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:23:29,750 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:23:29,751 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 [] [2019-01-02 00:23:30,004 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-01-02 00:23:30,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2019-01-02 00:23:30,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:23:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:23:30,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:23:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:23:30,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:23:30,139 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-02 00:23:30,156 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-02 00:23:30,157 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states. Second operand 2 states. [2019-01-02 00:23:30,233 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. [2019-01-02 00:23:30,234 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-02 00:23:30,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-02 00:23:30,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-02 00:23:30,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-02 00:23:30,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:23:30,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-02 00:23:30,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:23:30,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-02 00:23:30,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:23:30,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 38 transitions. [2019-01-02 00:23:30,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-02 00:23:30,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 11 transitions. [2019-01-02 00:23:30,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-02 00:23:30,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-02 00:23:30,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-01-02 00:23:30,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:23:30,252 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-02 00:23:30,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-01-02 00:23:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-02 00:23:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-02 00:23:30,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-01-02 00:23:30,281 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-02 00:23:30,281 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-02 00:23:30,282 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:23:30,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-01-02 00:23:30,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-02 00:23:30,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:23:30,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:23:30,283 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:23:30,283 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-02 00:23:30,283 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.allocOnStack(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.allocOnHeap(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 [2019-01-02 00:23:30,284 INFO L796 eck$LassoCheckResult]: Loop: 163#L-1-3 assume #t~loopctr10 < size;#t~loopctr10 := 4 + #t~loopctr10; 163#L-1-3 [2019-01-02 00:23:30,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:23:30,284 INFO L82 PathProgramCache]: Analyzing trace with hash 891121338, now seen corresponding path program 1 times [2019-01-02 00:23:30,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:23:30,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:23:30,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:30,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:23:30,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:23:30,496 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-02 00:23:30,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:23:30,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:23:30,502 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:23:30,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:23:30,505 INFO L82 PathProgramCache]: Analyzing trace with hash 85, now seen corresponding path program 1 times [2019-01-02 00:23:30,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:23:30,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:23:30,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:30,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:23:30,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:30,659 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:23:30,659 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:23:30,659 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:23:30,659 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:23:30,659 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:23:30,659 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:23:30,659 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:23:30,659 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:23:30,660 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2_true-valid-memsafety_true-termination.i_Iteration2_Loop [2019-01-02 00:23:30,660 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:23:30,660 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:23:30,661 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-02 00:23:30,868 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:23:30,870 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-02 00:23:30,875 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:23:30,876 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-02 00:23:30,940 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:23:30,940 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:23:31,051 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:23:31,053 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:23:31,053 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:23:31,053 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:23:31,053 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:23:31,053 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:23:31,054 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:23:31,054 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:23:31,054 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:23:31,054 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2_true-valid-memsafety_true-termination.i_Iteration2_Loop [2019-01-02 00:23:31,054 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:23:31,054 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:23:31,055 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-02 00:23:31,077 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:23:31,078 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:23:31,078 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-02 00:23:31,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:31,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:31,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:31,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:31,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:31,081 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:31,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:31,083 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:23:31,085 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:23:31,085 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:23:31,085 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:23:31,086 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:23:31,086 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:23:31,086 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 [] [2019-01-02 00:23:31,086 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:23:31,102 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2019-01-02 00:23:31,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:23:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:23:31,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:23:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:23:31,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:23:31,165 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-02 00:23:31,166 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-02 00:23:31,166 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-02 00:23:31,194 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-02 00:23:31,194 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-02 00:23:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-02 00:23:31,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2019-01-02 00:23:31,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-02 00:23:31,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:23:31,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 7 letters. Loop has 1 letters. [2019-01-02 00:23:31,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:23:31,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-02 00:23:31,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:23:31,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-01-02 00:23:31,197 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:23:31,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-01-02 00:23:31,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:23:31,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:23:31,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:23:31,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:23:31,198 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:23:31,198 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:23:31,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:23:31,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:23:31,203 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2019-01-02 00:23:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:23:31,206 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-02 00:23:31,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-02 00:23:31,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-02 00:23:31,206 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:23:31,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-02 00:23:31,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:23:31,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:23:31,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:23:31,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:23:31,207 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:23:31,207 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:23:31,207 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:23:31,207 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:23:31,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:23:31,207 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:23:31,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:23:31,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:23:31 BoogieIcfgContainer [2019-01-02 00:23:31,214 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:23:31,215 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:23:31,215 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:23:31,215 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:23:31,216 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:23:25" (3/4) ... [2019-01-02 00:23:31,219 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:23:31,219 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:23:31,220 INFO L168 Benchmark]: Toolchain (without parser) took 6981.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.3 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:23:31,221 INFO L168 Benchmark]: CDTParser took 0.17 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-02 00:23:31,222 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.88 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 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. [2019-01-02 00:23:31,223 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.10 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-02 00:23:31,224 INFO L168 Benchmark]: Boogie Preprocessor took 36.51 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:23:31,224 INFO L168 Benchmark]: RCFGBuilder took 684.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-02 00:23:31,225 INFO L168 Benchmark]: BuchiAutomizer took 5859.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.5 MB). Peak memory consumption was 34.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:23:31,226 INFO L168 Benchmark]: Witness Printer took 4.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2019-01-02 00:23:31,232 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.17 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 343.88 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 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 48.10 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.51 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 684.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5859.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.5 MB). Peak memory consumption was 34.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. 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.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 5.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. 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: inital69 mio100 ax100 hnf100 lsp98 ukn87 mio100 lsp77 div100 bol100 ite100 ukn100 eq175 hnf86 smp100 dnf122 smp89 tf108 neg97 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 50ms 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...