./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/ldv-memsafety-bitfields/test-bitfields-3_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 2187ad12904216f135de1d4e0a00e45b56b4da69 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 05:01:21,917 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 05:01:21,919 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 05:01:21,931 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 05:01:21,932 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 05:01:21,933 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 05:01:21,935 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 05:01:21,937 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 05:01:21,938 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 05:01:21,939 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 05:01:21,941 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 05:01:21,941 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 05:01:21,942 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 05:01:21,943 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 05:01:21,945 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 05:01:21,945 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 05:01:21,947 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 05:01:21,949 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 05:01:21,951 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 05:01:21,953 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 05:01:21,954 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 05:01:21,956 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 05:01:21,958 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 05:01:21,959 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 05:01:21,959 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 05:01:21,960 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 05:01:21,961 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 05:01:21,963 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 05:01:21,964 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 05:01:21,965 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 05:01:21,965 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 05:01:21,966 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 05:01:21,967 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 05:01:21,967 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 05:01:21,968 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 05:01:21,969 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 05:01:21,969 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 05:01:21,997 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 05:01:21,997 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 05:01:21,999 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 05:01:21,999 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 05:01:21,999 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 05:01:22,001 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 05:01:22,001 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 05:01:22,001 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 05:01:22,001 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 05:01:22,002 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 05:01:22,002 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 05:01:22,002 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 05:01:22,002 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 05:01:22,002 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 05:01:22,002 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 05:01:22,003 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 05:01:22,004 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 05:01:22,004 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 05:01:22,004 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 05:01:22,004 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 05:01:22,004 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 05:01:22,005 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 05:01:22,005 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 05:01:22,005 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 05:01:22,005 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 05:01:22,005 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 05:01:22,006 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 05:01:22,006 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 05:01:22,007 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 05:01:22,007 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 05:01:22,007 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 05:01:22,008 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 05:01:22,008 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 -> 2187ad12904216f135de1d4e0a00e45b56b4da69 [2019-01-14 05:01:22,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 05:01:22,074 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 05:01:22,077 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 05:01:22,079 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 05:01:22,079 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 05:01:22,080 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i [2019-01-14 05:01:22,143 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc38ae0f/67fbaa6d85774c2eb03f2671a9007f7f/FLAG4f4194926 [2019-01-14 05:01:22,603 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 05:01:22,603 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i [2019-01-14 05:01:22,611 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc38ae0f/67fbaa6d85774c2eb03f2671a9007f7f/FLAG4f4194926 [2019-01-14 05:01:22,974 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc38ae0f/67fbaa6d85774c2eb03f2671a9007f7f [2019-01-14 05:01:22,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 05:01:22,979 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 05:01:22,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 05:01:22,981 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 05:01:22,985 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 05:01:22,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:01:22" (1/1) ... [2019-01-14 05:01:22,989 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672937de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:22, skipping insertion in model container [2019-01-14 05:01:22,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:01:22" (1/1) ... [2019-01-14 05:01:23,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 05:01:23,020 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 05:01:23,190 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 05:01:23,208 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 05:01:23,230 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 05:01:23,253 INFO L195 MainTranslator]: Completed translation [2019-01-14 05:01:23,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:23 WrapperNode [2019-01-14 05:01:23,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 05:01:23,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 05:01:23,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 05:01:23,255 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 05:01:23,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:23" (1/1) ... [2019-01-14 05:01:23,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:23" (1/1) ... [2019-01-14 05:01:23,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 05:01:23,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 05:01:23,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 05:01:23,307 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 05:01:23,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:23" (1/1) ... [2019-01-14 05:01:23,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:23" (1/1) ... [2019-01-14 05:01:23,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:23" (1/1) ... [2019-01-14 05:01:23,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:23" (1/1) ... [2019-01-14 05:01:23,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:23" (1/1) ... [2019-01-14 05:01:23,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:23" (1/1) ... [2019-01-14 05:01:23,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:23" (1/1) ... [2019-01-14 05:01:23,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 05:01:23,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 05:01:23,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 05:01:23,413 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 05:01:23,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 05:01:23,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-01-14 05:01:23,472 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-01-14 05:01:23,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 05:01:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-01-14 05:01:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 05:01:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 05:01:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-01-14 05:01:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 05:01:23,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 05:01:23,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 05:01:23,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 05:01:23,938 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 05:01:24,002 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 05:01:24,003 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 05:01:24,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:01:24 BoogieIcfgContainer [2019-01-14 05:01:24,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 05:01:24,005 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 05:01:24,005 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 05:01:24,009 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 05:01:24,010 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 05:01:24,010 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 05:01:22" (1/3) ... [2019-01-14 05:01:24,011 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7afdd627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 05:01:24, skipping insertion in model container [2019-01-14 05:01:24,012 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 05:01:24,012 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:01:23" (2/3) ... [2019-01-14 05:01:24,012 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7afdd627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 05:01:24, skipping insertion in model container [2019-01-14 05:01:24,012 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 05:01:24,013 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:01:24" (3/3) ... [2019-01-14 05:01:24,016 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-bitfields-3_true-valid-memsafety_true-termination.i [2019-01-14 05:01:24,072 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 05:01:24,073 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 05:01:24,073 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 05:01:24,074 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 05:01:24,076 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 05:01:24,076 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 05:01:24,076 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 05:01:24,076 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 05:01:24,076 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 05:01:24,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-01-14 05:01:24,116 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-14 05:01:24,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 05:01:24,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 05:01:24,123 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 05:01:24,123 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 05:01:24,123 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 05:01:24,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-01-14 05:01:24,127 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-14 05:01:24,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 05:01:24,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 05:01:24,128 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 05:01:24,128 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 05:01:24,135 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(10);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(3, ~#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);call write~init~int(0, ~#d~0.base, 5 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 6 + ~#d~0.offset, 4); 10#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset, main_#t~mem2, main_#t~mem3, main_#t~mem4, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_~p~0.base, main_~p~0.offset;havoc main_~p~0.base, main_~p~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(10);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 24#L41true call main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset := #Ultimate.C_memcpy(main_~p~0.base, main_~p~0.offset, ~#d~0.base, ~#d~0.offset, 10);< 14##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; 5#$Ultimate##0true #t~loopctr13 := 0; 25#L-1-1true [2019-01-14 05:01:24,135 INFO L796 eck$LassoCheckResult]: Loop: 25#L-1-1true assume #t~loopctr13 < size;call #t~mem14 := read~unchecked~int(src.base, src.offset + #t~loopctr13, 4);call write~unchecked~int(#t~mem14, dest.base, dest.offset + #t~loopctr13, 4);call #t~mem15 := read~unchecked~int(src.base, src.offset + #t~loopctr13, 1);call write~unchecked~int(#t~mem15, dest.base, dest.offset + #t~loopctr13, 1);#t~loopctr13 := 1 + #t~loopctr13; 25#L-1-1true [2019-01-14 05:01:24,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:01:24,141 INFO L82 PathProgramCache]: Analyzing trace with hash 28780603, now seen corresponding path program 1 times [2019-01-14 05:01:24,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:01:24,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:01:24,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:01:24,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 05:01:24,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:01:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:01:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:01:24,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:01:24,293 INFO L82 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 1 times [2019-01-14 05:01:24,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:01:24,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:01:24,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:01:24,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 05:01:24,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:01:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:01:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:01:24,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:01:24,309 INFO L82 PathProgramCache]: Analyzing trace with hash 892198776, now seen corresponding path program 1 times [2019-01-14 05:01:24,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:01:24,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:01:24,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:01:24,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 05:01:24,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:01:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:01:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:01:24,923 WARN L181 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-01-14 05:01:25,190 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-14 05:01:25,813 WARN L181 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2019-01-14 05:01:25,996 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-14 05:01:26,014 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 05:01:26,015 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 05:01:26,016 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 05:01:26,016 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 05:01:26,016 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 05:01:26,016 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 05:01:26,016 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 05:01:26,016 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 05:01:26,017 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-3_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2019-01-14 05:01:26,018 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 05:01:26,018 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 05:01:26,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:26,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:27,022 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-01-14 05:01:27,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:27,825 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 05:01:27,831 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 05:01:27,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:27,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:27,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:27,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:27,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:27,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:27,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:27,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:27,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:27,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:27,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:27,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:27,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:27,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:27,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:27,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:27,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:27,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:27,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:27,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:27,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:27,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:01:27,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:01:27,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:27,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:27,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:27,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:27,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:27,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:27,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:27,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:27,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:27,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:27,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:27,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:27,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:27,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:27,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:27,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:27,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:27,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:27,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:27,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:27,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:27,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:27,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:27,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:27,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:27,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:27,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:27,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:27,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:27,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:27,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:27,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:27,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:27,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:27,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:27,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:27,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:27,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:27,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:27,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:27,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:27,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:27,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:27,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:27,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:27,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:27,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:27,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:01:27,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:01:27,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:27,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:27,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:27,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:27,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:27,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:27,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:27,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:27,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:27,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:27,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:27,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:27,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:27,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:27,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:27,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:27,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:27,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:27,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:27,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:27,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:27,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:27,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:27,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:27,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:27,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:27,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:27,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:27,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:27,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:27,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:27,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:27,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:27,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:27,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:27,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:27,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:27,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:27,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:27,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:27,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:27,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:27,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:27,986 INFO L205 nArgumentSynthesizer]: 3 stem disjuncts [2019-01-14 05:01:27,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:27,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:27,991 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 05:01:27,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:01:28,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:28,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:28,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:28,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:28,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:28,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:28,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:01:28,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:01:28,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:28,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:28,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:28,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:28,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:28,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:28,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:01:28,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:01:28,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:28,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:28,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:28,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:28,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:28,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:28,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:01:28,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:01:28,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:28,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:28,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:28,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:28,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:28,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:28,074 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:01:28,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:01:28,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:28,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:28,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:28,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:28,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:28,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:28,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:01:28,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:01:28,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:28,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:28,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:28,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:28,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:28,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:28,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:01:28,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:01:28,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:01:28,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:28,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:28,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:28,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:28,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:28,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:01:28,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:01:28,127 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 05:01:28,149 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 05:01:28,149 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 05:01:28,151 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 05:01:28,154 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 05:01:28,154 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 05:01:28,158 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr13, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr13 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2019-01-14 05:01:28,542 INFO L297 tatePredicateManager]: 27 out of 27 supporting invariants were superfluous and have been removed [2019-01-14 05:01:28,550 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2019-01-14 05:01:28,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:01:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 05:01:28,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 05:01:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 05:01:28,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 05:01:28,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 05:01:28,637 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 05:01:28,638 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 2 states. [2019-01-14 05:01:28,716 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 2 states. Result 38 states and 53 transitions. Complement of second has 6 states. [2019-01-14 05:01:28,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 05:01:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 05:01:28,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-14 05:01:28,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-14 05:01:28,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 05:01:28,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-14 05:01:28,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 05:01:28,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 05:01:28,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 05:01:28,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2019-01-14 05:01:28,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 05:01:28,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 9 states and 11 transitions. [2019-01-14 05:01:28,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 05:01:28,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 05:01:28,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-01-14 05:01:28,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 05:01:28,735 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-14 05:01:28,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-01-14 05:01:28,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-14 05:01:28,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 05:01:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-01-14 05:01:28,758 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-14 05:01:28,758 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-14 05:01:28,758 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 05:01:28,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-01-14 05:01:28,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 05:01:28,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 05:01:28,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 05:01:28,759 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 05:01:28,759 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 05:01:28,760 INFO L794 eck$LassoCheckResult]: Stem: 225#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(10);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(3, ~#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);call write~init~int(0, ~#d~0.base, 5 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 6 + ~#d~0.offset, 4); 221#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset, main_#t~mem2, main_#t~mem3, main_#t~mem4, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_~p~0.base, main_~p~0.offset;havoc main_~p~0.base, main_~p~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(10);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 222#L41 call main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset := #Ultimate.C_memcpy(main_~p~0.base, main_~p~0.offset, ~#d~0.base, ~#d~0.offset, 10);< 227##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; 223#$Ultimate##0 #t~loopctr13 := 0; 224#L-1-1 assume !(#t~loopctr13 < size);#t~loopctr16 := 0; 226#L-1-3 [2019-01-14 05:01:28,760 INFO L796 eck$LassoCheckResult]: Loop: 226#L-1-3 assume #t~loopctr16 < size;#t~loopctr16 := 4 + #t~loopctr16; 226#L-1-3 [2019-01-14 05:01:28,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:01:28,760 INFO L82 PathProgramCache]: Analyzing trace with hash 892198778, now seen corresponding path program 1 times [2019-01-14 05:01:28,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:01:28,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:01:28,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:01:28,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 05:01:28,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:01:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 05:01:28,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 05:01:28,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 05:01:28,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 05:01:28,958 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 05:01:28,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:01:28,959 INFO L82 PathProgramCache]: Analyzing trace with hash 120, now seen corresponding path program 1 times [2019-01-14 05:01:28,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:01:28,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:01:28,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:01:28,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 05:01:28,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:01:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:01:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:01:29,099 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 05:01:29,099 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 05:01:29,100 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 05:01:29,100 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 05:01:29,100 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 05:01:29,100 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 05:01:29,100 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 05:01:29,100 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 05:01:29,100 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-3_true-valid-memsafety_true-termination.i_Iteration2_Loop [2019-01-14 05:01:29,100 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 05:01:29,101 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 05:01:29,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-14 05:01:29,215 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 05:01:29,216 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 05:01:29,222 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 05:01:29,222 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 05:01:29,250 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 05:01:29,250 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 05:01:29,383 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 05:01:29,385 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 05:01:29,385 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 05:01:29,386 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 05:01:29,386 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 05:01:29,386 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 05:01:29,386 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 05:01:29,386 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 05:01:29,386 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 05:01:29,386 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-3_true-valid-memsafety_true-termination.i_Iteration2_Loop [2019-01-14 05:01:29,386 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 05:01:29,386 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 05:01:29,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:01:29,495 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 05:01:29,496 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 05:01:29,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 05:01:29,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:01:29,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:01:29,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:01:29,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:01:29,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:01:29,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:01:29,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:01:29,509 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 05:01:29,513 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 05:01:29,516 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 05:01:29,516 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 05:01:29,517 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 05:01:29,517 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 05:01:29,517 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr16, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr16 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2019-01-14 05:01:29,517 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 05:01:29,532 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2019-01-14 05:01:29,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:01:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 05:01:29,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 05:01:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 05:01:29,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 05:01:29,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 05:01:29,597 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 05:01:29,597 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 05:01:29,605 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 9 states and 11 transitions. Complement of second has 3 states. [2019-01-14 05:01:29,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2019-01-14 05:01:29,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 05:01:29,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2019-01-14 05:01:29,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-14 05:01:29,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 05:01:29,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 7 letters. Loop has 1 letters. [2019-01-14 05:01:29,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 05:01:29,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 05:01:29,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 05:01:29,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-01-14 05:01:29,610 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 05:01:29,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-01-14 05:01:29,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 05:01:29,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 05:01:29,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 05:01:29,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 05:01:29,612 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 05:01:29,612 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 05:01:29,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 05:01:29,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 05:01:29,619 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2019-01-14 05:01:29,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 05:01:29,621 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 05:01:29,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 05:01:29,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 05:01:29,621 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 05:01:29,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 05:01:29,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 05:01:29,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 05:01:29,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 05:01:29,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 05:01:29,622 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 05:01:29,622 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 05:01:29,622 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 05:01:29,622 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 05:01:29,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 05:01:29,622 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 05:01:29,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 05:01:29,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 05:01:29 BoogieIcfgContainer [2019-01-14 05:01:29,628 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 05:01:29,629 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 05:01:29,629 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 05:01:29,629 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 05:01:29,630 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:01:24" (3/4) ... [2019-01-14 05:01:29,632 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 05:01:29,633 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 05:01:29,633 INFO L168 Benchmark]: Toolchain (without parser) took 6655.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -150.4 MB). Peak memory consumption was 49.9 MB. Max. memory is 11.5 GB. [2019-01-14 05:01:29,635 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 05:01:29,635 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.70 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 05:01:29,636 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.41 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 05:01:29,637 INFO L168 Benchmark]: Boogie Preprocessor took 105.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -188.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-14 05:01:29,638 INFO L168 Benchmark]: RCFGBuilder took 591.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-01-14 05:01:29,639 INFO L168 Benchmark]: BuchiAutomizer took 5623.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -3.6 MB). Peak memory consumption was 62.9 MB. Max. memory is 11.5 GB. [2019-01-14 05:01:29,640 INFO L168 Benchmark]: Witness Printer took 3.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 05:01:29,646 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.15 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 273.70 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 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 51.41 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 105.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -188.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 591.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5623.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -3.6 MB). Peak memory consumption was 62.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * 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~loopctr13-aux + unknown-size-unknown and consists of 3 locations. One deterministic module has affine ranking function -1 * aux-#t~loopctr16-aux + unknown-size-unknown and consists of 2 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 5.1s. 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: inital76 mio100 ax100 hnf100 lsp99 ukn88 mio100 lsp75 div100 bol100 ite100 ukn100 eq175 hnf89 smp100 dnf118 smp89 tf108 neg97 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 43ms 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...