./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2.1-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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 ../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2.1-1.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 6cbc2f8335eda1137ed277d7eb74d7775ef6f777 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:27:58,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:27:58,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:27:58,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:27:58,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:27:58,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:27:58,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:27:58,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:27:58,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:27:58,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:27:58,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:27:58,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:27:58,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:27:58,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:27:58,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:27:58,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:27:58,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:27:58,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:27:58,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:27:58,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:27:58,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:27:58,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:27:58,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:27:58,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:27:58,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:27:58,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:27:58,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:27:58,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:27:58,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:27:58,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:27:58,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:27:58,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:27:58,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:27:58,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:27:58,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:27:58,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:27:58,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:27:58,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:27:58,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:27:58,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:27:58,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:27:58,062 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:27:58,079 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:27:58,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:27:58,080 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:27:58,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:27:58,081 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:27:58,081 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:27:58,082 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:27:58,082 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:27:58,082 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:27:58,082 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:27:58,083 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:27:58,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:27:58,083 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:27:58,084 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:27:58,084 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:27:58,084 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:27:58,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:27:58,085 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:27:58,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:27:58,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:27:58,085 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:27:58,086 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:27:58,086 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:27:58,086 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:27:58,087 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:27:58,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:27:58,087 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:27:58,087 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:27:58,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:27:58,088 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:27:58,088 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:27:58,089 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:27:58,090 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:27:58,090 INFO L138 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 -> 6cbc2f8335eda1137ed277d7eb74d7775ef6f777 [2020-07-29 03:27:58,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:27:58,471 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:27:58,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:27:58,476 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:27:58,477 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:27:58,478 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2.1-1.i [2020-07-29 03:27:58,557 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e73940a4a/32ece316fe0848eca6b82db92f85f7d1/FLAGb5cb2a30a [2020-07-29 03:27:59,033 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:27:59,034 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2.1-1.i [2020-07-29 03:27:59,041 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e73940a4a/32ece316fe0848eca6b82db92f85f7d1/FLAGb5cb2a30a [2020-07-29 03:27:59,428 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e73940a4a/32ece316fe0848eca6b82db92f85f7d1 [2020-07-29 03:27:59,432 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:27:59,435 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:27:59,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:27:59,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:27:59,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:27:59,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:27:59" (1/1) ... [2020-07-29 03:27:59,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@711c9468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:59, skipping insertion in model container [2020-07-29 03:27:59,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:27:59" (1/1) ... [2020-07-29 03:27:59,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:27:59,476 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:27:59,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:27:59,772 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:27:59,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:27:59,842 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:27:59,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:59 WrapperNode [2020-07-29 03:27:59,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:27:59,848 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:27:59,848 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:27:59,848 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:27:59,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:59" (1/1) ... [2020-07-29 03:27:59,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:59" (1/1) ... [2020-07-29 03:27:59,986 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:27:59,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:27:59,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:27:59,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:27:59,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:59" (1/1) ... [2020-07-29 03:27:59,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:59" (1/1) ... [2020-07-29 03:28:00,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:59" (1/1) ... [2020-07-29 03:28:00,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:59" (1/1) ... [2020-07-29 03:28:00,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:59" (1/1) ... [2020-07-29 03:28:00,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:59" (1/1) ... [2020-07-29 03:28:00,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:59" (1/1) ... [2020-07-29 03:28:00,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:28:00,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:28:00,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:28:00,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:28:00,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:59" (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 [2020-07-29 03:28:00,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2020-07-29 03:28:00,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2020-07-29 03:28:00,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-07-29 03:28:00,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2020-07-29 03:28:00,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:28:00,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:28:00,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 03:28:00,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2020-07-29 03:28:00,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:28:00,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:28:00,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:28:00,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:28:00,434 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-29 03:28:00,477 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:28:00,477 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-29 03:28:00,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:28:00 BoogieIcfgContainer [2020-07-29 03:28:00,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:28:00,484 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:28:00,484 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:28:00,488 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:28:00,488 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:28:00,489 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:27:59" (1/3) ... [2020-07-29 03:28:00,490 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41cc3d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:28:00, skipping insertion in model container [2020-07-29 03:28:00,490 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:28:00,490 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:59" (2/3) ... [2020-07-29 03:28:00,491 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41cc3d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:28:00, skipping insertion in model container [2020-07-29 03:28:00,491 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:28:00,491 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:28:00" (3/3) ... [2020-07-29 03:28:00,492 INFO L371 chiAutomizerObserver]: Analyzing ICFG test-bitfields-2.1-1.i [2020-07-29 03:28:00,542 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:28:00,542 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:28:00,542 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:28:00,543 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:28:00,543 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:28:00,543 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:28:00,544 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:28:00,544 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:28:00,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-07-29 03:28:00,584 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 03:28:00,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:28:00,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:28:00,591 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:28:00,591 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 03:28:00,591 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:28:00,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-07-29 03:28:00,595 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 03:28:00,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:28:00,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:28:00,596 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:28:00,596 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 03:28:00,604 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(5);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 4 + ~#d~0.offset, 1); 11#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset, main_#t~mem2, main_#t~mem3, main_#t~mem4, main_#t~mem5, main_~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(3);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~int(1, ~#d~0.base, ~#d~0.offset, 1);call write~int(2, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~int(3, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~int(4, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~int(5, ~#d~0.base, 4 + ~#d~0.offset, 1); 12#L31true call main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset := #Ultimate.C_memcpy(main_~p~0.base, main_~p~0.offset, ~#d~0.base, ~#d~0.offset, 3);< 17##Ultimate.C_memcpyENTRYtrue assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 3#$Ultimate##0true #t~loopctr7 := 0; 9#L-1-1true [2020-07-29 03:28:00,605 INFO L796 eck$LassoCheckResult]: Loop: 9#L-1-1true assume #t~loopctr7 < size;call #t~mem8 := read~unchecked~int(src.base, src.offset + #t~loopctr7, 1);call write~unchecked~int(#t~mem8, dest.base, dest.offset + #t~loopctr7, 1);#t~loopctr7 := 1 + #t~loopctr7; 9#L-1-1true [2020-07-29 03:28:00,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:28:00,614 INFO L82 PathProgramCache]: Analyzing trace with hash 28738897, now seen corresponding path program 1 times [2020-07-29 03:28:00,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:28:00,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656929774] [2020-07-29 03:28:00,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:28:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:28:00,756 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:28:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:28:00,812 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:28:00,847 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:28:00,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:28:00,848 INFO L82 PathProgramCache]: Analyzing trace with hash 72, now seen corresponding path program 1 times [2020-07-29 03:28:00,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:28:00,850 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100457559] [2020-07-29 03:28:00,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:28:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:28:00,863 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:28:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:28:00,867 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:28:00,869 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:28:00,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:28:00,871 INFO L82 PathProgramCache]: Analyzing trace with hash 890905848, now seen corresponding path program 1 times [2020-07-29 03:28:00,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:28:00,871 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478521378] [2020-07-29 03:28:00,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:28:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:28:00,899 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:28:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:28:00,926 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:28:00,933 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:28:01,568 WARN L193 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2020-07-29 03:28:01,786 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-07-29 03:28:02,293 WARN L193 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2020-07-29 03:28:02,545 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-07-29 03:28:02,612 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:28:02,612 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:28:02,613 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:28:02,613 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:28:02,613 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:28:02,613 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:02,613 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:28:02,614 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:28:02,614 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2.1-1.i_Iteration1_Lasso [2020-07-29 03:28:02,614 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:28:02,614 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:28:02,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:03,109 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2020-07-29 03:28:03,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:03,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:03,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:03,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:03,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:03,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:03,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:03,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:03,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:03,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:03,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:03,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:03,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:03,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:03,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:03,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:03,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:03,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:03,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:03,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:04,112 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:28:04,118 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 03:28:04,140 INFO L120 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 [2020-07-29 03:28:04,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:04,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:04,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:04,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:04,157 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:28:04,157 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:04,171 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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 [2020-07-29 03:28:04,198 INFO L120 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 [2020-07-29 03:28:04,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:04,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:04,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:04,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:04,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:28:04,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:28:04,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:04,240 INFO L120 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 [2020-07-29 03:28:04,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:04,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:04,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:04,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:04,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:28:04,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:28:04,254 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:28:04,288 INFO L120 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 [2020-07-29 03:28:04,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:04,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:04,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:04,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:04,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:28:04,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:04,302 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:04,342 INFO L120 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 [2020-07-29 03:28:04,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:04,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:04,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:04,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:04,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:28:04,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:28:04,350 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:04,375 INFO L120 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 [2020-07-29 03:28:04,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:04,377 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 03:28:04,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:04,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:04,385 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-07-29 03:28:04,385 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:28:04,395 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:04,416 INFO L120 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 [2020-07-29 03:28:04,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:04,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:04,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:04,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:04,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:28:04,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:28:04,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:04,467 INFO L120 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 [2020-07-29 03:28:04,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:04,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:04,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:04,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:04,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:28:04,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:28:04,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:28:04,543 INFO L120 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 [2020-07-29 03:28:04,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:04,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:04,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:04,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:04,549 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:28:04,549 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:04,559 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:04,604 INFO L120 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 [2020-07-29 03:28:04,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:04,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:04,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:04,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:04,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:28:04,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:28:04,613 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:04,643 INFO L120 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 [2020-07-29 03:28:04,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:04,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:04,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:04,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:04,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:28:04,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:28:04,660 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:28:04,682 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-07-29 03:28:04,682 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:28:04,712 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:04,718 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:28:04,718 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:28:04,719 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr7, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr7 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2020-07-29 03:28:04,873 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2020-07-29 03:28:04,879 INFO L393 LassoCheck]: Loop: "assume #t~loopctr7 < size;call #t~mem8 := read~unchecked~int(src.base, src.offset + #t~loopctr7, 1);call write~unchecked~int(#t~mem8, dest.base, dest.offset + #t~loopctr7, 1);#t~loopctr7 := 1 + #t~loopctr7;" [2020-07-29 03:28:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:28:04,892 WARN L1295 BoogieBacktranslator]: unknown boogie variable size [2020-07-29 03:28:04,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:28:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:28:04,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:28:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:28:04,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:28:04,963 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(5);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 4 + ~#d~0.offset, 1); {31#unseeded} is VALID [2020-07-29 03:28:04,964 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#unseeded} 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_~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(3);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~int(1, ~#d~0.base, ~#d~0.offset, 1);call write~int(2, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~int(3, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~int(4, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~int(5, ~#d~0.base, 4 + ~#d~0.offset, 1); {31#unseeded} is VALID [2020-07-29 03:28:04,965 INFO L263 TraceCheckUtils]: 2: Hoare triple {31#unseeded} 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, 3); {31#unseeded} is VALID [2020-07-29 03:28:04,966 INFO L280 TraceCheckUtils]: 3: Hoare triple {31#unseeded} 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; {31#unseeded} is VALID [2020-07-29 03:28:04,966 INFO L280 TraceCheckUtils]: 4: Hoare triple {31#unseeded} #t~loopctr7 := 0; {31#unseeded} is VALID [2020-07-29 03:28:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:28:04,972 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:28:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:28:04,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:28:04,976 INFO L280 TraceCheckUtils]: 0: Hoare triple {34#(>= oldRank0 (+ (* (- 1) |#Ultimate.C_memcpy_#t~loopctr7|) |#Ultimate.C_memcpy_size|))} assume #t~loopctr7 < size;call #t~mem8 := read~unchecked~int(src.base, src.offset + #t~loopctr7, 1);call write~unchecked~int(#t~mem8, dest.base, dest.offset + #t~loopctr7, 1);#t~loopctr7 := 1 + #t~loopctr7; {124#(or (and (> oldRank0 (+ (* (- 1) |#Ultimate.C_memcpy_#t~loopctr7|) |#Ultimate.C_memcpy_size|)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:28:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:28:04,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 03:28:04,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:28:04,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 5 letters. Loop has 1 letters. [2020-07-29 03:28:05,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,009 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 [2020-07-29 03:28:05,010 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 2 states. [2020-07-29 03:28:05,099 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 2 states. Result 26 states and 35 transitions. Complement of second has 6 states. [2020-07-29 03:28:05,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:28:05,100 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:28:05,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-07-29 03:28:05,104 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 03:28:05,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:28:05,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:28:05,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 03:28:05,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 03:28:05,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:28:05,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:28:05,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2020-07-29 03:28:05,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 03:28:05,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:28:05,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:28:05,117 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states. [2020-07-29 03:28:05,121 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 03:28:05,122 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:28:05,122 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 03:28:05,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 03:28:05,124 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:28:05,124 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 35 transitions. cyclomatic complexity: 12 [2020-07-29 03:28:05,124 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:28:05,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 5 letters. Loop has 1 letters. [2020-07-29 03:28:05,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 5 letters. Loop has 1 letters. [2020-07-29 03:28:05,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 1 letters. [2020-07-29 03:28:05,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 03:28:05,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 03:28:05,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 1 letters. [2020-07-29 03:28:05,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 03:28:05,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 03:28:05,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 1 letters. [2020-07-29 03:28:05,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:28:05,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:28:05,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:28:05,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:28:05,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:28:05,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:28:05,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:28:05,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:28:05,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:28:05,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 03:28:05,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 03:28:05,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 1 letters. [2020-07-29 03:28:05,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 5 letters. Loop has 1 letters. [2020-07-29 03:28:05,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 5 letters. Loop has 1 letters. [2020-07-29 03:28:05,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 1 letters. [2020-07-29 03:28:05,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 03:28:05,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 03:28:05,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 1 letters. [2020-07-29 03:28:05,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 03:28:05,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 03:28:05,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 1 letters. [2020-07-29 03:28:05,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,140 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:28:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 03:28:05,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2020-07-29 03:28:05,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2020-07-29 03:28:05,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2020-07-29 03:28:05,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:28:05,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 35 transitions. cyclomatic complexity: 12 [2020-07-29 03:28:05,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 03:28:05,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 9 states and 11 transitions. [2020-07-29 03:28:05,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 03:28:05,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 03:28:05,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2020-07-29 03:28:05,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:28:05,157 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-07-29 03:28:05,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2020-07-29 03:28:05,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-07-29 03:28:05,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:28:05,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 11 transitions. Second operand 8 states. [2020-07-29 03:28:05,185 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 11 transitions. Second operand 8 states. [2020-07-29 03:28:05,188 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 8 states. [2020-07-29 03:28:05,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:28:05,193 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-29 03:28:05,194 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2020-07-29 03:28:05,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:28:05,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:28:05,195 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 9 states and 11 transitions. [2020-07-29 03:28:05,196 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 9 states and 11 transitions. [2020-07-29 03:28:05,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:28:05,197 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-29 03:28:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2020-07-29 03:28:05,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:28:05,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:28:05,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:28:05,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:28:05,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 03:28:05,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2020-07-29 03:28:05,201 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 03:28:05,201 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 03:28:05,201 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:28:05,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2020-07-29 03:28:05,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 03:28:05,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:28:05,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:28:05,203 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:28:05,203 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 03:28:05,203 INFO L794 eck$LassoCheckResult]: Stem: 180#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(5);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 4 + ~#d~0.offset, 1); 175#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_~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(3);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~int(1, ~#d~0.base, ~#d~0.offset, 1);call write~int(2, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~int(3, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~int(4, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~int(5, ~#d~0.base, 4 + ~#d~0.offset, 1); 176#L31 call main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset := #Ultimate.C_memcpy(main_~p~0.base, main_~p~0.offset, ~#d~0.base, ~#d~0.offset, 3);< 177##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; 178#$Ultimate##0 #t~loopctr7 := 0; 179#L-1-1 assume !(#t~loopctr7 < size);#t~loopctr9 := 0; 181#L-1-3 [2020-07-29 03:28:05,204 INFO L796 eck$LassoCheckResult]: Loop: 181#L-1-3 assume #t~loopctr9 < size;#t~loopctr9 := 4 + #t~loopctr9; 181#L-1-3 [2020-07-29 03:28:05,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:28:05,204 INFO L82 PathProgramCache]: Analyzing trace with hash 890905850, now seen corresponding path program 1 times [2020-07-29 03:28:05,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:28:05,205 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468399248] [2020-07-29 03:28:05,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:28:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:28:05,288 INFO L280 TraceCheckUtils]: 0: Hoare triple {204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(5);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 4 + ~#d~0.offset, 1); {204#true} is VALID [2020-07-29 03:28:05,289 INFO L280 TraceCheckUtils]: 1: Hoare triple {204#true} 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_~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(3);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~int(1, ~#d~0.base, ~#d~0.offset, 1);call write~int(2, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~int(3, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~int(4, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~int(5, ~#d~0.base, 4 + ~#d~0.offset, 1); {204#true} is VALID [2020-07-29 03:28:05,291 INFO L263 TraceCheckUtils]: 2: Hoare triple {204#true} 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, 3); {206#(= 3 |#Ultimate.C_memcpy_size|)} is VALID [2020-07-29 03:28:05,291 INFO L280 TraceCheckUtils]: 3: Hoare triple {206#(= 3 |#Ultimate.C_memcpy_size|)} 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; {206#(= 3 |#Ultimate.C_memcpy_size|)} is VALID [2020-07-29 03:28:05,292 INFO L280 TraceCheckUtils]: 4: Hoare triple {206#(= 3 |#Ultimate.C_memcpy_size|)} #t~loopctr7 := 0; {207#(and (= 0 |#Ultimate.C_memcpy_#t~loopctr7|) (= 3 |#Ultimate.C_memcpy_size|))} is VALID [2020-07-29 03:28:05,293 INFO L280 TraceCheckUtils]: 5: Hoare triple {207#(and (= 0 |#Ultimate.C_memcpy_#t~loopctr7|) (= 3 |#Ultimate.C_memcpy_size|))} assume !(#t~loopctr7 < size);#t~loopctr9 := 0; {205#false} is VALID [2020-07-29 03:28:05,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:28:05,295 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468399248] [2020-07-29 03:28:05,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:28:05,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:28:05,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907253410] [2020-07-29 03:28:05,305 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:28:05,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:28:05,308 INFO L82 PathProgramCache]: Analyzing trace with hash 78, now seen corresponding path program 1 times [2020-07-29 03:28:05,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:28:05,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91242873] [2020-07-29 03:28:05,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:28:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:28:05,314 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:28:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:28:05,321 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:28:05,323 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:28:05,342 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:28:05,342 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:28:05,342 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:28:05,342 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:28:05,342 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:28:05,343 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:05,343 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:28:05,343 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:28:05,343 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2.1-1.i_Iteration2_Loop [2020-07-29 03:28:05,343 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:28:05,343 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:28:05,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:05,391 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:28:05,392 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:05,401 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:28:05,401 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:05,430 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:28:05,430 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:28:05,525 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:28:05,527 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:28:05,527 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:28:05,527 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:28:05,527 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:28:05,527 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:28:05,527 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:05,527 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:28:05,528 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:28:05,528 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2.1-1.i_Iteration2_Loop [2020-07-29 03:28:05,528 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:28:05,528 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:28:05,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:05,567 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:28:05,568 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:05,571 INFO L120 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 [2020-07-29 03:28:05,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:05,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:28:05,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:05,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:05,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:05,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:28:05,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:28:05,584 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:28:05,595 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 03:28:05,596 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:05,604 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:28:05,604 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:28:05,604 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:28:05,604 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_size, #Ultimate.C_memcpy_#t~loopctr9) = 1*#Ultimate.C_memcpy_size - 1*#Ultimate.C_memcpy_#t~loopctr9 Supporting invariants [] [2020-07-29 03:28:05,644 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:28:05,647 INFO L393 LassoCheck]: Loop: "assume #t~loopctr9 < size;#t~loopctr9 := 4 + #t~loopctr9;" [2020-07-29 03:28:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:28:05,651 WARN L1295 BoogieBacktranslator]: unknown boogie variable size [2020-07-29 03:28:05,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:28:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:28:05,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:28:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:28:05,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:28:05,699 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(5);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 4 + ~#d~0.offset, 1); {210#unseeded} is VALID [2020-07-29 03:28:05,699 INFO L280 TraceCheckUtils]: 1: Hoare triple {210#unseeded} 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_~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(3);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~int(1, ~#d~0.base, ~#d~0.offset, 1);call write~int(2, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~int(3, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~int(4, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~int(5, ~#d~0.base, 4 + ~#d~0.offset, 1); {210#unseeded} is VALID [2020-07-29 03:28:05,701 INFO L263 TraceCheckUtils]: 2: Hoare triple {210#unseeded} 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, 3); {210#unseeded} is VALID [2020-07-29 03:28:05,702 INFO L280 TraceCheckUtils]: 3: Hoare triple {210#unseeded} 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; {210#unseeded} is VALID [2020-07-29 03:28:05,704 INFO L280 TraceCheckUtils]: 4: Hoare triple {210#unseeded} #t~loopctr7 := 0; {210#unseeded} is VALID [2020-07-29 03:28:05,704 INFO L280 TraceCheckUtils]: 5: Hoare triple {210#unseeded} assume !(#t~loopctr7 < size);#t~loopctr9 := 0; {210#unseeded} is VALID [2020-07-29 03:28:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:28:05,708 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:28:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:28:05,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:28:05,713 INFO L280 TraceCheckUtils]: 0: Hoare triple {213#(>= oldRank0 (+ |#Ultimate.C_memcpy_size| (* (- 1) |#Ultimate.C_memcpy_#t~loopctr9|)))} assume #t~loopctr9 < size;#t~loopctr9 := 4 + #t~loopctr9; {223#(or (and (>= oldRank0 0) (> oldRank0 (+ |#Ultimate.C_memcpy_size| (* (- 1) |#Ultimate.C_memcpy_#t~loopctr9|)))) unseeded)} is VALID [2020-07-29 03:28:05,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:28:05,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 03:28:05,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:28:05,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 03:28:05,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,720 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 [2020-07-29 03:28:05,720 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 2 states. [2020-07-29 03:28:05,737 INFO L75 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. [2020-07-29 03:28:05,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2020-07-29 03:28:05,738 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:28:05,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2020-07-29 03:28:05,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:28:05,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:28:05,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 03:28:05,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 03:28:05,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:28:05,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:28:05,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2020-07-29 03:28:05,741 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:28:05,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:28:05,741 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2020-07-29 03:28:05,742 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:28:05,742 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 03:28:05,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 03:28:05,743 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:28:05,744 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 11 transitions. cyclomatic complexity: 4 [2020-07-29 03:28:05,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. cyclomatic complexity: 4 [2020-07-29 03:28:05,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:28:05,744 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:28:05,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 03:28:05,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 03:28:05,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 03:28:05,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 03:28:05,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 03:28:05,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 03:28:05,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 9 letters. [2020-07-29 03:28:05,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 03:28:05,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 9 letters. [2020-07-29 03:28:05,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:28:05,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:28:05,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:28:05,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:28:05,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:28:05,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:28:05,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 03:28:05,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 03:28:05,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 03:28:05,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 03:28:05,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 03:28:05,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 03:28:05,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,754 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:28:05,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 03:28:05,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2020-07-29 03:28:05,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 1 letters. [2020-07-29 03:28:05,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 7 letters. Loop has 1 letters. [2020-07-29 03:28:05,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:28:05,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:05,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. cyclomatic complexity: 4 [2020-07-29 03:28:05,759 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:28:05,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2020-07-29 03:28:05,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:28:05,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:28:05,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:28:05,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:28:05,760 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:28:05,760 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:28:05,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:28:05,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:28:05,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:28:05,764 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2020-07-29 03:28:05,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:28:05,765 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 03:28:05,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:28:05,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:28:05,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:28:05,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 03:28:05,776 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:28:05,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 03:28:05,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:28:05,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:28:05,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:28:05,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:28:05,778 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:28:05,778 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:28:05,778 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:28:05,778 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:28:05,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:28:05,778 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:28:05,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:28:05,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:28:05 BoogieIcfgContainer [2020-07-29 03:28:05,786 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:28:05,786 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:28:05,787 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:28:05,787 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:28:05,787 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:28:00" (3/4) ... [2020-07-29 03:28:05,791 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:28:05,791 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:28:05,793 INFO L168 Benchmark]: Toolchain (without parser) took 6359.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.9 MB). Free memory was 961.6 MB in the beginning and 867.2 MB in the end (delta: 94.4 MB). Peak memory consumption was 307.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:28:05,794 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:28:05,795 INFO L168 Benchmark]: CACSL2BoogieTranslator took 408.77 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:28:05,796 INFO L168 Benchmark]: Boogie Procedure Inliner took 138.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 950.8 MB in the beginning and 1.2 GB in the end (delta: -200.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:28:05,797 INFO L168 Benchmark]: Boogie Preprocessor took 34.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:28:05,798 INFO L168 Benchmark]: RCFGBuilder took 461.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:28:05,799 INFO L168 Benchmark]: BuchiAutomizer took 5301.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.9 MB). Free memory was 1.1 GB in the beginning and 867.2 MB in the end (delta: 252.6 MB). Peak memory consumption was 304.5 MB. Max. memory is 11.5 GB. [2020-07-29 03:28:05,799 INFO L168 Benchmark]: Witness Printer took 4.74 ms. Allocated memory is still 1.2 GB. Free memory is still 867.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:28:05,804 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 408.77 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 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 138.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 950.8 MB in the beginning and 1.2 GB in the end (delta: -200.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 461.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5301.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.9 MB). Free memory was 1.1 GB in the beginning and 867.2 MB in the end (delta: 252.6 MB). Peak memory consumption was 304.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.74 ms. Allocated memory is still 1.2 GB. Free memory is still 867.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable size - GenericResult: Unfinished Backtranslation unknown boogie variable size * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * aux-#t~loopctr7-aux + unknown-size-unknown and consists of 3 locations. One deterministic module has affine ranking function unknown-size-unknown + -1 * aux-#t~loopctr9-aux and consists of 2 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 4.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 8 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13 SDtfs, 16 SDslu, 1 SDs, 0 SdLazy, 11 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso1 LassoPreprocessingBenchmarks: Lassos: inital68 mio100 ax100 hnf100 lsp98 ukn87 mio100 lsp77 div100 bol100 ite100 ukn100 eq175 hnf89 smp100 dnf100 smp100 tf108 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...