./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_87cb553e-cfc9-4b01-952a-90573b5188cf/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_87cb553e-cfc9-4b01-952a-90573b5188cf/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_87cb553e-cfc9-4b01-952a-90573b5188cf/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_87cb553e-cfc9-4b01-952a-90573b5188cf/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i -s /tmp/vcloud-vcloud-master/worker/working_dir_87cb553e-cfc9-4b01-952a-90573b5188cf/bin/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_87cb553e-cfc9-4b01-952a-90573b5188cf/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash daceda4fb3bf12a25eb56ddc650ae304c7e70427 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:24:12,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:12,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:12,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:12,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:12,731 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:12,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:12,734 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:12,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:12,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:12,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:12,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:12,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:12,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:12,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:12,749 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:12,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:12,750 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:12,753 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:12,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:12,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:12,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:12,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:12,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:12,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:12,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:12,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:12,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:12,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:12,762 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:12,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:12,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:12,764 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:12,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:12,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:12,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:12,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:12,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:12,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:12,767 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:12,768 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:12,768 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_87cb553e-cfc9-4b01-952a-90573b5188cf/bin/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf [2019-10-22 11:24:12,780 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:12,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:12,780 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:12,781 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:12,781 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:12,781 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:12,781 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:24:12,781 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:12,781 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:12,782 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:24:12,782 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:24:12,782 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:12,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:12,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:24:12,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:12,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:24:12,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:12,783 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:24:12,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:24:12,784 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:24:12,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:12,784 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:12,784 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:12,785 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:12,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:12,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:12,785 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:12,785 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:24:12,785 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:24:12,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:24:12,786 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:24:12,786 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:12,786 INFO L138 SettingsManager]: * To the following directory=dump/ [2019-10-22 11:24:12,786 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_87cb553e-cfc9-4b01-952a-90573b5188cf/bin/utaipan 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(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> daceda4fb3bf12a25eb56ddc650ae304c7e70427 [2019-10-22 11:24:12,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:12,839 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:12,842 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:12,843 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:12,844 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:12,844 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_87cb553e-cfc9-4b01-952a-90573b5188cf/bin/utaipan/../../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2019-10-22 11:24:12,895 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_87cb553e-cfc9-4b01-952a-90573b5188cf/bin/utaipan/data/a3b582439/2207305423514619ac1b33647646193a/FLAGccb659e77 [2019-10-22 11:24:13,477 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:13,478 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_87cb553e-cfc9-4b01-952a-90573b5188cf/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2019-10-22 11:24:13,511 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_87cb553e-cfc9-4b01-952a-90573b5188cf/bin/utaipan/data/a3b582439/2207305423514619ac1b33647646193a/FLAGccb659e77 [2019-10-22 11:24:13,679 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_87cb553e-cfc9-4b01-952a-90573b5188cf/bin/utaipan/data/a3b582439/2207305423514619ac1b33647646193a [2019-10-22 11:24:13,681 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:13,682 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:13,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:13,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:13,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:13,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:13" (1/1) ... [2019-10-22 11:24:13,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@642b8712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:13, skipping insertion in model container [2019-10-22 11:24:13,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:13" (1/1) ... [2019-10-22 11:24:13,697 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:13,769 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:14,154 WARN L1068 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1753] [2019-10-22 11:24:14,154 WARN L1068 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1754-1755] [2019-10-22 11:24:14,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:14,517 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:14,591 WARN L1068 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1753] [2019-10-22 11:24:14,592 WARN L1068 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1754-1755] [2019-10-22 11:24:14,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:14,725 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:14,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:14 WrapperNode [2019-10-22 11:24:14,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:14,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:14,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:14,727 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:14,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:14" (1/1) ... [2019-10-22 11:24:14,759 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:14" (1/1) ... [2019-10-22 11:24:14,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:14,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:14,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:14,855 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:14,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:14" (1/1) ... [2019-10-22 11:24:14,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:14" (1/1) ... [2019-10-22 11:24:14,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:14" (1/1) ... [2019-10-22 11:24:14,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:14" (1/1) ... [2019-10-22 11:24:14,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:14" (1/1) ... [2019-10-22 11:24:14,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:14" (1/1) ... [2019-10-22 11:24:14,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:14" (1/1) ... [2019-10-22 11:24:14,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:14,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:14,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:14,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:14,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_87cb553e-cfc9-4b01-952a-90573b5188cf/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:24:15,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:24:15,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:24:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:24:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:24:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:24:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:24:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 11:24:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:24:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:15,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:24:17,387 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:24:17,387 INFO L284 CfgBuilder]: Removed 344 assume(true) statements. [2019-10-22 11:24:17,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:17 BoogieIcfgContainer [2019-10-22 11:24:17,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:24:17,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:24:17,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:24:17,393 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:24:17,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:13" (1/3) ... [2019-10-22 11:24:17,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf73ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:17, skipping insertion in model container [2019-10-22 11:24:17,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:14" (2/3) ... [2019-10-22 11:24:17,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf73ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:17, skipping insertion in model container [2019-10-22 11:24:17,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:17" (3/3) ... [2019-10-22 11:24:17,398 INFO L109 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2019-10-22 11:24:17,414 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:24:17,427 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-22 11:24:17,438 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-22 11:24:17,473 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:24:17,473 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:24:17,473 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:24:17,474 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:24:17,474 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:24:17,474 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:24:17,474 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:24:17,474 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:24:17,502 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states. [2019-10-22 11:24:17,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:24:17,516 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:17,517 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:17,519 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:17,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:17,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1585262438, now seen corresponding path program 1 times [2019-10-22 11:24:17,537 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:17,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323029784] [2019-10-22 11:24:17,537 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:17,538 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:17,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:17,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323029784] [2019-10-22 11:24:17,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:17,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:17,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611273907] [2019-10-22 11:24:17,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:17,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:18,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:18,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:18,005 INFO L87 Difference]: Start difference. First operand 339 states. Second operand 3 states. [2019-10-22 11:24:18,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:18,294 INFO L93 Difference]: Finished difference Result 800 states and 1168 transitions. [2019-10-22 11:24:18,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:18,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-22 11:24:18,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:18,312 INFO L225 Difference]: With dead ends: 800 [2019-10-22 11:24:18,312 INFO L226 Difference]: Without dead ends: 436 [2019-10-22 11:24:18,317 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:18,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-10-22 11:24:18,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2019-10-22 11:24:18,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-10-22 11:24:18,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 626 transitions. [2019-10-22 11:24:18,408 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 626 transitions. Word has length 22 [2019-10-22 11:24:18,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:18,408 INFO L462 AbstractCegarLoop]: Abstraction has 436 states and 626 transitions. [2019-10-22 11:24:18,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:18,409 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 626 transitions. [2019-10-22 11:24:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 11:24:18,410 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:18,410 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:18,411 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:18,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:18,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1758242877, now seen corresponding path program 1 times [2019-10-22 11:24:18,416 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:18,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293760197] [2019-10-22 11:24:18,417 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:18,417 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:18,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:18,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:18,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293760197] [2019-10-22 11:24:18,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:18,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:18,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022561998] [2019-10-22 11:24:18,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:18,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:18,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:18,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:18,578 INFO L87 Difference]: Start difference. First operand 436 states and 626 transitions. Second operand 3 states. [2019-10-22 11:24:18,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:18,615 INFO L93 Difference]: Finished difference Result 857 states and 1231 transitions. [2019-10-22 11:24:18,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:18,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-22 11:24:18,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:18,622 INFO L225 Difference]: With dead ends: 857 [2019-10-22 11:24:18,622 INFO L226 Difference]: Without dead ends: 436 [2019-10-22 11:24:18,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-10-22 11:24:18,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2019-10-22 11:24:18,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-10-22 11:24:18,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 625 transitions. [2019-10-22 11:24:18,668 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 625 transitions. Word has length 27 [2019-10-22 11:24:18,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:18,669 INFO L462 AbstractCegarLoop]: Abstraction has 436 states and 625 transitions. [2019-10-22 11:24:18,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:18,669 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 625 transitions. [2019-10-22 11:24:18,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:24:18,673 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:18,674 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:18,674 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:18,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:18,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1832620089, now seen corresponding path program 1 times [2019-10-22 11:24:18,674 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:18,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927344492] [2019-10-22 11:24:18,675 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:18,675 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:18,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:18,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927344492] [2019-10-22 11:24:18,766 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:18,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:18,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414075579] [2019-10-22 11:24:18,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:18,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:18,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:18,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:18,768 INFO L87 Difference]: Start difference. First operand 436 states and 625 transitions. Second operand 3 states. [2019-10-22 11:24:18,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:18,874 INFO L93 Difference]: Finished difference Result 824 states and 1196 transitions. [2019-10-22 11:24:18,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:18,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-22 11:24:18,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:18,878 INFO L225 Difference]: With dead ends: 824 [2019-10-22 11:24:18,880 INFO L226 Difference]: Without dead ends: 804 [2019-10-22 11:24:18,881 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:18,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-10-22 11:24:18,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2019-10-22 11:24:18,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2019-10-22 11:24:18,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1174 transitions. [2019-10-22 11:24:18,934 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1174 transitions. Word has length 30 [2019-10-22 11:24:18,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:18,935 INFO L462 AbstractCegarLoop]: Abstraction has 804 states and 1174 transitions. [2019-10-22 11:24:18,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:18,935 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1174 transitions. [2019-10-22 11:24:18,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-22 11:24:18,942 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:18,942 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:18,943 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:18,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:18,943 INFO L82 PathProgramCache]: Analyzing trace with hash -903827168, now seen corresponding path program 1 times [2019-10-22 11:24:18,943 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:18,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84007584] [2019-10-22 11:24:18,944 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:18,944 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:18,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:19,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84007584] [2019-10-22 11:24:19,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:19,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:19,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110600487] [2019-10-22 11:24:19,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:19,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:19,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:19,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:19,025 INFO L87 Difference]: Start difference. First operand 804 states and 1174 transitions. Second operand 3 states. [2019-10-22 11:24:19,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:19,174 INFO L93 Difference]: Finished difference Result 2228 states and 3254 transitions. [2019-10-22 11:24:19,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:19,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-10-22 11:24:19,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:19,181 INFO L225 Difference]: With dead ends: 2228 [2019-10-22 11:24:19,181 INFO L226 Difference]: Without dead ends: 1439 [2019-10-22 11:24:19,183 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:19,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2019-10-22 11:24:19,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1419. [2019-10-22 11:24:19,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-10-22 11:24:19,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2080 transitions. [2019-10-22 11:24:19,254 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2080 transitions. Word has length 37 [2019-10-22 11:24:19,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:19,256 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 2080 transitions. [2019-10-22 11:24:19,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:19,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2080 transitions. [2019-10-22 11:24:19,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-22 11:24:19,261 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:19,261 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:19,262 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:19,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:19,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2039646367, now seen corresponding path program 1 times [2019-10-22 11:24:19,263 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:19,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322009111] [2019-10-22 11:24:19,264 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:19,264 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:19,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:19,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:19,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322009111] [2019-10-22 11:24:19,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:19,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:19,336 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702283453] [2019-10-22 11:24:19,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:19,337 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:19,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:19,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:19,337 INFO L87 Difference]: Start difference. First operand 1419 states and 2080 transitions. Second operand 3 states. [2019-10-22 11:24:19,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:19,536 INFO L93 Difference]: Finished difference Result 3925 states and 5752 transitions. [2019-10-22 11:24:19,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:19,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-22 11:24:19,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:19,544 INFO L225 Difference]: With dead ends: 3925 [2019-10-22 11:24:19,545 INFO L226 Difference]: Without dead ends: 2521 [2019-10-22 11:24:19,546 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:19,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2521 states. [2019-10-22 11:24:19,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2521 to 2501. [2019-10-22 11:24:19,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2501 states. [2019-10-22 11:24:19,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 3668 transitions. [2019-10-22 11:24:19,629 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 3668 transitions. Word has length 41 [2019-10-22 11:24:19,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:19,630 INFO L462 AbstractCegarLoop]: Abstraction has 2501 states and 3668 transitions. [2019-10-22 11:24:19,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:19,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3668 transitions. [2019-10-22 11:24:19,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-22 11:24:19,632 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:19,633 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:19,633 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:19,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:19,633 INFO L82 PathProgramCache]: Analyzing trace with hash 2049870071, now seen corresponding path program 1 times [2019-10-22 11:24:19,634 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:19,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493067384] [2019-10-22 11:24:19,634 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:19,634 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:19,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:24:19,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493067384] [2019-10-22 11:24:19,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:19,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:19,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282299506] [2019-10-22 11:24:19,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:19,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:19,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:19,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:19,701 INFO L87 Difference]: Start difference. First operand 2501 states and 3668 transitions. Second operand 3 states. [2019-10-22 11:24:19,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:19,837 INFO L93 Difference]: Finished difference Result 6405 states and 9442 transitions. [2019-10-22 11:24:19,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:19,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-22 11:24:19,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:19,853 INFO L225 Difference]: With dead ends: 6405 [2019-10-22 11:24:19,853 INFO L226 Difference]: Without dead ends: 3919 [2019-10-22 11:24:19,857 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:19,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2019-10-22 11:24:19,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 2509. [2019-10-22 11:24:19,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2509 states. [2019-10-22 11:24:19,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3676 transitions. [2019-10-22 11:24:19,976 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3676 transitions. Word has length 42 [2019-10-22 11:24:19,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:19,976 INFO L462 AbstractCegarLoop]: Abstraction has 2509 states and 3676 transitions. [2019-10-22 11:24:19,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:19,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3676 transitions. [2019-10-22 11:24:19,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-22 11:24:19,978 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:19,979 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:19,979 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:19,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:19,980 INFO L82 PathProgramCache]: Analyzing trace with hash -2104548615, now seen corresponding path program 1 times [2019-10-22 11:24:19,980 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:19,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936809940] [2019-10-22 11:24:19,980 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:19,980 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:19,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:24:20,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936809940] [2019-10-22 11:24:20,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:20,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:20,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333107470] [2019-10-22 11:24:20,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:20,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:20,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:20,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:20,062 INFO L87 Difference]: Start difference. First operand 2509 states and 3676 transitions. Second operand 4 states. [2019-10-22 11:24:20,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:20,355 INFO L93 Difference]: Finished difference Result 5027 states and 7363 transitions. [2019-10-22 11:24:20,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:20,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-10-22 11:24:20,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:20,364 INFO L225 Difference]: With dead ends: 5027 [2019-10-22 11:24:20,364 INFO L226 Difference]: Without dead ends: 2485 [2019-10-22 11:24:20,368 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:20,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2019-10-22 11:24:20,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2477. [2019-10-22 11:24:20,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2477 states. [2019-10-22 11:24:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3620 transitions. [2019-10-22 11:24:20,465 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3620 transitions. Word has length 42 [2019-10-22 11:24:20,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:20,465 INFO L462 AbstractCegarLoop]: Abstraction has 2477 states and 3620 transitions. [2019-10-22 11:24:20,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:20,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3620 transitions. [2019-10-22 11:24:20,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 11:24:20,467 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:20,467 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:20,468 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:20,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:20,468 INFO L82 PathProgramCache]: Analyzing trace with hash -5070360, now seen corresponding path program 1 times [2019-10-22 11:24:20,468 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:20,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515672583] [2019-10-22 11:24:20,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:20,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:20,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:20,593 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:20,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515672583] [2019-10-22 11:24:20,595 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:20,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:20,596 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320569919] [2019-10-22 11:24:20,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:20,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:20,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:20,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:20,599 INFO L87 Difference]: Start difference. First operand 2477 states and 3620 transitions. Second operand 3 states. [2019-10-22 11:24:20,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:20,998 INFO L93 Difference]: Finished difference Result 6135 states and 9006 transitions. [2019-10-22 11:24:20,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:20,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-10-22 11:24:20,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:21,011 INFO L225 Difference]: With dead ends: 6135 [2019-10-22 11:24:21,011 INFO L226 Difference]: Without dead ends: 3673 [2019-10-22 11:24:21,014 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:21,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3673 states. [2019-10-22 11:24:21,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3673 to 3649. [2019-10-22 11:24:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3649 states. [2019-10-22 11:24:21,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 5326 transitions. [2019-10-22 11:24:21,151 INFO L78 Accepts]: Start accepts. Automaton has 3649 states and 5326 transitions. Word has length 65 [2019-10-22 11:24:21,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:21,151 INFO L462 AbstractCegarLoop]: Abstraction has 3649 states and 5326 transitions. [2019-10-22 11:24:21,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:21,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 5326 transitions. [2019-10-22 11:24:21,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-22 11:24:21,154 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:21,154 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:21,155 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:21,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:21,155 INFO L82 PathProgramCache]: Analyzing trace with hash 205782185, now seen corresponding path program 1 times [2019-10-22 11:24:21,155 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:21,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102375829] [2019-10-22 11:24:21,157 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:21,157 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:21,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:21,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102375829] [2019-10-22 11:24:21,277 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:21,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:21,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511804203] [2019-10-22 11:24:21,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:21,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:21,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:21,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:21,278 INFO L87 Difference]: Start difference. First operand 3649 states and 5326 transitions. Second operand 3 states. [2019-10-22 11:24:21,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:21,626 INFO L93 Difference]: Finished difference Result 9046 states and 13264 transitions. [2019-10-22 11:24:21,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:21,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-10-22 11:24:21,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:21,645 INFO L225 Difference]: With dead ends: 9046 [2019-10-22 11:24:21,645 INFO L226 Difference]: Without dead ends: 5412 [2019-10-22 11:24:21,650 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5412 states. [2019-10-22 11:24:21,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5412 to 5386. [2019-10-22 11:24:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5386 states. [2019-10-22 11:24:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5386 states to 5386 states and 7846 transitions. [2019-10-22 11:24:21,837 INFO L78 Accepts]: Start accepts. Automaton has 5386 states and 7846 transitions. Word has length 69 [2019-10-22 11:24:21,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:21,838 INFO L462 AbstractCegarLoop]: Abstraction has 5386 states and 7846 transitions. [2019-10-22 11:24:21,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:21,840 INFO L276 IsEmpty]: Start isEmpty. Operand 5386 states and 7846 transitions. [2019-10-22 11:24:21,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-22 11:24:21,842 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:21,842 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:21,842 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:21,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:21,844 INFO L82 PathProgramCache]: Analyzing trace with hash -775419092, now seen corresponding path program 1 times [2019-10-22 11:24:21,844 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:21,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462303225] [2019-10-22 11:24:21,844 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:21,845 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:21,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:21,946 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 11:24:21,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462303225] [2019-10-22 11:24:21,947 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:21,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:21,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605788949] [2019-10-22 11:24:21,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:21,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:21,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:21,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:21,948 INFO L87 Difference]: Start difference. First operand 5386 states and 7846 transitions. Second operand 5 states. [2019-10-22 11:24:22,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:22,416 INFO L93 Difference]: Finished difference Result 11479 states and 16671 transitions. [2019-10-22 11:24:22,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:22,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-10-22 11:24:22,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:22,434 INFO L225 Difference]: With dead ends: 11479 [2019-10-22 11:24:22,434 INFO L226 Difference]: Without dead ends: 5451 [2019-10-22 11:24:22,442 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:22,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5451 states. [2019-10-22 11:24:22,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5451 to 5329. [2019-10-22 11:24:22,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5329 states. [2019-10-22 11:24:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5329 states to 5329 states and 7739 transitions. [2019-10-22 11:24:22,604 INFO L78 Accepts]: Start accepts. Automaton has 5329 states and 7739 transitions. Word has length 75 [2019-10-22 11:24:22,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:22,604 INFO L462 AbstractCegarLoop]: Abstraction has 5329 states and 7739 transitions. [2019-10-22 11:24:22,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:22,604 INFO L276 IsEmpty]: Start isEmpty. Operand 5329 states and 7739 transitions. [2019-10-22 11:24:22,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-22 11:24:22,606 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:22,606 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:22,607 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:22,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:22,607 INFO L82 PathProgramCache]: Analyzing trace with hash 617278273, now seen corresponding path program 1 times [2019-10-22 11:24:22,607 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:22,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915129554] [2019-10-22 11:24:22,608 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:22,608 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:22,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 11:24:22,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915129554] [2019-10-22 11:24:22,703 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:22,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:22,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569219111] [2019-10-22 11:24:22,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:22,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:22,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:22,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:22,704 INFO L87 Difference]: Start difference. First operand 5329 states and 7739 transitions. Second operand 3 states. [2019-10-22 11:24:22,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:22,869 INFO L93 Difference]: Finished difference Result 10607 states and 15403 transitions. [2019-10-22 11:24:22,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:22,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-22 11:24:22,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:22,883 INFO L225 Difference]: With dead ends: 10607 [2019-10-22 11:24:22,884 INFO L226 Difference]: Without dead ends: 5293 [2019-10-22 11:24:22,891 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:22,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5293 states. [2019-10-22 11:24:23,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5293 to 5293. [2019-10-22 11:24:23,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5293 states. [2019-10-22 11:24:23,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5293 states to 5293 states and 7667 transitions. [2019-10-22 11:24:23,062 INFO L78 Accepts]: Start accepts. Automaton has 5293 states and 7667 transitions. Word has length 77 [2019-10-22 11:24:23,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:23,062 INFO L462 AbstractCegarLoop]: Abstraction has 5293 states and 7667 transitions. [2019-10-22 11:24:23,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:23,062 INFO L276 IsEmpty]: Start isEmpty. Operand 5293 states and 7667 transitions. [2019-10-22 11:24:23,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-22 11:24:23,068 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:23,068 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:23,068 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:23,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:23,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1018765701, now seen corresponding path program 1 times [2019-10-22 11:24:23,069 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:23,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990685860] [2019-10-22 11:24:23,069 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:23,069 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:23,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:23,169 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 11:24:23,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990685860] [2019-10-22 11:24:23,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:23,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:23,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24451952] [2019-10-22 11:24:23,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:23,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:23,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:23,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:23,171 INFO L87 Difference]: Start difference. First operand 5293 states and 7667 transitions. Second operand 4 states. [2019-10-22 11:24:23,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:23,286 INFO L93 Difference]: Finished difference Result 5412 states and 7831 transitions. [2019-10-22 11:24:23,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:23,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-10-22 11:24:23,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:23,287 INFO L225 Difference]: With dead ends: 5412 [2019-10-22 11:24:23,288 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:24:23,294 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:23,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:24:23,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:24:23,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:24:23,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:24:23,295 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2019-10-22 11:24:23,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:23,295 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:24:23,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:23,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:24:23,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:24:23,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:24:24,000 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 20 [2019-10-22 11:24:24,921 INFO L446 ceAbstractionStarter]: At program point L1885(lines 1882 1887) the Hoare annotation is: true [2019-10-22 11:24:24,921 INFO L439 ceAbstractionStarter]: At program point L1885-1(lines 1882 1887) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,922 INFO L439 ceAbstractionStarter]: At program point L1885-2(lines 1882 1887) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 11:24:24,922 INFO L443 ceAbstractionStarter]: For program point L2810(lines 2810 2815) no Hoare annotation was computed. [2019-10-22 11:24:24,922 INFO L439 ceAbstractionStarter]: At program point L3009(lines 3008 3010) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,922 INFO L443 ceAbstractionStarter]: For program point L2679(line 2679) no Hoare annotation was computed. [2019-10-22 11:24:24,922 INFO L443 ceAbstractionStarter]: For program point L2283(lines 2283 2286) no Hoare annotation was computed. [2019-10-22 11:24:24,922 INFO L443 ceAbstractionStarter]: For program point L2283-3(lines 2283 2286) no Hoare annotation was computed. [2019-10-22 11:24:24,922 INFO L443 ceAbstractionStarter]: For program point L2283-2(lines 2283 2286) no Hoare annotation was computed. [2019-10-22 11:24:24,922 INFO L443 ceAbstractionStarter]: For program point L2283-5(lines 2283 2286) no Hoare annotation was computed. [2019-10-22 11:24:24,923 INFO L439 ceAbstractionStarter]: At program point L3076(lines 3075 3077) the Hoare annotation is: false [2019-10-22 11:24:24,923 INFO L443 ceAbstractionStarter]: For program point L2283-6(lines 2283 2286) no Hoare annotation was computed. [2019-10-22 11:24:24,923 INFO L443 ceAbstractionStarter]: For program point L2283-8(lines 2283 2286) no Hoare annotation was computed. [2019-10-22 11:24:24,923 INFO L443 ceAbstractionStarter]: For program point L2680(lines 2680 2714) no Hoare annotation was computed. [2019-10-22 11:24:24,923 INFO L443 ceAbstractionStarter]: For program point L1954(lines 1954 1961) no Hoare annotation was computed. [2019-10-22 11:24:24,923 INFO L443 ceAbstractionStarter]: For program point L1954-1(lines 1954 1961) no Hoare annotation was computed. [2019-10-22 11:24:24,924 INFO L443 ceAbstractionStarter]: For program point L1954-2(lines 1954 1961) no Hoare annotation was computed. [2019-10-22 11:24:24,924 INFO L443 ceAbstractionStarter]: For program point L1954-3(lines 1954 1961) no Hoare annotation was computed. [2019-10-22 11:24:24,924 INFO L439 ceAbstractionStarter]: At program point L2153-1(lines 2126 2159) the Hoare annotation is: false [2019-10-22 11:24:24,924 INFO L443 ceAbstractionStarter]: For program point L2153(lines 2153 2156) no Hoare annotation was computed. [2019-10-22 11:24:24,924 INFO L439 ceAbstractionStarter]: At program point L2153-3(lines 2126 2159) the Hoare annotation is: false [2019-10-22 11:24:24,924 INFO L443 ceAbstractionStarter]: For program point L2153-2(lines 2153 2156) no Hoare annotation was computed. [2019-10-22 11:24:24,924 INFO L439 ceAbstractionStarter]: At program point L2153-5(lines 2126 2159) the Hoare annotation is: false [2019-10-22 11:24:24,924 INFO L443 ceAbstractionStarter]: For program point L2153-4(lines 2153 2156) no Hoare annotation was computed. [2019-10-22 11:24:24,925 INFO L439 ceAbstractionStarter]: At program point L2153-7(lines 2126 2159) the Hoare annotation is: false [2019-10-22 11:24:24,925 INFO L443 ceAbstractionStarter]: For program point L2153-6(lines 2153 2156) no Hoare annotation was computed. [2019-10-22 11:24:24,925 INFO L443 ceAbstractionStarter]: For program point L2682(lines 2682 2711) no Hoare annotation was computed. [2019-10-22 11:24:24,925 INFO L443 ceAbstractionStarter]: For program point L2484(lines 2484 2492) no Hoare annotation was computed. [2019-10-22 11:24:24,925 INFO L443 ceAbstractionStarter]: For program point L2683(line 2683) no Hoare annotation was computed. [2019-10-22 11:24:24,925 INFO L443 ceAbstractionStarter]: For program point L2485(lines 2485 2488) no Hoare annotation was computed. [2019-10-22 11:24:24,925 INFO L443 ceAbstractionStarter]: For program point L2485-2(lines 2485 2488) no Hoare annotation was computed. [2019-10-22 11:24:24,925 INFO L443 ceAbstractionStarter]: For program point L2287(lines 2287 2290) no Hoare annotation was computed. [2019-10-22 11:24:24,925 INFO L443 ceAbstractionStarter]: For program point L2287-3(lines 2287 2290) no Hoare annotation was computed. [2019-10-22 11:24:24,926 INFO L443 ceAbstractionStarter]: For program point L2287-2(lines 2287 2290) no Hoare annotation was computed. [2019-10-22 11:24:24,926 INFO L443 ceAbstractionStarter]: For program point L2287-5(lines 2287 2290) no Hoare annotation was computed. [2019-10-22 11:24:24,926 INFO L443 ceAbstractionStarter]: For program point L2287-6(lines 2287 2290) no Hoare annotation was computed. [2019-10-22 11:24:24,926 INFO L443 ceAbstractionStarter]: For program point L2287-8(lines 2287 2290) no Hoare annotation was computed. [2019-10-22 11:24:24,926 INFO L443 ceAbstractionStarter]: For program point L2684(lines 2684 2689) no Hoare annotation was computed. [2019-10-22 11:24:24,926 INFO L443 ceAbstractionStarter]: For program point L2817(line 2817) no Hoare annotation was computed. [2019-10-22 11:24:24,926 INFO L443 ceAbstractionStarter]: For program point L2751(line 2751) no Hoare annotation was computed. [2019-10-22 11:24:24,926 INFO L443 ceAbstractionStarter]: For program point L2818(lines 2818 2823) no Hoare annotation was computed. [2019-10-22 11:24:24,926 INFO L443 ceAbstractionStarter]: For program point L2752(lines 2752 2757) no Hoare annotation was computed. [2019-10-22 11:24:24,926 INFO L443 ceAbstractionStarter]: For program point L2620(lines 2620 2834) no Hoare annotation was computed. [2019-10-22 11:24:24,926 INFO L443 ceAbstractionStarter]: For program point L2554(lines 2554 2557) no Hoare annotation was computed. [2019-10-22 11:24:24,927 INFO L443 ceAbstractionStarter]: For program point L2092(lines 2092 2105) no Hoare annotation was computed. [2019-10-22 11:24:24,927 INFO L439 ceAbstractionStarter]: At program point L2092-2(lines 2083 2108) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,928 INFO L446 ceAbstractionStarter]: At program point L1960(lines 1947 1963) the Hoare annotation is: true [2019-10-22 11:24:24,928 INFO L443 ceAbstractionStarter]: For program point L2092-3(lines 2092 2105) no Hoare annotation was computed. [2019-10-22 11:24:24,928 INFO L439 ceAbstractionStarter]: At program point L1960-1(lines 1947 1963) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,928 INFO L439 ceAbstractionStarter]: At program point L1960-2(lines 1947 1963) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,928 INFO L439 ceAbstractionStarter]: At program point L2092-5(lines 2083 2108) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,928 INFO L439 ceAbstractionStarter]: At program point L1960-3(lines 1947 1963) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 11:24:24,928 INFO L443 ceAbstractionStarter]: For program point L2621(line 2621) no Hoare annotation was computed. [2019-10-22 11:24:24,929 INFO L439 ceAbstractionStarter]: At program point L2886(lines 2882 2888) the Hoare annotation is: false [2019-10-22 11:24:24,929 INFO L443 ceAbstractionStarter]: For program point L2622(lines 2622 2677) no Hoare annotation was computed. [2019-10-22 11:24:24,929 INFO L446 ceAbstractionStarter]: At program point L2292(lines 2270 2308) the Hoare annotation is: true [2019-10-22 11:24:24,929 INFO L439 ceAbstractionStarter]: At program point L2292-2(lines 2270 2308) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 11:24:24,929 INFO L439 ceAbstractionStarter]: At program point L2292-1(lines 2270 2308) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,929 INFO L439 ceAbstractionStarter]: At program point L2953(lines 2952 2954) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,929 INFO L443 ceAbstractionStarter]: For program point L3086(lines 3086 3088) no Hoare annotation was computed. [2019-10-22 11:24:24,929 INFO L443 ceAbstractionStarter]: For program point L3086-2(lines 3086 3088) no Hoare annotation was computed. [2019-10-22 11:24:24,930 INFO L446 ceAbstractionStarter]: At program point L3086-1(lines 1 3088) the Hoare annotation is: true [2019-10-22 11:24:24,930 INFO L443 ceAbstractionStarter]: For program point L3086-4(lines 3086 3088) no Hoare annotation was computed. [2019-10-22 11:24:24,930 INFO L439 ceAbstractionStarter]: At program point L3086-3(lines 1 3088) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,930 INFO L439 ceAbstractionStarter]: At program point L3086-5(lines 1 3088) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 11:24:24,930 INFO L443 ceAbstractionStarter]: For program point L2624(lines 2624 2674) no Hoare annotation was computed. [2019-10-22 11:24:24,930 INFO L446 ceAbstractionStarter]: At program point L2294(lines 2270 2308) the Hoare annotation is: true [2019-10-22 11:24:24,930 INFO L439 ceAbstractionStarter]: At program point L2294-2(lines 2270 2308) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 11:24:24,930 INFO L439 ceAbstractionStarter]: At program point L2294-1(lines 2270 2308) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,931 INFO L443 ceAbstractionStarter]: For program point L2691(line 2691) no Hoare annotation was computed. [2019-10-22 11:24:24,931 INFO L443 ceAbstractionStarter]: For program point L2625(line 2625) no Hoare annotation was computed. [2019-10-22 11:24:24,931 INFO L439 ceAbstractionStarter]: At program point L2559(lines 2421 2581) the Hoare annotation is: false [2019-10-22 11:24:24,931 INFO L443 ceAbstractionStarter]: For program point L2427(lines 2427 2431) no Hoare annotation was computed. [2019-10-22 11:24:24,932 INFO L443 ceAbstractionStarter]: For program point L2427-2(lines 2421 2581) no Hoare annotation was computed. [2019-10-22 11:24:24,932 INFO L439 ceAbstractionStarter]: At program point L2956(lines 1 3088) the Hoare annotation is: false [2019-10-22 11:24:24,932 INFO L439 ceAbstractionStarter]: At program point L2956-2(lines 1 3088) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,932 INFO L439 ceAbstractionStarter]: At program point L2956-1(lines 1 3088) the Hoare annotation is: false [2019-10-22 11:24:24,932 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 2009) no Hoare annotation was computed. [2019-10-22 11:24:24,932 INFO L439 ceAbstractionStarter]: At program point L2956-4(lines 1 3088) the Hoare annotation is: false [2019-10-22 11:24:24,932 INFO L439 ceAbstractionStarter]: At program point L2956-3(lines 1 3088) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,932 INFO L439 ceAbstractionStarter]: At program point L2956-5(lines 1 3088) the Hoare annotation is: false [2019-10-22 11:24:24,933 INFO L443 ceAbstractionStarter]: For program point L2692(lines 2692 2707) no Hoare annotation was computed. [2019-10-22 11:24:24,933 INFO L443 ceAbstractionStarter]: For program point L2626(lines 2626 2630) no Hoare annotation was computed. [2019-10-22 11:24:24,933 INFO L443 ceAbstractionStarter]: For program point L2825(line 2825) no Hoare annotation was computed. [2019-10-22 11:24:24,933 INFO L443 ceAbstractionStarter]: For program point L2759(line 2759) no Hoare annotation was computed. [2019-10-22 11:24:24,933 INFO L439 ceAbstractionStarter]: At program point L2561(lines 2421 2581) the Hoare annotation is: false [2019-10-22 11:24:24,933 INFO L443 ceAbstractionStarter]: For program point L2760(lines 2760 2765) no Hoare annotation was computed. [2019-10-22 11:24:24,933 INFO L443 ceAbstractionStarter]: For program point L2694(lines 2694 2700) no Hoare annotation was computed. [2019-10-22 11:24:24,933 INFO L443 ceAbstractionStarter]: For program point L2694-2(lines 2692 2706) no Hoare annotation was computed. [2019-10-22 11:24:24,933 INFO L446 ceAbstractionStarter]: At program point L2364-2(lines 1 3088) the Hoare annotation is: true [2019-10-22 11:24:24,933 INFO L439 ceAbstractionStarter]: At program point L2364-6(lines 2357 2366) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,934 INFO L443 ceAbstractionStarter]: For program point L2100(lines 2100 2103) no Hoare annotation was computed. [2019-10-22 11:24:24,934 INFO L439 ceAbstractionStarter]: At program point L2364-9(lines 1 3088) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 11:24:24,934 INFO L443 ceAbstractionStarter]: For program point L2100-1(lines 2100 2103) no Hoare annotation was computed. [2019-10-22 11:24:24,934 INFO L439 ceAbstractionStarter]: At program point L2101-1(lines 2092 2104) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,934 INFO L439 ceAbstractionStarter]: At program point L2101(lines 2092 2104) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,934 INFO L443 ceAbstractionStarter]: For program point L2894(lines 2894 2897) no Hoare annotation was computed. [2019-10-22 11:24:24,934 INFO L443 ceAbstractionStarter]: For program point L2894-2(lines 2894 2897) no Hoare annotation was computed. [2019-10-22 11:24:24,934 INFO L443 ceAbstractionStarter]: For program point L2894-4(lines 2894 2897) no Hoare annotation was computed. [2019-10-22 11:24:24,935 INFO L443 ceAbstractionStarter]: For program point L2894-6(lines 2894 2897) no Hoare annotation was computed. [2019-10-22 11:24:24,935 INFO L443 ceAbstractionStarter]: For program point L2894-8(lines 2894 2897) no Hoare annotation was computed. [2019-10-22 11:24:24,935 INFO L443 ceAbstractionStarter]: For program point L2564(lines 2564 2574) no Hoare annotation was computed. [2019-10-22 11:24:24,936 INFO L439 ceAbstractionStarter]: At program point L2564-2(lines 1 3088) the Hoare annotation is: false [2019-10-22 11:24:24,936 INFO L443 ceAbstractionStarter]: For program point L2300(line 2300) no Hoare annotation was computed. [2019-10-22 11:24:24,936 INFO L443 ceAbstractionStarter]: For program point L2300-2(lines 2299 2301) no Hoare annotation was computed. [2019-10-22 11:24:24,936 INFO L443 ceAbstractionStarter]: For program point L2300-3(line 2300) no Hoare annotation was computed. [2019-10-22 11:24:24,936 INFO L443 ceAbstractionStarter]: For program point L2300-6(line 2300) no Hoare annotation was computed. [2019-10-22 11:24:24,936 INFO L443 ceAbstractionStarter]: For program point L2300-5(lines 2299 2301) no Hoare annotation was computed. [2019-10-22 11:24:24,936 INFO L443 ceAbstractionStarter]: For program point L2300-8(lines 2299 2301) no Hoare annotation was computed. [2019-10-22 11:24:24,936 INFO L439 ceAbstractionStarter]: At program point L2499(lines 2421 2581) the Hoare annotation is: false [2019-10-22 11:24:24,937 INFO L443 ceAbstractionStarter]: For program point L2301-1(line 2301) no Hoare annotation was computed. [2019-10-22 11:24:24,937 INFO L443 ceAbstractionStarter]: For program point L2301-3(line 2301) no Hoare annotation was computed. [2019-10-22 11:24:24,937 INFO L443 ceAbstractionStarter]: For program point L2301-5(line 2301) no Hoare annotation was computed. [2019-10-22 11:24:24,937 INFO L443 ceAbstractionStarter]: For program point L1971(lines 1971 1978) no Hoare annotation was computed. [2019-10-22 11:24:24,937 INFO L439 ceAbstractionStarter]: At program point L2962(lines 2842 2849) the Hoare annotation is: false [2019-10-22 11:24:24,937 INFO L443 ceAbstractionStarter]: For program point L1971-1(lines 1971 1978) no Hoare annotation was computed. [2019-10-22 11:24:24,937 INFO L443 ceAbstractionStarter]: For program point L1971-2(lines 1971 1978) no Hoare annotation was computed. [2019-10-22 11:24:24,937 INFO L443 ceAbstractionStarter]: For program point L2632(line 2632) no Hoare annotation was computed. [2019-10-22 11:24:24,937 INFO L443 ceAbstractionStarter]: For program point L2633(lines 2633 2637) no Hoare annotation was computed. [2019-10-22 11:24:24,937 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2009) no Hoare annotation was computed. [2019-10-22 11:24:24,938 INFO L443 ceAbstractionStarter]: For program point L2633-2(lines 2624 2674) no Hoare annotation was computed. [2019-10-22 11:24:24,938 INFO L439 ceAbstractionStarter]: At program point L2501(lines 2421 2581) the Hoare annotation is: false [2019-10-22 11:24:24,938 INFO L446 ceAbstractionStarter]: At program point L2303-1(lines 2261 2309) the Hoare annotation is: true [2019-10-22 11:24:24,938 INFO L443 ceAbstractionStarter]: For program point L2303(lines 2303 2306) no Hoare annotation was computed. [2019-10-22 11:24:24,938 INFO L439 ceAbstractionStarter]: At program point L2303-3(lines 2261 2309) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,938 INFO L443 ceAbstractionStarter]: For program point L2303-2(lines 2303 2306) no Hoare annotation was computed. [2019-10-22 11:24:24,938 INFO L439 ceAbstractionStarter]: At program point L2303-5(lines 2261 2309) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 11:24:24,938 INFO L443 ceAbstractionStarter]: For program point L2303-4(lines 2303 2306) no Hoare annotation was computed. [2019-10-22 11:24:24,938 INFO L443 ceAbstractionStarter]: For program point L2832(line 2832) no Hoare annotation was computed. [2019-10-22 11:24:24,938 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:24:24,939 INFO L439 ceAbstractionStarter]: At program point L2965-1(lines 1 3088) the Hoare annotation is: false [2019-10-22 11:24:24,939 INFO L439 ceAbstractionStarter]: At program point L2965-2(lines 1 3088) the Hoare annotation is: false [2019-10-22 11:24:24,939 INFO L443 ceAbstractionStarter]: For program point L2767(line 2767) no Hoare annotation was computed. [2019-10-22 11:24:24,940 INFO L443 ceAbstractionStarter]: For program point L2569(lines 2569 2572) no Hoare annotation was computed. [2019-10-22 11:24:24,940 INFO L439 ceAbstractionStarter]: At program point L2570(lines 1 3088) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0)) [2019-10-22 11:24:24,940 INFO L443 ceAbstractionStarter]: For program point L2504(lines 2504 2511) no Hoare annotation was computed. [2019-10-22 11:24:24,940 INFO L443 ceAbstractionStarter]: For program point L2504-2(lines 2421 2581) no Hoare annotation was computed. [2019-10-22 11:24:24,940 INFO L439 ceAbstractionStarter]: At program point L2835(lines 2605 2840) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,940 INFO L446 ceAbstractionStarter]: At program point L2703(lines 1 3088) the Hoare annotation is: true [2019-10-22 11:24:24,940 INFO L439 ceAbstractionStarter]: At program point L2175(lines 2169 2177) the Hoare annotation is: false [2019-10-22 11:24:24,940 INFO L439 ceAbstractionStarter]: At program point L1977(lines 1964 1980) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,940 INFO L439 ceAbstractionStarter]: At program point L2968(lines 2858 2865) the Hoare annotation is: false [2019-10-22 11:24:24,941 INFO L439 ceAbstractionStarter]: At program point L1977-1(lines 1964 1980) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,941 INFO L439 ceAbstractionStarter]: At program point L1977-2(lines 1964 1980) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,941 INFO L439 ceAbstractionStarter]: At program point L2968-2(lines 2858 2865) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,941 INFO L439 ceAbstractionStarter]: At program point L2968-1(lines 2858 2865) the Hoare annotation is: false [2019-10-22 11:24:24,941 INFO L443 ceAbstractionStarter]: For program point L2506(lines 2506 2509) no Hoare annotation was computed. [2019-10-22 11:24:24,941 INFO L439 ceAbstractionStarter]: At program point L3035-1(lines 3034 3036) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,941 INFO L439 ceAbstractionStarter]: At program point L3035(lines 3034 3036) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-10-22 11:24:24,941 INFO L439 ceAbstractionStarter]: At program point L3035-2(lines 3034 3036) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0)) [2019-10-22 11:24:24,942 INFO L443 ceAbstractionStarter]: For program point L2441(lines 2441 2444) no Hoare annotation was computed. [2019-10-22 11:24:24,942 INFO L443 ceAbstractionStarter]: For program point L2375-1(lines 2375 2378) no Hoare annotation was computed. [2019-10-22 11:24:24,942 INFO L443 ceAbstractionStarter]: For program point L2375(lines 2375 2378) no Hoare annotation was computed. [2019-10-22 11:24:24,942 INFO L443 ceAbstractionStarter]: For program point L2375-2(lines 2375 2378) no Hoare annotation was computed. [2019-10-22 11:24:24,942 INFO L439 ceAbstractionStarter]: At program point L2112(lines 1 3088) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,942 INFO L439 ceAbstractionStarter]: At program point L2112-2(lines 2109 2114) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,942 INFO L439 ceAbstractionStarter]: At program point L2112-1(lines 2109 2114) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,942 INFO L446 ceAbstractionStarter]: At program point L2839(lines 2592 2841) the Hoare annotation is: true [2019-10-22 11:24:24,942 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:24:24,943 INFO L439 ceAbstractionStarter]: At program point L-1-2(line -1) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,943 INFO L439 ceAbstractionStarter]: At program point L2972(lines 2971 2973) the Hoare annotation is: false [2019-10-22 11:24:24,943 INFO L443 ceAbstractionStarter]: For program point L-1-3(line -1) no Hoare annotation was computed. [2019-10-22 11:24:24,944 INFO L439 ceAbstractionStarter]: At program point L-1-5(line -1) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,944 INFO L439 ceAbstractionStarter]: At program point L2972-1(lines 2971 2973) the Hoare annotation is: false [2019-10-22 11:24:24,944 INFO L443 ceAbstractionStarter]: For program point L-1-6(line -1) no Hoare annotation was computed. [2019-10-22 11:24:24,944 INFO L439 ceAbstractionStarter]: At program point L-1-8(line -1) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,944 INFO L443 ceAbstractionStarter]: For program point L2774(line 2774) no Hoare annotation was computed. [2019-10-22 11:24:24,944 INFO L443 ceAbstractionStarter]: For program point L-1-9(line -1) no Hoare annotation was computed. [2019-10-22 11:24:24,944 INFO L443 ceAbstractionStarter]: For program point L-1-10(line -1) no Hoare annotation was computed. [2019-10-22 11:24:24,944 INFO L443 ceAbstractionStarter]: For program point L-1-11(line -1) no Hoare annotation was computed. [2019-10-22 11:24:24,944 INFO L443 ceAbstractionStarter]: For program point L-1-12(line -1) no Hoare annotation was computed. [2019-10-22 11:24:24,945 INFO L439 ceAbstractionStarter]: At program point L3039(lines 3038 3040) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,945 INFO L443 ceAbstractionStarter]: For program point L2775(lines 2775 2830) no Hoare annotation was computed. [2019-10-22 11:24:24,945 INFO L443 ceAbstractionStarter]: For program point L2709(line 2709) no Hoare annotation was computed. [2019-10-22 11:24:24,945 INFO L443 ceAbstractionStarter]: For program point L2379(lines 2379 2393) no Hoare annotation was computed. [2019-10-22 11:24:24,945 INFO L443 ceAbstractionStarter]: For program point L2379-3(lines 2379 2393) no Hoare annotation was computed. [2019-10-22 11:24:24,945 INFO L443 ceAbstractionStarter]: For program point L2379-2(lines 2379 2393) no Hoare annotation was computed. [2019-10-22 11:24:24,945 INFO L443 ceAbstractionStarter]: For program point L2379-5(lines 2379 2393) no Hoare annotation was computed. [2019-10-22 11:24:24,945 INFO L443 ceAbstractionStarter]: For program point L2379-6(lines 2379 2393) no Hoare annotation was computed. [2019-10-22 11:24:24,945 INFO L443 ceAbstractionStarter]: For program point L2379-8(lines 2379 2393) no Hoare annotation was computed. [2019-10-22 11:24:24,945 INFO L443 ceAbstractionStarter]: For program point L2644(line 2644) no Hoare annotation was computed. [2019-10-22 11:24:24,946 INFO L439 ceAbstractionStarter]: At program point L2446(lines 2421 2581) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,946 INFO L443 ceAbstractionStarter]: For program point L2512-1(lines 2421 2581) no Hoare annotation was computed. [2019-10-22 11:24:24,946 INFO L439 ceAbstractionStarter]: At program point L2182(lines 2178 2184) the Hoare annotation is: false [2019-10-22 11:24:24,946 INFO L439 ceAbstractionStarter]: At program point L2182-1(lines 2178 2184) the Hoare annotation is: false [2019-10-22 11:24:24,946 INFO L439 ceAbstractionStarter]: At program point L2975-1(lines 2974 2976) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-10-22 11:24:24,946 INFO L439 ceAbstractionStarter]: At program point L2975(lines 2974 2976) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-10-22 11:24:24,946 INFO L439 ceAbstractionStarter]: At program point L2975-3(lines 2974 2976) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,946 INFO L439 ceAbstractionStarter]: At program point L2975-2(lines 2974 2976) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,946 INFO L439 ceAbstractionStarter]: At program point L2975-5(lines 2974 2976) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0)) [2019-10-22 11:24:24,947 INFO L439 ceAbstractionStarter]: At program point L2975-4(lines 2974 2976) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0)) [2019-10-22 11:24:24,947 INFO L443 ceAbstractionStarter]: For program point L2777(lines 2777 2827) no Hoare annotation was computed. [2019-10-22 11:24:24,948 INFO L443 ceAbstractionStarter]: For program point L2645(lines 2645 2649) no Hoare annotation was computed. [2019-10-22 11:24:24,948 INFO L443 ceAbstractionStarter]: For program point L2645-2(lines 2624 2674) no Hoare annotation was computed. [2019-10-22 11:24:24,948 INFO L439 ceAbstractionStarter]: At program point L3042(lines 3041 3043) the Hoare annotation is: (and (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 11:24:24,948 INFO L443 ceAbstractionStarter]: For program point L2778(line 2778) no Hoare annotation was computed. [2019-10-22 11:24:24,948 INFO L439 ceAbstractionStarter]: At program point L2580(lines 2410 2582) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nwriters_stress~0 1))) (.cse1 (= ~ldv_state_variable_0~0 1))) (or (and (<= (+ |ULTIMATE.start_lock_torture_init_#res| 16) 0) .cse0 .cse1) (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (<= (+ |ULTIMATE.start_lock_torture_init_#res| 12) 0) .cse0 .cse1))) [2019-10-22 11:24:24,948 INFO L443 ceAbstractionStarter]: For program point L2514(lines 2514 2517) no Hoare annotation was computed. [2019-10-22 11:24:24,948 INFO L439 ceAbstractionStarter]: At program point L2448(lines 2421 2581) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,948 INFO L443 ceAbstractionStarter]: For program point L2779(lines 2779 2783) no Hoare annotation was computed. [2019-10-22 11:24:24,949 INFO L439 ceAbstractionStarter]: At program point L2451(lines 2421 2581) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,949 INFO L439 ceAbstractionStarter]: At program point L2385-1(lines 2379 2392) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,949 INFO L439 ceAbstractionStarter]: At program point L2385(lines 2379 2392) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-10-22 11:24:24,949 INFO L443 ceAbstractionStarter]: For program point L2319-1(lines 2319 2323) no Hoare annotation was computed. [2019-10-22 11:24:24,949 INFO L443 ceAbstractionStarter]: For program point L2319(lines 2319 2323) no Hoare annotation was computed. [2019-10-22 11:24:24,949 INFO L439 ceAbstractionStarter]: At program point L2385-2(lines 2379 2392) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0)) [2019-10-22 11:24:24,949 INFO L443 ceAbstractionStarter]: For program point L2319-2(lines 2319 2323) no Hoare annotation was computed. [2019-10-22 11:24:24,949 INFO L443 ceAbstractionStarter]: For program point L2716(line 2716) no Hoare annotation was computed. [2019-10-22 11:24:24,949 INFO L443 ceAbstractionStarter]: For program point L2717(lines 2717 2772) no Hoare annotation was computed. [2019-10-22 11:24:24,950 INFO L439 ceAbstractionStarter]: At program point L2387-1(lines 2379 2392) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,950 INFO L439 ceAbstractionStarter]: At program point L2387(lines 2379 2392) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-10-22 11:24:24,950 INFO L439 ceAbstractionStarter]: At program point L2387-2(lines 2379 2392) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0)) [2019-10-22 11:24:24,950 INFO L439 ceAbstractionStarter]: At program point L2123(lines 2119 2125) the Hoare annotation is: false [2019-10-22 11:24:24,950 INFO L443 ceAbstractionStarter]: For program point L2520-1(lines 2421 2581) no Hoare annotation was computed. [2019-10-22 11:24:24,950 INFO L446 ceAbstractionStarter]: At program point L1926(lines 1924 1927) the Hoare annotation is: true [2019-10-22 11:24:24,950 INFO L439 ceAbstractionStarter]: At program point L1926-1(lines 1924 1927) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,950 INFO L439 ceAbstractionStarter]: At program point L1926-2(lines 1924 1927) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,951 INFO L439 ceAbstractionStarter]: At program point L1926-3(lines 1924 1927) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 11:24:24,951 INFO L443 ceAbstractionStarter]: For program point L2785(line 2785) no Hoare annotation was computed. [2019-10-22 11:24:24,951 INFO L443 ceAbstractionStarter]: For program point L2719(lines 2719 2769) no Hoare annotation was computed. [2019-10-22 11:24:24,952 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 2009) no Hoare annotation was computed. [2019-10-22 11:24:24,952 INFO L443 ceAbstractionStarter]: For program point L2786(lines 2786 2790) no Hoare annotation was computed. [2019-10-22 11:24:24,952 INFO L443 ceAbstractionStarter]: For program point L2720(line 2720) no Hoare annotation was computed. [2019-10-22 11:24:24,952 INFO L443 ceAbstractionStarter]: For program point L2786-2(lines 2777 2827) no Hoare annotation was computed. [2019-10-22 11:24:24,952 INFO L443 ceAbstractionStarter]: For program point L2522(lines 2522 2525) no Hoare annotation was computed. [2019-10-22 11:24:24,952 INFO L439 ceAbstractionStarter]: At program point L2985(lines 2984 2986) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,952 INFO L443 ceAbstractionStarter]: For program point L2721(lines 2721 2725) no Hoare annotation was computed. [2019-10-22 11:24:24,952 INFO L443 ceAbstractionStarter]: For program point L2656(line 2656) no Hoare annotation was computed. [2019-10-22 11:24:24,953 INFO L439 ceAbstractionStarter]: At program point L3053-1(lines 3052 3054) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,953 INFO L446 ceAbstractionStarter]: At program point L3053(lines 3052 3054) the Hoare annotation is: true [2019-10-22 11:24:24,953 INFO L439 ceAbstractionStarter]: At program point L3053-2(lines 3052 3054) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 11:24:24,953 INFO L443 ceAbstractionStarter]: For program point L2657(lines 2657 2662) no Hoare annotation was computed. [2019-10-22 11:24:24,953 INFO L439 ceAbstractionStarter]: At program point L2460(lines 2452 2468) the Hoare annotation is: (and (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 11:24:24,953 INFO L439 ceAbstractionStarter]: At program point L2989(lines 2988 2990) the Hoare annotation is: false [2019-10-22 11:24:24,953 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 2009) no Hoare annotation was computed. [2019-10-22 11:24:24,953 INFO L439 ceAbstractionStarter]: At program point L2462(lines 2452 2468) the Hoare annotation is: (and (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 11:24:24,953 INFO L443 ceAbstractionStarter]: For program point L2528-1(lines 2528 2535) no Hoare annotation was computed. [2019-10-22 11:24:24,954 INFO L439 ceAbstractionStarter]: At program point L3057(lines 3056 3058) the Hoare annotation is: false [2019-10-22 11:24:24,954 INFO L443 ceAbstractionStarter]: For program point L2727(line 2727) no Hoare annotation was computed. [2019-10-22 11:24:24,954 INFO L443 ceAbstractionStarter]: For program point L2397-1(lines 2397 2406) no Hoare annotation was computed. [2019-10-22 11:24:24,954 INFO L443 ceAbstractionStarter]: For program point L2397(lines 2397 2406) no Hoare annotation was computed. [2019-10-22 11:24:24,954 INFO L443 ceAbstractionStarter]: For program point L2397-2(lines 2397 2406) no Hoare annotation was computed. [2019-10-22 11:24:24,954 INFO L446 ceAbstractionStarter]: At program point L1935(lines 1930 1937) the Hoare annotation is: true [2019-10-22 11:24:24,954 INFO L439 ceAbstractionStarter]: At program point L1935-1(lines 1930 1937) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,954 INFO L439 ceAbstractionStarter]: At program point L1869(lines 1864 1871) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,955 INFO L439 ceAbstractionStarter]: At program point L1935-2(lines 1930 1937) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,955 INFO L439 ceAbstractionStarter]: At program point L1935-3(lines 1930 1937) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 11:24:24,955 INFO L443 ceAbstractionStarter]: For program point L2728(lines 2728 2732) no Hoare annotation was computed. [2019-10-22 11:24:24,956 INFO L443 ceAbstractionStarter]: For program point L2728-2(lines 2719 2769) no Hoare annotation was computed. [2019-10-22 11:24:24,956 INFO L443 ceAbstractionStarter]: For program point L2530(lines 2530 2533) no Hoare annotation was computed. [2019-10-22 11:24:24,956 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:24:24,956 INFO L439 ceAbstractionStarter]: At program point L2993(lines 2992 2994) the Hoare annotation is: false [2019-10-22 11:24:24,956 INFO L439 ceAbstractionStarter]: At program point L2928(lines 2924 2930) the Hoare annotation is: false [2019-10-22 11:24:24,956 INFO L439 ceAbstractionStarter]: At program point L2928-1(lines 2924 2930) the Hoare annotation is: false [2019-10-22 11:24:24,956 INFO L443 ceAbstractionStarter]: For program point L2664(line 2664) no Hoare annotation was computed. [2019-10-22 11:24:24,956 INFO L439 ceAbstractionStarter]: At program point L3061-1(lines 3060 3062) the Hoare annotation is: false [2019-10-22 11:24:24,956 INFO L439 ceAbstractionStarter]: At program point L3061(lines 3060 3062) the Hoare annotation is: false [2019-10-22 11:24:24,957 INFO L439 ceAbstractionStarter]: At program point L3061-3(lines 3060 3062) the Hoare annotation is: false [2019-10-22 11:24:24,957 INFO L439 ceAbstractionStarter]: At program point L3061-2(lines 3060 3062) the Hoare annotation is: false [2019-10-22 11:24:24,957 INFO L439 ceAbstractionStarter]: At program point L3061-5(lines 3060 3062) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,957 INFO L439 ceAbstractionStarter]: At program point L3061-4(lines 3060 3062) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,957 INFO L439 ceAbstractionStarter]: At program point L3061-7(lines 3060 3062) the Hoare annotation is: false [2019-10-22 11:24:24,957 INFO L439 ceAbstractionStarter]: At program point L3061-6(lines 3060 3062) the Hoare annotation is: false [2019-10-22 11:24:24,957 INFO L439 ceAbstractionStarter]: At program point L3061-9(lines 3060 3062) the Hoare annotation is: false [2019-10-22 11:24:24,957 INFO L443 ceAbstractionStarter]: For program point L2797(line 2797) no Hoare annotation was computed. [2019-10-22 11:24:24,957 INFO L439 ceAbstractionStarter]: At program point L3061-8(lines 3060 3062) the Hoare annotation is: false [2019-10-22 11:24:24,958 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 2009) no Hoare annotation was computed. [2019-10-22 11:24:24,958 INFO L443 ceAbstractionStarter]: For program point L2665(lines 2665 2670) no Hoare annotation was computed. [2019-10-22 11:24:24,958 INFO L443 ceAbstractionStarter]: For program point L2401-1(lines 2401 2405) no Hoare annotation was computed. [2019-10-22 11:24:24,958 INFO L443 ceAbstractionStarter]: For program point L2401(lines 2401 2405) no Hoare annotation was computed. [2019-10-22 11:24:24,958 INFO L443 ceAbstractionStarter]: For program point L2401-2(lines 2401 2405) no Hoare annotation was computed. [2019-10-22 11:24:24,958 INFO L446 ceAbstractionStarter]: At program point L2005(lines 2891 2900) the Hoare annotation is: true [2019-10-22 11:24:24,958 INFO L439 ceAbstractionStarter]: At program point L2005-1(lines 2891 2900) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,958 INFO L439 ceAbstractionStarter]: At program point L2005-2(lines 2891 2900) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,958 INFO L439 ceAbstractionStarter]: At program point L2005-3(lines 2891 2900) the Hoare annotation is: false [2019-10-22 11:24:24,959 INFO L439 ceAbstractionStarter]: At program point L2005-4(lines 2891 2900) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 11:24:24,959 INFO L443 ceAbstractionStarter]: For program point L2798(lines 2798 2802) no Hoare annotation was computed. [2019-10-22 11:24:24,960 INFO L443 ceAbstractionStarter]: For program point L2798-2(lines 2777 2827) no Hoare annotation was computed. [2019-10-22 11:24:24,960 INFO L443 ceAbstractionStarter]: For program point L2138(lines 2138 2151) no Hoare annotation was computed. [2019-10-22 11:24:24,960 INFO L443 ceAbstractionStarter]: For program point L2138-2(lines 2138 2151) no Hoare annotation was computed. [2019-10-22 11:24:24,960 INFO L443 ceAbstractionStarter]: For program point L2138-3(lines 2138 2151) no Hoare annotation was computed. [2019-10-22 11:24:24,960 INFO L443 ceAbstractionStarter]: For program point L2138-6(lines 2138 2151) no Hoare annotation was computed. [2019-10-22 11:24:24,960 INFO L443 ceAbstractionStarter]: For program point L2138-5(lines 2138 2151) no Hoare annotation was computed. [2019-10-22 11:24:24,960 INFO L439 ceAbstractionStarter]: At program point L2997(lines 2996 2998) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,960 INFO L443 ceAbstractionStarter]: For program point L2138-8(lines 2138 2151) no Hoare annotation was computed. [2019-10-22 11:24:24,960 INFO L443 ceAbstractionStarter]: For program point L2138-9(lines 2138 2151) no Hoare annotation was computed. [2019-10-22 11:24:24,961 INFO L443 ceAbstractionStarter]: For program point L2138-11(lines 2138 2151) no Hoare annotation was computed. [2019-10-22 11:24:24,961 INFO L443 ceAbstractionStarter]: For program point L2470(lines 2470 2473) no Hoare annotation was computed. [2019-10-22 11:24:24,961 INFO L443 ceAbstractionStarter]: For program point L2470-2(lines 2421 2581) no Hoare annotation was computed. [2019-10-22 11:24:24,961 INFO L443 ceAbstractionStarter]: For program point L2008(line 2008) no Hoare annotation was computed. [2019-10-22 11:24:24,961 INFO L439 ceAbstractionStarter]: At program point L3065(lines 3064 3066) the Hoare annotation is: false [2019-10-22 11:24:24,961 INFO L443 ceAbstractionStarter]: For program point L2008-1(line 2008) no Hoare annotation was computed. [2019-10-22 11:24:24,961 INFO L443 ceAbstractionStarter]: For program point L2008-2(line 2008) no Hoare annotation was computed. [2019-10-22 11:24:24,961 INFO L443 ceAbstractionStarter]: For program point L2008-3(line 2008) no Hoare annotation was computed. [2019-10-22 11:24:24,961 INFO L443 ceAbstractionStarter]: For program point L2008-4(line 2008) no Hoare annotation was computed. [2019-10-22 11:24:24,961 INFO L443 ceAbstractionStarter]: For program point L2538(lines 2538 2546) no Hoare annotation was computed. [2019-10-22 11:24:24,962 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:24:24,962 INFO L439 ceAbstractionStarter]: At program point L3001(lines 3000 3002) the Hoare annotation is: false [2019-10-22 11:24:24,962 INFO L439 ceAbstractionStarter]: At program point L2935-1(lines 2931 2937) the Hoare annotation is: false [2019-10-22 11:24:24,962 INFO L439 ceAbstractionStarter]: At program point L2935(lines 2931 2937) the Hoare annotation is: false [2019-10-22 11:24:24,962 INFO L439 ceAbstractionStarter]: At program point L2935-3(lines 2931 2937) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,962 INFO L439 ceAbstractionStarter]: At program point L2935-2(lines 2931 2937) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,962 INFO L439 ceAbstractionStarter]: At program point L2935-5(lines 2931 2937) the Hoare annotation is: false [2019-10-22 11:24:24,962 INFO L439 ceAbstractionStarter]: At program point L2935-4(lines 2931 2937) the Hoare annotation is: false [2019-10-22 11:24:24,962 INFO L443 ceAbstractionStarter]: For program point L2539(lines 2539 2542) no Hoare annotation was computed. [2019-10-22 11:24:24,963 INFO L443 ceAbstractionStarter]: For program point L2539-2(lines 2539 2542) no Hoare annotation was computed. [2019-10-22 11:24:24,963 INFO L439 ceAbstractionStarter]: At program point L1879(lines 1874 1881) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,963 INFO L443 ceAbstractionStarter]: For program point L2672(line 2672) no Hoare annotation was computed. [2019-10-22 11:24:24,963 INFO L443 ceAbstractionStarter]: For program point L2474-1(lines 2474 2479) no Hoare annotation was computed. [2019-10-22 11:24:24,964 INFO L439 ceAbstractionStarter]: At program point L2871-1(lines 2866 2873) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,964 INFO L446 ceAbstractionStarter]: At program point L2871(lines 2866 2873) the Hoare annotation is: true [2019-10-22 11:24:24,964 INFO L439 ceAbstractionStarter]: At program point L2871-3(lines 2866 2873) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 11:24:24,964 INFO L439 ceAbstractionStarter]: At program point L2871-2(lines 2866 2873) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,964 INFO L443 ceAbstractionStarter]: For program point L2739(line 2739) no Hoare annotation was computed. [2019-10-22 11:24:24,964 INFO L443 ceAbstractionStarter]: For program point L2740(lines 2740 2744) no Hoare annotation was computed. [2019-10-22 11:24:24,964 INFO L443 ceAbstractionStarter]: For program point L2740-2(lines 2719 2769) no Hoare annotation was computed. [2019-10-22 11:24:24,965 INFO L443 ceAbstractionStarter]: For program point L2278(lines 2278 2281) no Hoare annotation was computed. [2019-10-22 11:24:24,965 INFO L443 ceAbstractionStarter]: For program point L2278-2(lines 2278 2281) no Hoare annotation was computed. [2019-10-22 11:24:24,965 INFO L443 ceAbstractionStarter]: For program point L2146(lines 2146 2149) no Hoare annotation was computed. [2019-10-22 11:24:24,965 INFO L443 ceAbstractionStarter]: For program point L2278-3(lines 2278 2281) no Hoare annotation was computed. [2019-10-22 11:24:24,965 INFO L443 ceAbstractionStarter]: For program point L2278-6(lines 2278 2281) no Hoare annotation was computed. [2019-10-22 11:24:24,965 INFO L443 ceAbstractionStarter]: For program point L2146-2(lines 2146 2149) no Hoare annotation was computed. [2019-10-22 11:24:24,965 INFO L443 ceAbstractionStarter]: For program point L2146-1(lines 2146 2149) no Hoare annotation was computed. [2019-10-22 11:24:24,965 INFO L443 ceAbstractionStarter]: For program point L2278-5(lines 2278 2281) no Hoare annotation was computed. [2019-10-22 11:24:24,965 INFO L439 ceAbstractionStarter]: At program point L2080(lines 2077 2082) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 11:24:24,965 INFO L443 ceAbstractionStarter]: For program point L2278-8(lines 2278 2281) no Hoare annotation was computed. [2019-10-22 11:24:24,965 INFO L443 ceAbstractionStarter]: For program point L2146-3(lines 2146 2149) no Hoare annotation was computed. [2019-10-22 11:24:24,965 INFO L439 ceAbstractionStarter]: At program point L3005(lines 3004 3006) the Hoare annotation is: false [2019-10-22 11:24:24,966 INFO L439 ceAbstractionStarter]: At program point L2147-1(lines 2138 2150) the Hoare annotation is: false [2019-10-22 11:24:24,966 INFO L439 ceAbstractionStarter]: At program point L2147(lines 2138 2150) the Hoare annotation is: false [2019-10-22 11:24:24,966 INFO L439 ceAbstractionStarter]: At program point L3072(lines 3071 3073) the Hoare annotation is: false [2019-10-22 11:24:24,966 INFO L439 ceAbstractionStarter]: At program point L2147-3(lines 2138 2150) the Hoare annotation is: false [2019-10-22 11:24:24,966 INFO L439 ceAbstractionStarter]: At program point L2147-2(lines 2138 2150) the Hoare annotation is: false [2019-10-22 11:24:24,966 INFO L446 ceAbstractionStarter]: At program point L2015(lines 2014 2017) the Hoare annotation is: true [2019-10-22 11:24:24,966 INFO L446 ceAbstractionStarter]: At program point L2015-1(lines 2014 2017) the Hoare annotation is: true [2019-10-22 11:24:24,966 INFO L446 ceAbstractionStarter]: At program point L2015-2(lines 2014 2017) the Hoare annotation is: true [2019-10-22 11:24:24,966 INFO L446 ceAbstractionStarter]: At program point L2015-3(lines 2014 2017) the Hoare annotation is: true [2019-10-22 11:24:24,966 INFO L446 ceAbstractionStarter]: At program point L2015-4(lines 2014 2017) the Hoare annotation is: true [2019-10-22 11:24:24,966 INFO L443 ceAbstractionStarter]: For program point L2809(line 2809) no Hoare annotation was computed. [2019-10-22 11:24:25,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:24:25 BoogieIcfgContainer [2019-10-22 11:24:25,028 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:24:25,028 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:24:25,028 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:24:25,028 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:24:25,029 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:17" (3/4) ... [2019-10-22 11:24:25,032 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:24:25,060 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 159 nodes and edges [2019-10-22 11:24:25,062 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 65 nodes and edges [2019-10-22 11:24:25,064 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-10-22 11:24:25,066 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 11:24:25,068 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:24:25,069 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 11:24:25,071 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 11:24:25,107 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result + 16 <= 0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) || (((firsterr + 12 <= 0 && \result + 12 <= 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) [2019-10-22 11:24:25,109 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-10-22 11:24:25,110 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-10-22 11:24:25,110 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-10-22 11:24:25,110 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-10-22 11:24:25,111 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-10-22 11:24:25,115 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-10-22 11:24:25,115 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-10-22 11:24:25,116 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-10-22 11:24:25,273 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_87cb553e-cfc9-4b01-952a-90573b5188cf/bin/utaipan/witness.graphml [2019-10-22 11:24:25,273 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:24:25,275 INFO L168 Benchmark]: Toolchain (without parser) took 11593.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.1 MB). Free memory was 944.5 MB in the beginning and 964.8 MB in the end (delta: -20.2 MB). Peak memory consumption was 284.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:25,275 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:25,276 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1043.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -134.4 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:25,276 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:25,276 INFO L168 Benchmark]: Boogie Preprocessor took 132.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:25,277 INFO L168 Benchmark]: RCFGBuilder took 2401.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -19.3 MB). Peak memory consumption was 205.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:25,277 INFO L168 Benchmark]: TraceAbstraction took 7638.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.1 MB). Peak memory consumption was 411.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:25,277 INFO L168 Benchmark]: Witness Printer took 245.60 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 964.8 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:25,279 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1043.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -134.4 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 127.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 132.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2401.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -19.3 MB). Peak memory consumption was 205.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7638.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.1 MB). Peak memory consumption was 411.3 MB. Max. memory is 11.5 GB. * Witness Printer took 245.60 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 964.8 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2009]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2009]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2009]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2009]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2009]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 3034]: Loop Invariant Derived loop invariant: (((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0 - InvariantResult [Line: 1874]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0 - InvariantResult [Line: 2077]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 3034]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 3056]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3034]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3064]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3075]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2452]: Loop Invariant Derived loop invariant: (0 == tmp___0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2891]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2984]: Loop Invariant Derived loop invariant: (((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2891]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2270]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2891]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2882]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2379]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 2891]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2379]: Loop Invariant Derived loop invariant: (((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0 - InvariantResult [Line: 2379]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2592]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2270]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2891]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2270]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2109]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2931]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2092]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2410]: Loop Invariant Derived loop invariant: ((\result + 16 <= 0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) || (((firsterr + 12 <= 0 && \result + 12 <= 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) - InvariantResult [Line: 2931]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2931]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2992]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 3000]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1964]: Loop Invariant Derived loop invariant: (((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2931]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2858]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1964]: Loop Invariant Derived loop invariant: (((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1964]: Loop Invariant Derived loop invariant: (((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2858]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2931]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2119]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2858]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2109]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2931]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2092]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2379]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2379]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2379]: Loop Invariant Derived loop invariant: (((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3041]: Loop Invariant Derived loop invariant: (0 == tmp___0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3052]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 3052]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 3008]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3052]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2169]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2014]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2866]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2842]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2083]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1947]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1947]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2014]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1947]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2014]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2014]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1947]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 1930]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2866]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1864]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1930]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2866]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1930]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3038]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2083]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2014]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2866]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 3071]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2605]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1930]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2357]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2974]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 2952]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2974]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1882]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2974]: Loop Invariant Derived loop invariant: (((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0 - InvariantResult [Line: 1882]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 1882]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2974]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2974]: Loop Invariant Derived loop invariant: (((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0 - InvariantResult [Line: 1924]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1924]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2974]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 2996]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2261]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2270]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2270]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2270]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 3004]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2178]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1924]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2971]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2261]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2452]: Loop Invariant Derived loop invariant: (0 == tmp___0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2971]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2924]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2261]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2924]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2178]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1924]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 339 locations, 5 error locations. Result: SAFE, OverallTime: 7.4s, OverallIterations: 12, TraceHistogramMax: 4, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, HoareTripleCheckerStatistics: 5754 SDtfs, 3718 SDslu, 4677 SDs, 0 SdLazy, 192 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5386occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 1630 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 152 LocationsWithAnnotation, 152 PreInvPairs, 553 NumberOfFragments, 2091 HoareAnnotationTreeSize, 152 FomulaSimplifications, 7228 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 152 FomulaSimplificationsInter, 411 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 605 NumberOfCodeBlocks, 605 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 593 ConstructedInterpolants, 0 QuantifiedInterpolants, 49703 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 94/94 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...