./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point_true-unreach-call.cil.out.i --full-output --architecture 64bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 0ed9222f
Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point_true-unreach-call.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) )
--witnessprinter.graph.data.producer Automizer --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-0ed9222-m
[2019-01-15 14:59:16,567 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2019-01-15 14:59:16,568 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2019-01-15 14:59:16,590 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-01-15 14:59:16,591 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-01-15 14:59:16,592 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-01-15 14:59:16,593 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-01-15 14:59:16,595 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2019-01-15 14:59:16,596 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-01-15 14:59:16,597 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-01-15 14:59:16,598 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-01-15 14:59:16,598 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-01-15 14:59:16,599 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-01-15 14:59:16,600 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-01-15 14:59:16,601 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-01-15 14:59:16,602 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-01-15 14:59:16,603 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-01-15 14:59:16,605 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-01-15 14:59:16,607 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2019-01-15 14:59:16,609 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-01-15 14:59:16,610 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-01-15 14:59:16,611 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-01-15 14:59:16,614 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-01-15 14:59:16,614 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-01-15 14:59:16,615 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-01-15 14:59:16,616 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-01-15 14:59:16,617 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-01-15 14:59:16,618 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-01-15 14:59:16,619 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2019-01-15 14:59:16,620 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-01-15 14:59:16,620 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2019-01-15 14:59:16,621 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-01-15 14:59:16,621 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-01-15 14:59:16,622 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values
[2019-01-15 14:59:16,623 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2019-01-15 14:59:16,624 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2019-01-15 14:59:16,624 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2019-01-15 14:59:16,639 INFO L110 SettingsManager]: Loading preferences was successful
[2019-01-15 14:59:16,640 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2019-01-15 14:59:16,641 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-01-15 14:59:16,641 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2019-01-15 14:59:16,641 INFO L133 SettingsManager]: * Use SBE=true
[2019-01-15 14:59:16,641 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-01-15 14:59:16,641 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2019-01-15 14:59:16,642 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2019-01-15 14:59:16,642 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2019-01-15 14:59:16,642 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-01-15 14:59:16,642 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2019-01-15 14:59:16,642 INFO L133 SettingsManager]: * Check if freed pointer was valid=false
[2019-01-15 14:59:16,643 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2019-01-15 14:59:16,643 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-01-15 14:59:16,643 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2019-01-15 14:59:16,643 INFO L133 SettingsManager]: * To the following directory=./dump/
[2019-01-15 14:59:16,643 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2019-01-15 14:59:16,643 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-01-15 14:59:16,644 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-01-15 14:59:16,644 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2019-01-15 14:59:16,644 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-01-15 14:59:16,644 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2019-01-15 14:59:16,644 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2019-01-15 14:59:16,644 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-01-15 14:59:16,645 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-01-15 14:59:16,645 INFO L133 SettingsManager]: * To the following directory=dump/
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> daceda4fb3bf12a25eb56ddc650ae304c7e70427
[2019-01-15 14:59:16,689 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2019-01-15 14:59:16,706 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-01-15 14:59:16,710 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-01-15 14:59:16,712 INFO L271 PluginConnector]: Initializing CDTParser...
[2019-01-15 14:59:16,712 INFO L276 PluginConnector]: CDTParser initialized
[2019-01-15 14:59:16,713 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point_true-unreach-call.cil.out.i
[2019-01-15 14:59:16,778 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c05918273/0138e767b6ae4dcba510928606af515a/FLAG9eb6ea250
[2019-01-15 14:59:17,419 INFO L307 CDTParser]: Found 1 translation units.
[2019-01-15 14:59:17,420 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point_true-unreach-call.cil.out.i
[2019-01-15 14:59:17,455 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c05918273/0138e767b6ae4dcba510928606af515a/FLAG9eb6ea250
[2019-01-15 14:59:17,544 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c05918273/0138e767b6ae4dcba510928606af515a
[2019-01-15 14:59:17,548 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-01-15 14:59:17,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2019-01-15 14:59:17,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-01-15 14:59:17,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-01-15 14:59:17,554 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2019-01-15 14:59:17,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.01 02:59:17" (1/1) ...
[2019-01-15 14:59:17,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21f7ebfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:59:17, skipping insertion in model container
[2019-01-15 14:59:17,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.01 02:59:17" (1/1) ...
[2019-01-15 14:59:17,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2019-01-15 14:59:17,640 INFO L176 MainTranslator]: Built tables and reachable declarations
[2019-01-15 14:59:18,060 WARN L1127 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1753]
[2019-01-15 14:59:18,061 WARN L1127 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-01-15 14:59:18,532 INFO L208 PostProcessor]: Analyzing one entry point: main
[2019-01-15 14:59:18,566 INFO L191 MainTranslator]: Completed pre-run
[2019-01-15 14:59:18,635 WARN L1127 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1753]
[2019-01-15 14:59:18,636 WARN L1127 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-01-15 14:59:18,734 INFO L208 PostProcessor]: Analyzing one entry point: main
[2019-01-15 14:59:18,822 INFO L195 MainTranslator]: Completed translation
[2019-01-15 14:59:18,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:59:18 WrapperNode
[2019-01-15 14:59:18,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-01-15 14:59:18,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2019-01-15 14:59:18,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2019-01-15 14:59:18,824 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized
[2019-01-15 14:59:18,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:59:18" (1/1) ...
[2019-01-15 14:59:18,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:59:18" (1/1) ...
[2019-01-15 14:59:18,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2019-01-15 14:59:18,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-01-15 14:59:18,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2019-01-15 14:59:18,958 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2019-01-15 14:59:18,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:59:18" (1/1) ...
[2019-01-15 14:59:18,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:59:18" (1/1) ...
[2019-01-15 14:59:18,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:59:18" (1/1) ...
[2019-01-15 14:59:18,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:59:18" (1/1) ...
[2019-01-15 14:59:19,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:59:18" (1/1) ...
[2019-01-15 14:59:19,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:59:18" (1/1) ...
[2019-01-15 14:59:19,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:59:18" (1/1) ...
[2019-01-15 14:59:19,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-01-15 14:59:19,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-01-15 14:59:19,098 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2019-01-15 14:59:19,098 INFO L276 PluginConnector]: RCFGBuilder initialized
[2019-01-15 14:59:19,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:59:18" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory: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-01-15 14:59:19,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2019-01-15 14:59:19,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2019-01-15 14:59:19,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2019-01-15 14:59:19,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2019-01-15 14:59:19,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2019-01-15 14:59:19,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2019-01-15 14:59:19,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2019-01-15 14:59:19,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2019-01-15 14:59:19,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2019-01-15 14:59:19,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-01-15 14:59:19,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-01-15 14:59:23,353 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-01-15 14:59:23,356 INFO L286 CfgBuilder]: Removed 344 assue(true) statements.
[2019-01-15 14:59:23,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.01 02:59:23 BoogieIcfgContainer
[2019-01-15 14:59:23,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-01-15 14:59:23,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-01-15 14:59:23,361 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2019-01-15 14:59:23,365 INFO L276 PluginConnector]: TraceAbstraction initialized
[2019-01-15 14:59:23,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.01 02:59:17" (1/3) ...
[2019-01-15 14:59:23,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab8c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.01 02:59:23, skipping insertion in model container
[2019-01-15 14:59:23,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:59:18" (2/3) ...
[2019-01-15 14:59:23,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab8c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.01 02:59:23, skipping insertion in model container
[2019-01-15 14:59:23,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.01 02:59:23" (3/3) ...
[2019-01-15 14:59:23,370 INFO L112 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point_true-unreach-call.cil.out.i
[2019-01-15 14:59:23,382 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-01-15 14:59:23,393 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations.
[2019-01-15 14:59:23,410 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2019-01-15 14:59:23,445 INFO L133 ementStrategyFactory]: Using default assertion order modulation
[2019-01-15 14:59:23,446 INFO L382 AbstractCegarLoop]: Interprodecural is true
[2019-01-15 14:59:23,446 INFO L383 AbstractCegarLoop]: Hoare is true
[2019-01-15 14:59:23,446 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-01-15 14:59:23,446 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-01-15 14:59:23,446 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-01-15 14:59:23,446 INFO L387 AbstractCegarLoop]: Difference is false
[2019-01-15 14:59:23,447 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-01-15 14:59:23,447 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-01-15 14:59:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states.
[2019-01-15 14:59:23,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2019-01-15 14:59:23,481 INFO L394 BasicCegarLoop]: Found error trace
[2019-01-15 14:59:23,483 INFO L402 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-01-15 14:59:23,486 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-01-15 14:59:23,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-01-15 14:59:23,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1585262438, now seen corresponding path program 1 times
[2019-01-15 14:59:23,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-01-15 14:59:23,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-01-15 14:59:23,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:23,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-01-15 14:59:23,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-01-15 14:59:23,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-01-15 14:59:23,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-01-15 14:59:23,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-01-15 14:59:23,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-01-15 14:59:23,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-01-15 14:59:23,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-01-15 14:59:24,002 INFO L87 Difference]: Start difference. First operand 339 states. Second operand 3 states.
[2019-01-15 14:59:24,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-01-15 14:59:24,464 INFO L93 Difference]: Finished difference Result 800 states and 1168 transitions.
[2019-01-15 14:59:24,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-01-15 14:59:24,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22
[2019-01-15 14:59:24,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-01-15 14:59:24,485 INFO L225 Difference]: With dead ends: 800
[2019-01-15 14:59:24,485 INFO L226 Difference]: Without dead ends: 436
[2019-01-15 14:59:24,491 INFO L631 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-01-15 14:59:24,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states.
[2019-01-15 14:59:24,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436.
[2019-01-15 14:59:24,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states.
[2019-01-15 14:59:24,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 626 transitions.
[2019-01-15 14:59:24,578 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 626 transitions. Word has length 22
[2019-01-15 14:59:24,579 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-01-15 14:59:24,579 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 626 transitions.
[2019-01-15 14:59:24,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-01-15 14:59:24,579 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 626 transitions.
[2019-01-15 14:59:24,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2019-01-15 14:59:24,583 INFO L394 BasicCegarLoop]: Found error trace
[2019-01-15 14:59:24,583 INFO L402 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-01-15 14:59:24,583 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-01-15 14:59:24,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-01-15 14:59:24,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1758242877, now seen corresponding path program 1 times
[2019-01-15 14:59:24,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-01-15 14:59:24,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-01-15 14:59:24,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:24,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-01-15 14:59:24,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-01-15 14:59:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-01-15 14:59:24,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-01-15 14:59:24,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-01-15 14:59:24,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-01-15 14:59:24,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-01-15 14:59:24,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-01-15 14:59:24,795 INFO L87 Difference]: Start difference. First operand 436 states and 626 transitions. Second operand 3 states.
[2019-01-15 14:59:24,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-01-15 14:59:24,863 INFO L93 Difference]: Finished difference Result 857 states and 1231 transitions.
[2019-01-15 14:59:24,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-01-15 14:59:24,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27
[2019-01-15 14:59:24,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-01-15 14:59:24,872 INFO L225 Difference]: With dead ends: 857
[2019-01-15 14:59:24,873 INFO L226 Difference]: Without dead ends: 436
[2019-01-15 14:59:24,880 INFO L631 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-01-15 14:59:24,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states.
[2019-01-15 14:59:24,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436.
[2019-01-15 14:59:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states.
[2019-01-15 14:59:24,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 625 transitions.
[2019-01-15 14:59:24,926 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 625 transitions. Word has length 27
[2019-01-15 14:59:24,927 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-01-15 14:59:24,927 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 625 transitions.
[2019-01-15 14:59:24,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-01-15 14:59:24,927 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 625 transitions.
[2019-01-15 14:59:24,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2019-01-15 14:59:24,931 INFO L394 BasicCegarLoop]: Found error trace
[2019-01-15 14:59:24,931 INFO L402 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-01-15 14:59:24,931 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-01-15 14:59:24,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-01-15 14:59:24,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1832620089, now seen corresponding path program 1 times
[2019-01-15 14:59:24,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-01-15 14:59:24,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-01-15 14:59:24,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:24,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-01-15 14:59:24,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-01-15 14:59:25,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-01-15 14:59:25,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-01-15 14:59:25,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-01-15 14:59:25,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-01-15 14:59:25,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-01-15 14:59:25,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-01-15 14:59:25,139 INFO L87 Difference]: Start difference. First operand 436 states and 625 transitions. Second operand 3 states.
[2019-01-15 14:59:25,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-01-15 14:59:25,492 INFO L93 Difference]: Finished difference Result 824 states and 1196 transitions.
[2019-01-15 14:59:25,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-01-15 14:59:25,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30
[2019-01-15 14:59:25,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-01-15 14:59:25,499 INFO L225 Difference]: With dead ends: 824
[2019-01-15 14:59:25,499 INFO L226 Difference]: Without dead ends: 804
[2019-01-15 14:59:25,500 INFO L631 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-01-15 14:59:25,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states.
[2019-01-15 14:59:25,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804.
[2019-01-15 14:59:25,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states.
[2019-01-15 14:59:25,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1174 transitions.
[2019-01-15 14:59:25,547 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1174 transitions. Word has length 30
[2019-01-15 14:59:25,548 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-01-15 14:59:25,548 INFO L480 AbstractCegarLoop]: Abstraction has 804 states and 1174 transitions.
[2019-01-15 14:59:25,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-01-15 14:59:25,549 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1174 transitions.
[2019-01-15 14:59:25,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2019-01-15 14:59:25,552 INFO L394 BasicCegarLoop]: Found error trace
[2019-01-15 14:59:25,553 INFO L402 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-01-15 14:59:25,553 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-01-15 14:59:25,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-01-15 14:59:25,553 INFO L82 PathProgramCache]: Analyzing trace with hash -903827168, now seen corresponding path program 1 times
[2019-01-15 14:59:25,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-01-15 14:59:25,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-01-15 14:59:25,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:25,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-01-15 14:59:25,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-01-15 14:59:25,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-01-15 14:59:25,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-01-15 14:59:25,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-01-15 14:59:25,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-01-15 14:59:25,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-01-15 14:59:25,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-01-15 14:59:25,678 INFO L87 Difference]: Start difference. First operand 804 states and 1174 transitions. Second operand 3 states.
[2019-01-15 14:59:25,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-01-15 14:59:25,954 INFO L93 Difference]: Finished difference Result 2228 states and 3254 transitions.
[2019-01-15 14:59:25,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-01-15 14:59:25,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37
[2019-01-15 14:59:25,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-01-15 14:59:25,963 INFO L225 Difference]: With dead ends: 2228
[2019-01-15 14:59:25,963 INFO L226 Difference]: Without dead ends: 1439
[2019-01-15 14:59:25,965 INFO L631 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-01-15 14:59:25,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states.
[2019-01-15 14:59:26,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1419.
[2019-01-15 14:59:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states.
[2019-01-15 14:59:26,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2080 transitions.
[2019-01-15 14:59:26,029 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2080 transitions. Word has length 37
[2019-01-15 14:59:26,030 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-01-15 14:59:26,030 INFO L480 AbstractCegarLoop]: Abstraction has 1419 states and 2080 transitions.
[2019-01-15 14:59:26,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-01-15 14:59:26,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2080 transitions.
[2019-01-15 14:59:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2019-01-15 14:59:26,033 INFO L394 BasicCegarLoop]: Found error trace
[2019-01-15 14:59:26,033 INFO L402 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-01-15 14:59:26,034 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-01-15 14:59:26,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-01-15 14:59:26,034 INFO L82 PathProgramCache]: Analyzing trace with hash -2039646367, now seen corresponding path program 1 times
[2019-01-15 14:59:26,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-01-15 14:59:26,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-01-15 14:59:26,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:26,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-01-15 14:59:26,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-01-15 14:59:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-01-15 14:59:26,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-01-15 14:59:26,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-01-15 14:59:26,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-01-15 14:59:26,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-01-15 14:59:26,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-01-15 14:59:26,154 INFO L87 Difference]: Start difference. First operand 1419 states and 2080 transitions. Second operand 3 states.
[2019-01-15 14:59:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-01-15 14:59:26,668 INFO L93 Difference]: Finished difference Result 3925 states and 5752 transitions.
[2019-01-15 14:59:26,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-01-15 14:59:26,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41
[2019-01-15 14:59:26,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-01-15 14:59:26,687 INFO L225 Difference]: With dead ends: 3925
[2019-01-15 14:59:26,687 INFO L226 Difference]: Without dead ends: 2521
[2019-01-15 14:59:26,692 INFO L631 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-01-15 14:59:26,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2521 states.
[2019-01-15 14:59:26,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2521 to 2501.
[2019-01-15 14:59:26,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2501 states.
[2019-01-15 14:59:26,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 3668 transitions.
[2019-01-15 14:59:26,859 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 3668 transitions. Word has length 41
[2019-01-15 14:59:26,859 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-01-15 14:59:26,860 INFO L480 AbstractCegarLoop]: Abstraction has 2501 states and 3668 transitions.
[2019-01-15 14:59:26,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-01-15 14:59:26,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3668 transitions.
[2019-01-15 14:59:26,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2019-01-15 14:59:26,865 INFO L394 BasicCegarLoop]: Found error trace
[2019-01-15 14:59:26,866 INFO L402 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-01-15 14:59:26,867 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-01-15 14:59:26,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-01-15 14:59:26,867 INFO L82 PathProgramCache]: Analyzing trace with hash 2049870071, now seen corresponding path program 1 times
[2019-01-15 14:59:26,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-01-15 14:59:26,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-01-15 14:59:26,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:26,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-01-15 14:59:26,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-01-15 14:59:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2019-01-15 14:59:27,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-01-15 14:59:27,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-01-15 14:59:27,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-01-15 14:59:27,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-01-15 14:59:27,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-01-15 14:59:27,041 INFO L87 Difference]: Start difference. First operand 2501 states and 3668 transitions. Second operand 3 states.
[2019-01-15 14:59:27,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-01-15 14:59:27,381 INFO L93 Difference]: Finished difference Result 6405 states and 9442 transitions.
[2019-01-15 14:59:27,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-01-15 14:59:27,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42
[2019-01-15 14:59:27,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-01-15 14:59:27,418 INFO L225 Difference]: With dead ends: 6405
[2019-01-15 14:59:27,419 INFO L226 Difference]: Without dead ends: 3919
[2019-01-15 14:59:27,426 INFO L631 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-01-15 14:59:27,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states.
[2019-01-15 14:59:27,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 2509.
[2019-01-15 14:59:27,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2509 states.
[2019-01-15 14:59:27,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3676 transitions.
[2019-01-15 14:59:27,658 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3676 transitions. Word has length 42
[2019-01-15 14:59:27,658 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-01-15 14:59:27,659 INFO L480 AbstractCegarLoop]: Abstraction has 2509 states and 3676 transitions.
[2019-01-15 14:59:27,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-01-15 14:59:27,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3676 transitions.
[2019-01-15 14:59:27,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2019-01-15 14:59:27,663 INFO L394 BasicCegarLoop]: Found error trace
[2019-01-15 14:59:27,664 INFO L402 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-01-15 14:59:27,665 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-01-15 14:59:27,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-01-15 14:59:27,665 INFO L82 PathProgramCache]: Analyzing trace with hash -2104548615, now seen corresponding path program 1 times
[2019-01-15 14:59:27,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-01-15 14:59:27,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-01-15 14:59:27,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:27,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-01-15 14:59:27,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-01-15 14:59:27,875 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2019-01-15 14:59:27,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-01-15 14:59:27,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-01-15 14:59:27,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-01-15 14:59:27,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-01-15 14:59:27,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-01-15 14:59:27,876 INFO L87 Difference]: Start difference. First operand 2509 states and 3676 transitions. Second operand 4 states.
[2019-01-15 14:59:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-01-15 14:59:28,555 INFO L93 Difference]: Finished difference Result 5027 states and 7363 transitions.
[2019-01-15 14:59:28,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-01-15 14:59:28,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42
[2019-01-15 14:59:28,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-01-15 14:59:28,576 INFO L225 Difference]: With dead ends: 5027
[2019-01-15 14:59:28,577 INFO L226 Difference]: Without dead ends: 2485
[2019-01-15 14:59:28,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-01-15 14:59:28,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states.
[2019-01-15 14:59:28,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2477.
[2019-01-15 14:59:28,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2477 states.
[2019-01-15 14:59:28,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3620 transitions.
[2019-01-15 14:59:28,828 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3620 transitions. Word has length 42
[2019-01-15 14:59:28,829 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-01-15 14:59:28,829 INFO L480 AbstractCegarLoop]: Abstraction has 2477 states and 3620 transitions.
[2019-01-15 14:59:28,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-01-15 14:59:28,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3620 transitions.
[2019-01-15 14:59:28,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2019-01-15 14:59:28,835 INFO L394 BasicCegarLoop]: Found error trace
[2019-01-15 14:59:28,835 INFO L402 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-01-15 14:59:28,836 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-01-15 14:59:28,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-01-15 14:59:28,836 INFO L82 PathProgramCache]: Analyzing trace with hash -5070360, now seen corresponding path program 1 times
[2019-01-15 14:59:28,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-01-15 14:59:28,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-01-15 14:59:28,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:28,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-01-15 14:59:28,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-01-15 14:59:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-01-15 14:59:29,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-01-15 14:59:29,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-01-15 14:59:29,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-01-15 14:59:29,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-01-15 14:59:29,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-01-15 14:59:29,174 INFO L87 Difference]: Start difference. First operand 2477 states and 3620 transitions. Second operand 3 states.
[2019-01-15 14:59:30,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-01-15 14:59:30,135 INFO L93 Difference]: Finished difference Result 6135 states and 9006 transitions.
[2019-01-15 14:59:30,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-01-15 14:59:30,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65
[2019-01-15 14:59:30,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-01-15 14:59:30,160 INFO L225 Difference]: With dead ends: 6135
[2019-01-15 14:59:30,160 INFO L226 Difference]: Without dead ends: 3673
[2019-01-15 14:59:30,166 INFO L631 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-01-15 14:59:30,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3673 states.
[2019-01-15 14:59:30,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3673 to 3649.
[2019-01-15 14:59:30,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3649 states.
[2019-01-15 14:59:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 5326 transitions.
[2019-01-15 14:59:30,379 INFO L78 Accepts]: Start accepts. Automaton has 3649 states and 5326 transitions. Word has length 65
[2019-01-15 14:59:30,379 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-01-15 14:59:30,379 INFO L480 AbstractCegarLoop]: Abstraction has 3649 states and 5326 transitions.
[2019-01-15 14:59:30,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-01-15 14:59:30,379 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 5326 transitions.
[2019-01-15 14:59:30,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2019-01-15 14:59:30,383 INFO L394 BasicCegarLoop]: Found error trace
[2019-01-15 14:59:30,384 INFO L402 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-01-15 14:59:30,384 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-01-15 14:59:30,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-01-15 14:59:30,384 INFO L82 PathProgramCache]: Analyzing trace with hash 205782185, now seen corresponding path program 1 times
[2019-01-15 14:59:30,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-01-15 14:59:30,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-01-15 14:59:30,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:30,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-01-15 14:59:30,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-01-15 14:59:30,509 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-01-15 14:59:30,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-01-15 14:59:30,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-01-15 14:59:30,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-01-15 14:59:30,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-01-15 14:59:30,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-01-15 14:59:30,511 INFO L87 Difference]: Start difference. First operand 3649 states and 5326 transitions. Second operand 3 states.
[2019-01-15 14:59:31,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-01-15 14:59:31,496 INFO L93 Difference]: Finished difference Result 9046 states and 13264 transitions.
[2019-01-15 14:59:31,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-01-15 14:59:31,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69
[2019-01-15 14:59:31,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-01-15 14:59:31,523 INFO L225 Difference]: With dead ends: 9046
[2019-01-15 14:59:31,524 INFO L226 Difference]: Without dead ends: 5412
[2019-01-15 14:59:31,531 INFO L631 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-01-15 14:59:31,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5412 states.
[2019-01-15 14:59:31,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5412 to 5386.
[2019-01-15 14:59:31,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5386 states.
[2019-01-15 14:59:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5386 states to 5386 states and 7846 transitions.
[2019-01-15 14:59:31,818 INFO L78 Accepts]: Start accepts. Automaton has 5386 states and 7846 transitions. Word has length 69
[2019-01-15 14:59:31,818 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-01-15 14:59:31,818 INFO L480 AbstractCegarLoop]: Abstraction has 5386 states and 7846 transitions.
[2019-01-15 14:59:31,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-01-15 14:59:31,818 INFO L276 IsEmpty]: Start isEmpty. Operand 5386 states and 7846 transitions.
[2019-01-15 14:59:31,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2019-01-15 14:59:31,822 INFO L394 BasicCegarLoop]: Found error trace
[2019-01-15 14:59:31,822 INFO L402 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-01-15 14:59:31,823 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-01-15 14:59:31,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-01-15 14:59:31,823 INFO L82 PathProgramCache]: Analyzing trace with hash -775419092, now seen corresponding path program 1 times
[2019-01-15 14:59:31,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-01-15 14:59:31,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-01-15 14:59:31,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:31,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-01-15 14:59:31,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-01-15 14:59:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2019-01-15 14:59:32,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-01-15 14:59:32,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-01-15 14:59:32,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-01-15 14:59:32,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-01-15 14:59:32,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-01-15 14:59:32,112 INFO L87 Difference]: Start difference. First operand 5386 states and 7846 transitions. Second operand 5 states.
[2019-01-15 14:59:32,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-01-15 14:59:32,893 INFO L93 Difference]: Finished difference Result 11479 states and 16671 transitions.
[2019-01-15 14:59:32,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2019-01-15 14:59:32,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75
[2019-01-15 14:59:32,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-01-15 14:59:32,943 INFO L225 Difference]: With dead ends: 11479
[2019-01-15 14:59:32,943 INFO L226 Difference]: Without dead ends: 5451
[2019-01-15 14:59:32,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2019-01-15 14:59:32,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5451 states.
[2019-01-15 14:59:33,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5451 to 5329.
[2019-01-15 14:59:33,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5329 states.
[2019-01-15 14:59:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5329 states to 5329 states and 7739 transitions.
[2019-01-15 14:59:33,205 INFO L78 Accepts]: Start accepts. Automaton has 5329 states and 7739 transitions. Word has length 75
[2019-01-15 14:59:33,206 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-01-15 14:59:33,206 INFO L480 AbstractCegarLoop]: Abstraction has 5329 states and 7739 transitions.
[2019-01-15 14:59:33,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-01-15 14:59:33,206 INFO L276 IsEmpty]: Start isEmpty. Operand 5329 states and 7739 transitions.
[2019-01-15 14:59:33,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2019-01-15 14:59:33,214 INFO L394 BasicCegarLoop]: Found error trace
[2019-01-15 14:59:33,215 INFO L402 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-01-15 14:59:33,215 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-01-15 14:59:33,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-01-15 14:59:33,215 INFO L82 PathProgramCache]: Analyzing trace with hash 617278273, now seen corresponding path program 1 times
[2019-01-15 14:59:33,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-01-15 14:59:33,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-01-15 14:59:33,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:33,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-01-15 14:59:33,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-01-15 14:59:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2019-01-15 14:59:33,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-01-15 14:59:33,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-01-15 14:59:33,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-01-15 14:59:33,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-01-15 14:59:33,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-01-15 14:59:33,365 INFO L87 Difference]: Start difference. First operand 5329 states and 7739 transitions. Second operand 3 states.
[2019-01-15 14:59:33,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-01-15 14:59:33,577 INFO L93 Difference]: Finished difference Result 10607 states and 15403 transitions.
[2019-01-15 14:59:33,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-01-15 14:59:33,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77
[2019-01-15 14:59:33,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-01-15 14:59:33,597 INFO L225 Difference]: With dead ends: 10607
[2019-01-15 14:59:33,598 INFO L226 Difference]: Without dead ends: 5293
[2019-01-15 14:59:33,607 INFO L631 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-01-15 14:59:33,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5293 states.
[2019-01-15 14:59:33,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5293 to 5293.
[2019-01-15 14:59:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5293 states.
[2019-01-15 14:59:33,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5293 states to 5293 states and 7667 transitions.
[2019-01-15 14:59:33,823 INFO L78 Accepts]: Start accepts. Automaton has 5293 states and 7667 transitions. Word has length 77
[2019-01-15 14:59:33,824 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-01-15 14:59:33,824 INFO L480 AbstractCegarLoop]: Abstraction has 5293 states and 7667 transitions.
[2019-01-15 14:59:33,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-01-15 14:59:33,824 INFO L276 IsEmpty]: Start isEmpty. Operand 5293 states and 7667 transitions.
[2019-01-15 14:59:33,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2019-01-15 14:59:33,830 INFO L394 BasicCegarLoop]: Found error trace
[2019-01-15 14:59:33,830 INFO L402 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-01-15 14:59:33,830 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-01-15 14:59:33,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-01-15 14:59:33,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1018765701, now seen corresponding path program 1 times
[2019-01-15 14:59:33,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-01-15 14:59:33,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-01-15 14:59:33,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:33,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-01-15 14:59:33,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-01-15 14:59:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-01-15 14:59:34,030 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2019-01-15 14:59:34,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-01-15 14:59:34,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-01-15 14:59:34,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-01-15 14:59:34,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-01-15 14:59:34,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-01-15 14:59:34,032 INFO L87 Difference]: Start difference. First operand 5293 states and 7667 transitions. Second operand 4 states.
[2019-01-15 14:59:34,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-01-15 14:59:34,216 INFO L93 Difference]: Finished difference Result 5412 states and 7831 transitions.
[2019-01-15 14:59:34,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-01-15 14:59:34,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78
[2019-01-15 14:59:34,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-01-15 14:59:34,217 INFO L225 Difference]: With dead ends: 5412
[2019-01-15 14:59:34,217 INFO L226 Difference]: Without dead ends: 0
[2019-01-15 14:59:34,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-01-15 14:59:34,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2019-01-15 14:59:34,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2019-01-15 14:59:34,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2019-01-15 14:59:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2019-01-15 14:59:34,224 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78
[2019-01-15 14:59:34,224 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-01-15 14:59:34,225 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2019-01-15 14:59:34,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-01-15 14:59:34,225 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2019-01-15 14:59:34,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2019-01-15 14:59:34,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2019-01-15 14:59:34,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent.
[2019-01-15 14:59:34,641 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 22
[2019-01-15 14:59:34,782 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 16
[2019-01-15 14:59:34,995 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 22
[2019-01-15 14:59:35,149 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 16
[2019-01-15 14:59:35,301 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 20
[2019-01-15 14:59:35,962 WARN L181 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 20
[2019-01-15 14:59:37,193 INFO L451 ceAbstractionStarter]: At program point L1885(lines 1882 1887) the Hoare annotation is: true
[2019-01-15 14:59:37,194 INFO L444 ceAbstractionStarter]: At program point L1885-1(lines 1882 1887) the Hoare annotation is: (and (= 0 |ULTIMATE.start_kmalloc_#res.base|) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= 0 |ULTIMATE.start_kmalloc_#res.offset|) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,194 INFO L444 ceAbstractionStarter]: At program point L1885-2(lines 1882 1887) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,194 INFO L448 ceAbstractionStarter]: For program point L2810(lines 2810 2815) no Hoare annotation was computed.
[2019-01-15 14:59:37,194 INFO L444 ceAbstractionStarter]: At program point L3009(lines 3008 3010) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,194 INFO L448 ceAbstractionStarter]: For program point L2679(line 2679) no Hoare annotation was computed.
[2019-01-15 14:59:37,194 INFO L448 ceAbstractionStarter]: For program point L2283(lines 2283 2286) no Hoare annotation was computed.
[2019-01-15 14:59:37,194 INFO L448 ceAbstractionStarter]: For program point L2283-3(lines 2283 2286) no Hoare annotation was computed.
[2019-01-15 14:59:37,195 INFO L448 ceAbstractionStarter]: For program point L2283-2(lines 2283 2286) no Hoare annotation was computed.
[2019-01-15 14:59:37,197 INFO L448 ceAbstractionStarter]: For program point L2283-5(lines 2283 2286) no Hoare annotation was computed.
[2019-01-15 14:59:37,197 INFO L444 ceAbstractionStarter]: At program point L3076(lines 3075 3077) the Hoare annotation is: false
[2019-01-15 14:59:37,197 INFO L448 ceAbstractionStarter]: For program point L2283-6(lines 2283 2286) no Hoare annotation was computed.
[2019-01-15 14:59:37,197 INFO L448 ceAbstractionStarter]: For program point L2283-8(lines 2283 2286) no Hoare annotation was computed.
[2019-01-15 14:59:37,197 INFO L448 ceAbstractionStarter]: For program point L2680(lines 2680 2714) no Hoare annotation was computed.
[2019-01-15 14:59:37,198 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 2009) no Hoare annotation was computed.
[2019-01-15 14:59:37,198 INFO L448 ceAbstractionStarter]: For program point L1954(lines 1954 1961) no Hoare annotation was computed.
[2019-01-15 14:59:37,198 INFO L448 ceAbstractionStarter]: For program point L1954-1(lines 1954 1961) no Hoare annotation was computed.
[2019-01-15 14:59:37,198 INFO L448 ceAbstractionStarter]: For program point L1954-2(lines 1954 1961) no Hoare annotation was computed.
[2019-01-15 14:59:37,198 INFO L448 ceAbstractionStarter]: For program point L1954-3(lines 1954 1961) no Hoare annotation was computed.
[2019-01-15 14:59:37,198 INFO L444 ceAbstractionStarter]: At program point L2153-1(lines 2126 2159) the Hoare annotation is: false
[2019-01-15 14:59:37,198 INFO L448 ceAbstractionStarter]: For program point L2153(lines 2153 2156) no Hoare annotation was computed.
[2019-01-15 14:59:37,198 INFO L444 ceAbstractionStarter]: At program point L2153-3(lines 2126 2159) the Hoare annotation is: false
[2019-01-15 14:59:37,198 INFO L448 ceAbstractionStarter]: For program point L2153-2(lines 2153 2156) no Hoare annotation was computed.
[2019-01-15 14:59:37,198 INFO L444 ceAbstractionStarter]: At program point L2153-5(lines 2126 2159) the Hoare annotation is: false
[2019-01-15 14:59:37,199 INFO L448 ceAbstractionStarter]: For program point L2153-4(lines 2153 2156) no Hoare annotation was computed.
[2019-01-15 14:59:37,199 INFO L444 ceAbstractionStarter]: At program point L2153-7(lines 2126 2159) the Hoare annotation is: false
[2019-01-15 14:59:37,199 INFO L448 ceAbstractionStarter]: For program point L2153-6(lines 2153 2156) no Hoare annotation was computed.
[2019-01-15 14:59:37,199 INFO L448 ceAbstractionStarter]: For program point L2682(lines 2682 2711) no Hoare annotation was computed.
[2019-01-15 14:59:37,199 INFO L448 ceAbstractionStarter]: For program point L2484(lines 2484 2492) no Hoare annotation was computed.
[2019-01-15 14:59:37,199 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 2009) no Hoare annotation was computed.
[2019-01-15 14:59:37,199 INFO L448 ceAbstractionStarter]: For program point L2683(line 2683) no Hoare annotation was computed.
[2019-01-15 14:59:37,199 INFO L448 ceAbstractionStarter]: For program point L2485(lines 2485 2488) no Hoare annotation was computed.
[2019-01-15 14:59:37,199 INFO L448 ceAbstractionStarter]: For program point L2485-2(lines 2485 2488) no Hoare annotation was computed.
[2019-01-15 14:59:37,200 INFO L448 ceAbstractionStarter]: For program point L2287(lines 2287 2290) no Hoare annotation was computed.
[2019-01-15 14:59:37,200 INFO L448 ceAbstractionStarter]: For program point L2287-3(lines 2287 2290) no Hoare annotation was computed.
[2019-01-15 14:59:37,200 INFO L448 ceAbstractionStarter]: For program point L2287-2(lines 2287 2290) no Hoare annotation was computed.
[2019-01-15 14:59:37,200 INFO L448 ceAbstractionStarter]: For program point L2287-5(lines 2287 2290) no Hoare annotation was computed.
[2019-01-15 14:59:37,200 INFO L448 ceAbstractionStarter]: For program point L2287-6(lines 2287 2290) no Hoare annotation was computed.
[2019-01-15 14:59:37,200 INFO L448 ceAbstractionStarter]: For program point L2287-8(lines 2287 2290) no Hoare annotation was computed.
[2019-01-15 14:59:37,200 INFO L448 ceAbstractionStarter]: For program point L2684(lines 2684 2689) no Hoare annotation was computed.
[2019-01-15 14:59:37,200 INFO L448 ceAbstractionStarter]: For program point L2817(line 2817) no Hoare annotation was computed.
[2019-01-15 14:59:37,200 INFO L448 ceAbstractionStarter]: For program point L2751(line 2751) no Hoare annotation was computed.
[2019-01-15 14:59:37,200 INFO L448 ceAbstractionStarter]: For program point L2818(lines 2818 2823) no Hoare annotation was computed.
[2019-01-15 14:59:37,200 INFO L448 ceAbstractionStarter]: For program point L2752(lines 2752 2757) no Hoare annotation was computed.
[2019-01-15 14:59:37,201 INFO L448 ceAbstractionStarter]: For program point L2620(lines 2620 2834) no Hoare annotation was computed.
[2019-01-15 14:59:37,201 INFO L448 ceAbstractionStarter]: For program point L2554(lines 2554 2557) no Hoare annotation was computed.
[2019-01-15 14:59:37,201 INFO L448 ceAbstractionStarter]: For program point L2092(lines 2092 2105) no Hoare annotation was computed.
[2019-01-15 14:59:37,201 INFO L444 ceAbstractionStarter]: At program point L2092-2(lines 2083 2108) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,201 INFO L451 ceAbstractionStarter]: At program point L1960(lines 1947 1963) the Hoare annotation is: true
[2019-01-15 14:59:37,201 INFO L448 ceAbstractionStarter]: For program point L2092-3(lines 2092 2105) no Hoare annotation was computed.
[2019-01-15 14:59:37,201 INFO L444 ceAbstractionStarter]: At program point L1960-1(lines 1947 1963) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,202 INFO L444 ceAbstractionStarter]: At program point L1960-2(lines 1947 1963) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,202 INFO L444 ceAbstractionStarter]: At program point L2092-5(lines 2083 2108) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,202 INFO L444 ceAbstractionStarter]: At program point L1960-3(lines 1947 1963) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,202 INFO L448 ceAbstractionStarter]: For program point L2621(line 2621) no Hoare annotation was computed.
[2019-01-15 14:59:37,202 INFO L444 ceAbstractionStarter]: At program point L2886(lines 2882 2888) the Hoare annotation is: false
[2019-01-15 14:59:37,202 INFO L448 ceAbstractionStarter]: For program point L2622(lines 2622 2677) no Hoare annotation was computed.
[2019-01-15 14:59:37,202 INFO L451 ceAbstractionStarter]: At program point L2292(lines 2270 2308) the Hoare annotation is: true
[2019-01-15 14:59:37,202 INFO L444 ceAbstractionStarter]: At program point L2292-2(lines 2270 2308) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,203 INFO L444 ceAbstractionStarter]: At program point L2292-1(lines 2270 2308) the Hoare annotation is: (and (= 0 |ULTIMATE.start_kmalloc_#res.base|) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= 0 |ULTIMATE.start_kmalloc_#res.offset|) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,203 INFO L444 ceAbstractionStarter]: At program point L2953(lines 2952 2954) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,203 INFO L448 ceAbstractionStarter]: For program point L3086(lines 3086 3088) no Hoare annotation was computed.
[2019-01-15 14:59:37,203 INFO L448 ceAbstractionStarter]: For program point L3086-2(lines 3086 3088) no Hoare annotation was computed.
[2019-01-15 14:59:37,203 INFO L451 ceAbstractionStarter]: At program point L3086-1(lines 1 3088) the Hoare annotation is: true
[2019-01-15 14:59:37,203 INFO L448 ceAbstractionStarter]: For program point L3086-4(lines 3086 3088) no Hoare annotation was computed.
[2019-01-15 14:59:37,203 INFO L444 ceAbstractionStarter]: At program point L3086-3(lines 1 3088) the Hoare annotation is: (and (= 0 |ULTIMATE.start_kmalloc_#res.base|) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= 0 |ULTIMATE.start_kmalloc_#res.offset|) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,203 INFO L444 ceAbstractionStarter]: At program point L3086-5(lines 1 3088) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,203 INFO L448 ceAbstractionStarter]: For program point L2624(lines 2624 2674) no Hoare annotation was computed.
[2019-01-15 14:59:37,204 INFO L451 ceAbstractionStarter]: At program point L2294(lines 2270 2308) the Hoare annotation is: true
[2019-01-15 14:59:37,204 INFO L444 ceAbstractionStarter]: At program point L2294-2(lines 2270 2308) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,204 INFO L444 ceAbstractionStarter]: At program point L2294-1(lines 2270 2308) the Hoare annotation is: (and (= 0 |ULTIMATE.start_kmalloc_#res.base|) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= 0 |ULTIMATE.start_kmalloc_#res.offset|) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,204 INFO L448 ceAbstractionStarter]: For program point L2691(line 2691) no Hoare annotation was computed.
[2019-01-15 14:59:37,204 INFO L448 ceAbstractionStarter]: For program point L2625(line 2625) no Hoare annotation was computed.
[2019-01-15 14:59:37,204 INFO L444 ceAbstractionStarter]: At program point L2559(lines 2421 2581) the Hoare annotation is: false
[2019-01-15 14:59:37,204 INFO L448 ceAbstractionStarter]: For program point L2427(lines 2427 2431) no Hoare annotation was computed.
[2019-01-15 14:59:37,204 INFO L448 ceAbstractionStarter]: For program point L2427-2(lines 2421 2581) no Hoare annotation was computed.
[2019-01-15 14:59:37,204 INFO L444 ceAbstractionStarter]: At program point L2956(lines 1 3088) the Hoare annotation is: false
[2019-01-15 14:59:37,205 INFO L444 ceAbstractionStarter]: At program point L2956-2(lines 1 3088) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,205 INFO L444 ceAbstractionStarter]: At program point L2956-1(lines 1 3088) the Hoare annotation is: false
[2019-01-15 14:59:37,205 INFO L444 ceAbstractionStarter]: At program point L2956-4(lines 1 3088) the Hoare annotation is: false
[2019-01-15 14:59:37,205 INFO L444 ceAbstractionStarter]: At program point L2956-3(lines 1 3088) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,205 INFO L444 ceAbstractionStarter]: At program point L2956-5(lines 1 3088) the Hoare annotation is: false
[2019-01-15 14:59:37,205 INFO L448 ceAbstractionStarter]: For program point L2692(lines 2692 2707) no Hoare annotation was computed.
[2019-01-15 14:59:37,205 INFO L448 ceAbstractionStarter]: For program point L2626(lines 2626 2630) no Hoare annotation was computed.
[2019-01-15 14:59:37,205 INFO L448 ceAbstractionStarter]: For program point L2825(line 2825) no Hoare annotation was computed.
[2019-01-15 14:59:37,205 INFO L448 ceAbstractionStarter]: For program point L2759(line 2759) no Hoare annotation was computed.
[2019-01-15 14:59:37,206 INFO L444 ceAbstractionStarter]: At program point L2561(lines 2421 2581) the Hoare annotation is: false
[2019-01-15 14:59:37,206 INFO L448 ceAbstractionStarter]: For program point L2760(lines 2760 2765) no Hoare annotation was computed.
[2019-01-15 14:59:37,206 INFO L448 ceAbstractionStarter]: For program point L2694(lines 2694 2700) no Hoare annotation was computed.
[2019-01-15 14:59:37,206 INFO L448 ceAbstractionStarter]: For program point L2694-2(lines 2692 2706) no Hoare annotation was computed.
[2019-01-15 14:59:37,206 INFO L451 ceAbstractionStarter]: At program point L2364-2(lines 1 3088) the Hoare annotation is: true
[2019-01-15 14:59:37,206 INFO L444 ceAbstractionStarter]: At program point L2364-6(lines 2357 2366) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,206 INFO L448 ceAbstractionStarter]: For program point L2100(lines 2100 2103) no Hoare annotation was computed.
[2019-01-15 14:59:37,206 INFO L444 ceAbstractionStarter]: At program point L2364-9(lines 1 3088) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,207 INFO L448 ceAbstractionStarter]: For program point L2100-1(lines 2100 2103) no Hoare annotation was computed.
[2019-01-15 14:59:37,207 INFO L444 ceAbstractionStarter]: At program point L2101-1(lines 2092 2104) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,207 INFO L444 ceAbstractionStarter]: At program point L2101(lines 2092 2104) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,207 INFO L448 ceAbstractionStarter]: For program point L2894(lines 2894 2897) no Hoare annotation was computed.
[2019-01-15 14:59:37,207 INFO L448 ceAbstractionStarter]: For program point L2894-2(lines 2894 2897) no Hoare annotation was computed.
[2019-01-15 14:59:37,207 INFO L448 ceAbstractionStarter]: For program point L2894-4(lines 2894 2897) no Hoare annotation was computed.
[2019-01-15 14:59:37,207 INFO L448 ceAbstractionStarter]: For program point L2894-6(lines 2894 2897) no Hoare annotation was computed.
[2019-01-15 14:59:37,207 INFO L448 ceAbstractionStarter]: For program point L2894-8(lines 2894 2897) no Hoare annotation was computed.
[2019-01-15 14:59:37,207 INFO L448 ceAbstractionStarter]: For program point L2564(lines 2564 2574) no Hoare annotation was computed.
[2019-01-15 14:59:37,208 INFO L444 ceAbstractionStarter]: At program point L2564-2(lines 1 3088) the Hoare annotation is: false
[2019-01-15 14:59:37,208 INFO L448 ceAbstractionStarter]: For program point L2300(line 2300) no Hoare annotation was computed.
[2019-01-15 14:59:37,208 INFO L448 ceAbstractionStarter]: For program point L2300-2(lines 2299 2301) no Hoare annotation was computed.
[2019-01-15 14:59:37,208 INFO L448 ceAbstractionStarter]: For program point L2300-3(line 2300) no Hoare annotation was computed.
[2019-01-15 14:59:37,208 INFO L448 ceAbstractionStarter]: For program point L2300-6(line 2300) no Hoare annotation was computed.
[2019-01-15 14:59:37,208 INFO L448 ceAbstractionStarter]: For program point L2300-5(lines 2299 2301) no Hoare annotation was computed.
[2019-01-15 14:59:37,208 INFO L448 ceAbstractionStarter]: For program point L2300-8(lines 2299 2301) no Hoare annotation was computed.
[2019-01-15 14:59:37,208 INFO L444 ceAbstractionStarter]: At program point L2499(lines 2421 2581) the Hoare annotation is: false
[2019-01-15 14:59:37,208 INFO L448 ceAbstractionStarter]: For program point L2301-1(line 2301) no Hoare annotation was computed.
[2019-01-15 14:59:37,208 INFO L448 ceAbstractionStarter]: For program point L2301-3(line 2301) no Hoare annotation was computed.
[2019-01-15 14:59:37,208 INFO L448 ceAbstractionStarter]: For program point L2301-5(line 2301) no Hoare annotation was computed.
[2019-01-15 14:59:37,209 INFO L448 ceAbstractionStarter]: For program point L1971(lines 1971 1978) no Hoare annotation was computed.
[2019-01-15 14:59:37,209 INFO L444 ceAbstractionStarter]: At program point L2962(lines 2842 2849) the Hoare annotation is: false
[2019-01-15 14:59:37,209 INFO L448 ceAbstractionStarter]: For program point L1971-1(lines 1971 1978) no Hoare annotation was computed.
[2019-01-15 14:59:37,209 INFO L448 ceAbstractionStarter]: For program point L1971-2(lines 1971 1978) no Hoare annotation was computed.
[2019-01-15 14:59:37,209 INFO L448 ceAbstractionStarter]: For program point L2632(line 2632) no Hoare annotation was computed.
[2019-01-15 14:59:37,209 INFO L448 ceAbstractionStarter]: For program point L2633(lines 2633 2637) no Hoare annotation was computed.
[2019-01-15 14:59:37,209 INFO L448 ceAbstractionStarter]: For program point L2633-2(lines 2624 2674) no Hoare annotation was computed.
[2019-01-15 14:59:37,209 INFO L444 ceAbstractionStarter]: At program point L2501(lines 2421 2581) the Hoare annotation is: false
[2019-01-15 14:59:37,209 INFO L451 ceAbstractionStarter]: At program point L2303-1(lines 2261 2309) the Hoare annotation is: true
[2019-01-15 14:59:37,210 INFO L448 ceAbstractionStarter]: For program point L2303(lines 2303 2306) no Hoare annotation was computed.
[2019-01-15 14:59:37,210 INFO L444 ceAbstractionStarter]: At program point L2303-3(lines 2261 2309) the Hoare annotation is: (and (= 0 |ULTIMATE.start_kmalloc_#res.base|) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= 0 |ULTIMATE.start_kmalloc_#res.offset|) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,210 INFO L448 ceAbstractionStarter]: For program point L2303-2(lines 2303 2306) no Hoare annotation was computed.
[2019-01-15 14:59:37,210 INFO L444 ceAbstractionStarter]: At program point L2303-5(lines 2261 2309) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,210 INFO L448 ceAbstractionStarter]: For program point L2303-4(lines 2303 2306) no Hoare annotation was computed.
[2019-01-15 14:59:37,210 INFO L448 ceAbstractionStarter]: For program point L2832(line 2832) no Hoare annotation was computed.
[2019-01-15 14:59:37,210 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed.
[2019-01-15 14:59:37,210 INFO L444 ceAbstractionStarter]: At program point L2965-1(lines 1 3088) the Hoare annotation is: false
[2019-01-15 14:59:37,210 INFO L444 ceAbstractionStarter]: At program point L2965-2(lines 1 3088) the Hoare annotation is: false
[2019-01-15 14:59:37,211 INFO L448 ceAbstractionStarter]: For program point L2767(line 2767) no Hoare annotation was computed.
[2019-01-15 14:59:37,211 INFO L448 ceAbstractionStarter]: For program point L2569(lines 2569 2572) no Hoare annotation was computed.
[2019-01-15 14:59:37,211 INFO L444 ceAbstractionStarter]: At program point L2570(lines 1 3088) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= ~ldv_spin~0 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,211 INFO L448 ceAbstractionStarter]: For program point L2504(lines 2504 2511) no Hoare annotation was computed.
[2019-01-15 14:59:37,211 INFO L448 ceAbstractionStarter]: For program point L2504-2(lines 2421 2581) no Hoare annotation was computed.
[2019-01-15 14:59:37,211 INFO L444 ceAbstractionStarter]: At program point L2835(lines 2605 2840) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,211 INFO L451 ceAbstractionStarter]: At program point L2703(lines 1 3088) the Hoare annotation is: true
[2019-01-15 14:59:37,211 INFO L444 ceAbstractionStarter]: At program point L2175(lines 2169 2177) the Hoare annotation is: false
[2019-01-15 14:59:37,211 INFO L444 ceAbstractionStarter]: At program point L1977(lines 1964 1980) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0))
[2019-01-15 14:59:37,212 INFO L444 ceAbstractionStarter]: At program point L2968(lines 2858 2865) the Hoare annotation is: false
[2019-01-15 14:59:37,212 INFO L444 ceAbstractionStarter]: At program point L1977-1(lines 1964 1980) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0))
[2019-01-15 14:59:37,212 INFO L444 ceAbstractionStarter]: At program point L1977-2(lines 1964 1980) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0))
[2019-01-15 14:59:37,212 INFO L444 ceAbstractionStarter]: At program point L2968-2(lines 2858 2865) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,212 INFO L444 ceAbstractionStarter]: At program point L2968-1(lines 2858 2865) the Hoare annotation is: false
[2019-01-15 14:59:37,212 INFO L448 ceAbstractionStarter]: For program point L2506(lines 2506 2509) no Hoare annotation was computed.
[2019-01-15 14:59:37,212 INFO L444 ceAbstractionStarter]: At program point L3035-1(lines 3034 3036) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,212 INFO L444 ceAbstractionStarter]: At program point L3035(lines 3034 3036) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= (+ ~nwriters_stress~0 1) 0))
[2019-01-15 14:59:37,213 INFO L444 ceAbstractionStarter]: At program point L3035-2(lines 3034 3036) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= ~ldv_spin~0 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,213 INFO L448 ceAbstractionStarter]: For program point L2441(lines 2441 2444) no Hoare annotation was computed.
[2019-01-15 14:59:37,213 INFO L448 ceAbstractionStarter]: For program point L2375-1(lines 2375 2378) no Hoare annotation was computed.
[2019-01-15 14:59:37,213 INFO L448 ceAbstractionStarter]: For program point L2375(lines 2375 2378) no Hoare annotation was computed.
[2019-01-15 14:59:37,213 INFO L448 ceAbstractionStarter]: For program point L2375-2(lines 2375 2378) no Hoare annotation was computed.
[2019-01-15 14:59:37,213 INFO L444 ceAbstractionStarter]: At program point L2112(lines 1 3088) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,213 INFO L444 ceAbstractionStarter]: At program point L2112-2(lines 2109 2114) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,213 INFO L444 ceAbstractionStarter]: At program point L2112-1(lines 2109 2114) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,213 INFO L451 ceAbstractionStarter]: At program point L2839(lines 2592 2841) the Hoare annotation is: true
[2019-01-15 14:59:37,214 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed.
[2019-01-15 14:59:37,214 INFO L444 ceAbstractionStarter]: At program point L-1-2(line -1) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0))
[2019-01-15 14:59:37,214 INFO L444 ceAbstractionStarter]: At program point L2972(lines 2971 2973) the Hoare annotation is: false
[2019-01-15 14:59:37,214 INFO L448 ceAbstractionStarter]: For program point L-1-3(line -1) no Hoare annotation was computed.
[2019-01-15 14:59:37,214 INFO L444 ceAbstractionStarter]: At program point L-1-5(line -1) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0))
[2019-01-15 14:59:37,214 INFO L444 ceAbstractionStarter]: At program point L2972-1(lines 2971 2973) the Hoare annotation is: false
[2019-01-15 14:59:37,214 INFO L448 ceAbstractionStarter]: For program point L-1-6(line -1) no Hoare annotation was computed.
[2019-01-15 14:59:37,214 INFO L444 ceAbstractionStarter]: At program point L-1-8(line -1) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0))
[2019-01-15 14:59:37,214 INFO L448 ceAbstractionStarter]: For program point L2774(line 2774) no Hoare annotation was computed.
[2019-01-15 14:59:37,215 INFO L448 ceAbstractionStarter]: For program point L-1-9(line -1) no Hoare annotation was computed.
[2019-01-15 14:59:37,215 INFO L448 ceAbstractionStarter]: For program point L-1-10(line -1) no Hoare annotation was computed.
[2019-01-15 14:59:37,215 INFO L448 ceAbstractionStarter]: For program point L-1-11(line -1) no Hoare annotation was computed.
[2019-01-15 14:59:37,215 INFO L448 ceAbstractionStarter]: For program point L-1-12(line -1) no Hoare annotation was computed.
[2019-01-15 14:59:37,215 INFO L444 ceAbstractionStarter]: At program point L3039(lines 3038 3040) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,215 INFO L448 ceAbstractionStarter]: For program point L2775(lines 2775 2830) no Hoare annotation was computed.
[2019-01-15 14:59:37,215 INFO L448 ceAbstractionStarter]: For program point L2709(line 2709) no Hoare annotation was computed.
[2019-01-15 14:59:37,215 INFO L448 ceAbstractionStarter]: For program point L2379(lines 2379 2393) no Hoare annotation was computed.
[2019-01-15 14:59:37,215 INFO L448 ceAbstractionStarter]: For program point L2379-3(lines 2379 2393) no Hoare annotation was computed.
[2019-01-15 14:59:37,215 INFO L448 ceAbstractionStarter]: For program point L2379-2(lines 2379 2393) no Hoare annotation was computed.
[2019-01-15 14:59:37,215 INFO L448 ceAbstractionStarter]: For program point L2379-5(lines 2379 2393) no Hoare annotation was computed.
[2019-01-15 14:59:37,216 INFO L448 ceAbstractionStarter]: For program point L2379-6(lines 2379 2393) no Hoare annotation was computed.
[2019-01-15 14:59:37,216 INFO L448 ceAbstractionStarter]: For program point L2379-8(lines 2379 2393) no Hoare annotation was computed.
[2019-01-15 14:59:37,216 INFO L448 ceAbstractionStarter]: For program point L2644(line 2644) no Hoare annotation was computed.
[2019-01-15 14:59:37,216 INFO L444 ceAbstractionStarter]: At program point L2446(lines 2421 2581) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,216 INFO L448 ceAbstractionStarter]: For program point L2512-1(lines 2421 2581) no Hoare annotation was computed.
[2019-01-15 14:59:37,216 INFO L444 ceAbstractionStarter]: At program point L2182(lines 2178 2184) the Hoare annotation is: false
[2019-01-15 14:59:37,216 INFO L444 ceAbstractionStarter]: At program point L2182-1(lines 2178 2184) the Hoare annotation is: false
[2019-01-15 14:59:37,216 INFO L444 ceAbstractionStarter]: At program point L2975-1(lines 2974 2976) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= (+ ~nwriters_stress~0 1) 0))
[2019-01-15 14:59:37,216 INFO L444 ceAbstractionStarter]: At program point L2975(lines 2974 2976) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= (+ ~nwriters_stress~0 1) 0))
[2019-01-15 14:59:37,217 INFO L444 ceAbstractionStarter]: At program point L2975-3(lines 2974 2976) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,217 INFO L444 ceAbstractionStarter]: At program point L2975-2(lines 2974 2976) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,217 INFO L444 ceAbstractionStarter]: At program point L2975-5(lines 2974 2976) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= ~ldv_spin~0 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,217 INFO L444 ceAbstractionStarter]: At program point L2975-4(lines 2974 2976) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= ~ldv_spin~0 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,217 INFO L448 ceAbstractionStarter]: For program point L2777(lines 2777 2827) no Hoare annotation was computed.
[2019-01-15 14:59:37,217 INFO L448 ceAbstractionStarter]: For program point L2645(lines 2645 2649) no Hoare annotation was computed.
[2019-01-15 14:59:37,217 INFO L448 ceAbstractionStarter]: For program point L2645-2(lines 2624 2674) no Hoare annotation was computed.
[2019-01-15 14:59:37,217 INFO L444 ceAbstractionStarter]: At program point L3042(lines 3041 3043) the Hoare annotation is: (and (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,217 INFO L448 ceAbstractionStarter]: For program point L2778(line 2778) no Hoare annotation was computed.
[2019-01-15 14:59:37,218 INFO L444 ceAbstractionStarter]: At program point L2580(lines 2410 2582) the Hoare annotation is: (let ((.cse0 (= (+ ~nwriters_stress~0 1) 0)) (.cse1 (= 1 ~ldv_state_variable_0~0))) (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-01-15 14:59:37,218 INFO L448 ceAbstractionStarter]: For program point L2514(lines 2514 2517) no Hoare annotation was computed.
[2019-01-15 14:59:37,218 INFO L444 ceAbstractionStarter]: At program point L2448(lines 2421 2581) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,218 INFO L448 ceAbstractionStarter]: For program point L2779(lines 2779 2783) no Hoare annotation was computed.
[2019-01-15 14:59:37,218 INFO L444 ceAbstractionStarter]: At program point L2451(lines 2421 2581) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,218 INFO L444 ceAbstractionStarter]: At program point L2385-1(lines 2379 2392) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,218 INFO L444 ceAbstractionStarter]: At program point L2385(lines 2379 2392) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= (+ ~nwriters_stress~0 1) 0))
[2019-01-15 14:59:37,219 INFO L448 ceAbstractionStarter]: For program point L2319-1(lines 2319 2323) no Hoare annotation was computed.
[2019-01-15 14:59:37,219 INFO L448 ceAbstractionStarter]: For program point L2319(lines 2319 2323) no Hoare annotation was computed.
[2019-01-15 14:59:37,219 INFO L444 ceAbstractionStarter]: At program point L2385-2(lines 2379 2392) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= ~ldv_spin~0 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,219 INFO L448 ceAbstractionStarter]: For program point L2319-2(lines 2319 2323) no Hoare annotation was computed.
[2019-01-15 14:59:37,219 INFO L448 ceAbstractionStarter]: For program point L2716(line 2716) no Hoare annotation was computed.
[2019-01-15 14:59:37,219 INFO L448 ceAbstractionStarter]: For program point L2717(lines 2717 2772) no Hoare annotation was computed.
[2019-01-15 14:59:37,219 INFO L444 ceAbstractionStarter]: At program point L2387-1(lines 2379 2392) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,219 INFO L444 ceAbstractionStarter]: At program point L2387(lines 2379 2392) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= (+ ~nwriters_stress~0 1) 0))
[2019-01-15 14:59:37,219 INFO L444 ceAbstractionStarter]: At program point L2387-2(lines 2379 2392) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= ~ldv_spin~0 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,220 INFO L444 ceAbstractionStarter]: At program point L2123(lines 2119 2125) the Hoare annotation is: false
[2019-01-15 14:59:37,220 INFO L448 ceAbstractionStarter]: For program point L2520-1(lines 2421 2581) no Hoare annotation was computed.
[2019-01-15 14:59:37,220 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 2009) no Hoare annotation was computed.
[2019-01-15 14:59:37,220 INFO L451 ceAbstractionStarter]: At program point L1926(lines 1924 1927) the Hoare annotation is: true
[2019-01-15 14:59:37,220 INFO L444 ceAbstractionStarter]: At program point L1926-1(lines 1924 1927) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,220 INFO L444 ceAbstractionStarter]: At program point L1926-2(lines 1924 1927) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,220 INFO L444 ceAbstractionStarter]: At program point L1926-3(lines 1924 1927) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,220 INFO L448 ceAbstractionStarter]: For program point L2785(line 2785) no Hoare annotation was computed.
[2019-01-15 14:59:37,220 INFO L448 ceAbstractionStarter]: For program point L2719(lines 2719 2769) no Hoare annotation was computed.
[2019-01-15 14:59:37,221 INFO L448 ceAbstractionStarter]: For program point L2786(lines 2786 2790) no Hoare annotation was computed.
[2019-01-15 14:59:37,221 INFO L448 ceAbstractionStarter]: For program point L2720(line 2720) no Hoare annotation was computed.
[2019-01-15 14:59:37,221 INFO L448 ceAbstractionStarter]: For program point L2786-2(lines 2777 2827) no Hoare annotation was computed.
[2019-01-15 14:59:37,221 INFO L448 ceAbstractionStarter]: For program point L2522(lines 2522 2525) no Hoare annotation was computed.
[2019-01-15 14:59:37,221 INFO L444 ceAbstractionStarter]: At program point L2985(lines 2984 2986) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0))
[2019-01-15 14:59:37,221 INFO L448 ceAbstractionStarter]: For program point L2721(lines 2721 2725) no Hoare annotation was computed.
[2019-01-15 14:59:37,221 INFO L448 ceAbstractionStarter]: For program point L2656(line 2656) no Hoare annotation was computed.
[2019-01-15 14:59:37,221 INFO L444 ceAbstractionStarter]: At program point L3053-1(lines 3052 3054) the Hoare annotation is: (and (= 0 |ULTIMATE.start_kmalloc_#res.base|) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= 0 |ULTIMATE.start_kmalloc_#res.offset|) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,221 INFO L451 ceAbstractionStarter]: At program point L3053(lines 3052 3054) the Hoare annotation is: true
[2019-01-15 14:59:37,222 INFO L444 ceAbstractionStarter]: At program point L3053-2(lines 3052 3054) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,222 INFO L448 ceAbstractionStarter]: For program point L2657(lines 2657 2662) no Hoare annotation was computed.
[2019-01-15 14:59:37,222 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 2009) no Hoare annotation was computed.
[2019-01-15 14:59:37,222 INFO L444 ceAbstractionStarter]: At program point L2460(lines 2452 2468) the Hoare annotation is: (and (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,222 INFO L444 ceAbstractionStarter]: At program point L2989(lines 2988 2990) the Hoare annotation is: false
[2019-01-15 14:59:37,222 INFO L444 ceAbstractionStarter]: At program point L2462(lines 2452 2468) the Hoare annotation is: (and (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,222 INFO L448 ceAbstractionStarter]: For program point L2528-1(lines 2528 2535) no Hoare annotation was computed.
[2019-01-15 14:59:37,222 INFO L444 ceAbstractionStarter]: At program point L3057(lines 3056 3058) the Hoare annotation is: false
[2019-01-15 14:59:37,223 INFO L448 ceAbstractionStarter]: For program point L2727(line 2727) no Hoare annotation was computed.
[2019-01-15 14:59:37,223 INFO L448 ceAbstractionStarter]: For program point L2397-1(lines 2397 2406) no Hoare annotation was computed.
[2019-01-15 14:59:37,223 INFO L448 ceAbstractionStarter]: For program point L2397(lines 2397 2406) no Hoare annotation was computed.
[2019-01-15 14:59:37,223 INFO L448 ceAbstractionStarter]: For program point L2397-2(lines 2397 2406) no Hoare annotation was computed.
[2019-01-15 14:59:37,223 INFO L451 ceAbstractionStarter]: At program point L1935(lines 1930 1937) the Hoare annotation is: true
[2019-01-15 14:59:37,223 INFO L444 ceAbstractionStarter]: At program point L1935-1(lines 1930 1937) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,223 INFO L444 ceAbstractionStarter]: At program point L1869(lines 1864 1871) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,223 INFO L444 ceAbstractionStarter]: At program point L1935-2(lines 1930 1937) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,224 INFO L444 ceAbstractionStarter]: At program point L1935-3(lines 1930 1937) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,224 INFO L448 ceAbstractionStarter]: For program point L2728(lines 2728 2732) no Hoare annotation was computed.
[2019-01-15 14:59:37,224 INFO L448 ceAbstractionStarter]: For program point L2728-2(lines 2719 2769) no Hoare annotation was computed.
[2019-01-15 14:59:37,224 INFO L448 ceAbstractionStarter]: For program point L2530(lines 2530 2533) no Hoare annotation was computed.
[2019-01-15 14:59:37,224 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed.
[2019-01-15 14:59:37,224 INFO L444 ceAbstractionStarter]: At program point L2993(lines 2992 2994) the Hoare annotation is: false
[2019-01-15 14:59:37,224 INFO L444 ceAbstractionStarter]: At program point L2928(lines 2924 2930) the Hoare annotation is: false
[2019-01-15 14:59:37,224 INFO L444 ceAbstractionStarter]: At program point L2928-1(lines 2924 2930) the Hoare annotation is: false
[2019-01-15 14:59:37,224 INFO L448 ceAbstractionStarter]: For program point L2664(line 2664) no Hoare annotation was computed.
[2019-01-15 14:59:37,224 INFO L444 ceAbstractionStarter]: At program point L3061-1(lines 3060 3062) the Hoare annotation is: false
[2019-01-15 14:59:37,225 INFO L444 ceAbstractionStarter]: At program point L3061(lines 3060 3062) the Hoare annotation is: false
[2019-01-15 14:59:37,225 INFO L444 ceAbstractionStarter]: At program point L3061-3(lines 3060 3062) the Hoare annotation is: false
[2019-01-15 14:59:37,225 INFO L444 ceAbstractionStarter]: At program point L3061-2(lines 3060 3062) the Hoare annotation is: false
[2019-01-15 14:59:37,225 INFO L444 ceAbstractionStarter]: At program point L3061-5(lines 3060 3062) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,225 INFO L444 ceAbstractionStarter]: At program point L3061-4(lines 3060 3062) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,225 INFO L444 ceAbstractionStarter]: At program point L3061-7(lines 3060 3062) the Hoare annotation is: false
[2019-01-15 14:59:37,225 INFO L444 ceAbstractionStarter]: At program point L3061-6(lines 3060 3062) the Hoare annotation is: false
[2019-01-15 14:59:37,225 INFO L444 ceAbstractionStarter]: At program point L3061-9(lines 3060 3062) the Hoare annotation is: false
[2019-01-15 14:59:37,225 INFO L448 ceAbstractionStarter]: For program point L2797(line 2797) no Hoare annotation was computed.
[2019-01-15 14:59:37,226 INFO L444 ceAbstractionStarter]: At program point L3061-8(lines 3060 3062) the Hoare annotation is: false
[2019-01-15 14:59:37,226 INFO L448 ceAbstractionStarter]: For program point L2665(lines 2665 2670) no Hoare annotation was computed.
[2019-01-15 14:59:37,226 INFO L448 ceAbstractionStarter]: For program point L2401-1(lines 2401 2405) no Hoare annotation was computed.
[2019-01-15 14:59:37,226 INFO L448 ceAbstractionStarter]: For program point L2401(lines 2401 2405) no Hoare annotation was computed.
[2019-01-15 14:59:37,226 INFO L448 ceAbstractionStarter]: For program point L2401-2(lines 2401 2405) no Hoare annotation was computed.
[2019-01-15 14:59:37,226 INFO L451 ceAbstractionStarter]: At program point L2005(lines 2891 2900) the Hoare annotation is: true
[2019-01-15 14:59:37,226 INFO L444 ceAbstractionStarter]: At program point L2005-1(lines 2891 2900) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,226 INFO L444 ceAbstractionStarter]: At program point L2005-2(lines 2891 2900) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,226 INFO L444 ceAbstractionStarter]: At program point L2005-3(lines 2891 2900) the Hoare annotation is: false
[2019-01-15 14:59:37,227 INFO L444 ceAbstractionStarter]: At program point L2005-4(lines 2891 2900) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,227 INFO L448 ceAbstractionStarter]: For program point L2798(lines 2798 2802) no Hoare annotation was computed.
[2019-01-15 14:59:37,227 INFO L448 ceAbstractionStarter]: For program point L2798-2(lines 2777 2827) no Hoare annotation was computed.
[2019-01-15 14:59:37,227 INFO L448 ceAbstractionStarter]: For program point L2138(lines 2138 2151) no Hoare annotation was computed.
[2019-01-15 14:59:37,227 INFO L448 ceAbstractionStarter]: For program point L2138-2(lines 2138 2151) no Hoare annotation was computed.
[2019-01-15 14:59:37,227 INFO L448 ceAbstractionStarter]: For program point L2138-3(lines 2138 2151) no Hoare annotation was computed.
[2019-01-15 14:59:37,227 INFO L448 ceAbstractionStarter]: For program point L2138-6(lines 2138 2151) no Hoare annotation was computed.
[2019-01-15 14:59:37,227 INFO L448 ceAbstractionStarter]: For program point L2138-5(lines 2138 2151) no Hoare annotation was computed.
[2019-01-15 14:59:37,227 INFO L444 ceAbstractionStarter]: At program point L2997(lines 2996 2998) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,227 INFO L448 ceAbstractionStarter]: For program point L2138-8(lines 2138 2151) no Hoare annotation was computed.
[2019-01-15 14:59:37,228 INFO L448 ceAbstractionStarter]: For program point L2138-9(lines 2138 2151) no Hoare annotation was computed.
[2019-01-15 14:59:37,228 INFO L448 ceAbstractionStarter]: For program point L2138-11(lines 2138 2151) no Hoare annotation was computed.
[2019-01-15 14:59:37,228 INFO L448 ceAbstractionStarter]: For program point L2470(lines 2470 2473) no Hoare annotation was computed.
[2019-01-15 14:59:37,228 INFO L448 ceAbstractionStarter]: For program point L2470-2(lines 2421 2581) no Hoare annotation was computed.
[2019-01-15 14:59:37,228 INFO L448 ceAbstractionStarter]: For program point L2008(line 2008) no Hoare annotation was computed.
[2019-01-15 14:59:37,228 INFO L444 ceAbstractionStarter]: At program point L3065(lines 3064 3066) the Hoare annotation is: false
[2019-01-15 14:59:37,228 INFO L448 ceAbstractionStarter]: For program point L2008-1(line 2008) no Hoare annotation was computed.
[2019-01-15 14:59:37,228 INFO L448 ceAbstractionStarter]: For program point L2008-2(line 2008) no Hoare annotation was computed.
[2019-01-15 14:59:37,228 INFO L448 ceAbstractionStarter]: For program point L2008-3(line 2008) no Hoare annotation was computed.
[2019-01-15 14:59:37,228 INFO L448 ceAbstractionStarter]: For program point L2008-4(line 2008) no Hoare annotation was computed.
[2019-01-15 14:59:37,228 INFO L448 ceAbstractionStarter]: For program point L2538(lines 2538 2546) no Hoare annotation was computed.
[2019-01-15 14:59:37,229 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed.
[2019-01-15 14:59:37,229 INFO L444 ceAbstractionStarter]: At program point L3001(lines 3000 3002) the Hoare annotation is: false
[2019-01-15 14:59:37,229 INFO L444 ceAbstractionStarter]: At program point L2935-1(lines 2931 2937) the Hoare annotation is: false
[2019-01-15 14:59:37,229 INFO L444 ceAbstractionStarter]: At program point L2935(lines 2931 2937) the Hoare annotation is: false
[2019-01-15 14:59:37,229 INFO L444 ceAbstractionStarter]: At program point L2935-3(lines 2931 2937) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,229 INFO L444 ceAbstractionStarter]: At program point L2935-2(lines 2931 2937) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,229 INFO L444 ceAbstractionStarter]: At program point L2935-5(lines 2931 2937) the Hoare annotation is: false
[2019-01-15 14:59:37,229 INFO L444 ceAbstractionStarter]: At program point L2935-4(lines 2931 2937) the Hoare annotation is: false
[2019-01-15 14:59:37,229 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2009) no Hoare annotation was computed.
[2019-01-15 14:59:37,230 INFO L448 ceAbstractionStarter]: For program point L2539(lines 2539 2542) no Hoare annotation was computed.
[2019-01-15 14:59:37,230 INFO L448 ceAbstractionStarter]: For program point L2539-2(lines 2539 2542) no Hoare annotation was computed.
[2019-01-15 14:59:37,230 INFO L444 ceAbstractionStarter]: At program point L1879(lines 1874 1881) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,230 INFO L448 ceAbstractionStarter]: For program point L2672(line 2672) no Hoare annotation was computed.
[2019-01-15 14:59:37,230 INFO L448 ceAbstractionStarter]: For program point L2474-1(lines 2474 2479) no Hoare annotation was computed.
[2019-01-15 14:59:37,230 INFO L444 ceAbstractionStarter]: At program point L2871-1(lines 2866 2873) the Hoare annotation is: (and (= 0 |ULTIMATE.start_kmalloc_#res.base|) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= 0 |ULTIMATE.start_kmalloc_#res.offset|) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,230 INFO L451 ceAbstractionStarter]: At program point L2871(lines 2866 2873) the Hoare annotation is: true
[2019-01-15 14:59:37,230 INFO L444 ceAbstractionStarter]: At program point L2871-3(lines 2866 2873) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,231 INFO L444 ceAbstractionStarter]: At program point L2871-2(lines 2866 2873) the Hoare annotation is: (and (= 0 |ULTIMATE.start_kmalloc_#res.base|) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= 0 |ULTIMATE.start_kmalloc_#res.offset|) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,231 INFO L448 ceAbstractionStarter]: For program point L2739(line 2739) no Hoare annotation was computed.
[2019-01-15 14:59:37,231 INFO L448 ceAbstractionStarter]: For program point L2740(lines 2740 2744) no Hoare annotation was computed.
[2019-01-15 14:59:37,231 INFO L448 ceAbstractionStarter]: For program point L2740-2(lines 2719 2769) no Hoare annotation was computed.
[2019-01-15 14:59:37,231 INFO L448 ceAbstractionStarter]: For program point L2278(lines 2278 2281) no Hoare annotation was computed.
[2019-01-15 14:59:37,231 INFO L448 ceAbstractionStarter]: For program point L2278-2(lines 2278 2281) no Hoare annotation was computed.
[2019-01-15 14:59:37,231 INFO L448 ceAbstractionStarter]: For program point L2146(lines 2146 2149) no Hoare annotation was computed.
[2019-01-15 14:59:37,231 INFO L448 ceAbstractionStarter]: For program point L2278-3(lines 2278 2281) no Hoare annotation was computed.
[2019-01-15 14:59:37,231 INFO L448 ceAbstractionStarter]: For program point L2278-6(lines 2278 2281) no Hoare annotation was computed.
[2019-01-15 14:59:37,231 INFO L448 ceAbstractionStarter]: For program point L2146-2(lines 2146 2149) no Hoare annotation was computed.
[2019-01-15 14:59:37,231 INFO L448 ceAbstractionStarter]: For program point L2146-1(lines 2146 2149) no Hoare annotation was computed.
[2019-01-15 14:59:37,232 INFO L448 ceAbstractionStarter]: For program point L2278-5(lines 2278 2281) no Hoare annotation was computed.
[2019-01-15 14:59:37,232 INFO L444 ceAbstractionStarter]: At program point L2080(lines 2077 2082) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= ~ldv_spin~0 0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0) (= 1 ~ldv_state_variable_0~0))
[2019-01-15 14:59:37,232 INFO L448 ceAbstractionStarter]: For program point L2278-8(lines 2278 2281) no Hoare annotation was computed.
[2019-01-15 14:59:37,232 INFO L448 ceAbstractionStarter]: For program point L2146-3(lines 2146 2149) no Hoare annotation was computed.
[2019-01-15 14:59:37,232 INFO L444 ceAbstractionStarter]: At program point L3005(lines 3004 3006) the Hoare annotation is: false
[2019-01-15 14:59:37,232 INFO L444 ceAbstractionStarter]: At program point L2147-1(lines 2138 2150) the Hoare annotation is: false
[2019-01-15 14:59:37,232 INFO L444 ceAbstractionStarter]: At program point L2147(lines 2138 2150) the Hoare annotation is: false
[2019-01-15 14:59:37,232 INFO L444 ceAbstractionStarter]: At program point L3072(lines 3071 3073) the Hoare annotation is: false
[2019-01-15 14:59:37,232 INFO L444 ceAbstractionStarter]: At program point L2147-3(lines 2138 2150) the Hoare annotation is: false
[2019-01-15 14:59:37,232 INFO L444 ceAbstractionStarter]: At program point L2147-2(lines 2138 2150) the Hoare annotation is: false
[2019-01-15 14:59:37,233 INFO L451 ceAbstractionStarter]: At program point L2015(lines 2014 2017) the Hoare annotation is: true
[2019-01-15 14:59:37,233 INFO L451 ceAbstractionStarter]: At program point L2015-1(lines 2014 2017) the Hoare annotation is: true
[2019-01-15 14:59:37,233 INFO L451 ceAbstractionStarter]: At program point L2015-2(lines 2014 2017) the Hoare annotation is: true
[2019-01-15 14:59:37,233 INFO L451 ceAbstractionStarter]: At program point L2015-3(lines 2014 2017) the Hoare annotation is: true
[2019-01-15 14:59:37,233 INFO L451 ceAbstractionStarter]: At program point L2015-4(lines 2014 2017) the Hoare annotation is: true
[2019-01-15 14:59:37,233 INFO L448 ceAbstractionStarter]: For program point L2809(line 2809) no Hoare annotation was computed.
[2019-01-15 14:59:37,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.01 02:59:37 BoogieIcfgContainer
[2019-01-15 14:59:37,321 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-01-15 14:59:37,322 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2019-01-15 14:59:37,322 INFO L271 PluginConnector]: Initializing Witness Printer...
[2019-01-15 14:59:37,322 INFO L276 PluginConnector]: Witness Printer initialized
[2019-01-15 14:59:37,322 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.01 02:59:23" (3/4) ...
[2019-01-15 14:59:37,329 INFO L144 WitnessPrinter]: Generating witness for correct program
[2019-01-15 14:59:37,394 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 159 nodes and edges
[2019-01-15 14:59:37,398 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 65 nodes and edges
[2019-01-15 14:59:37,400 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2019-01-15 14:59:37,404 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2019-01-15 14:59:37,407 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges
[2019-01-15 14:59:37,410 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2019-01-15 14:59:37,414 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2019-01-15 14:59:37,453 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result + 16 <= 0 && nwriters_stress + 1 == 0) && 1 == ldv_state_variable_0) || (((firsterr + 12 <= 0 && \result + 12 <= 0) && nwriters_stress + 1 == 0) && 1 == ldv_state_variable_0)
[2019-01-15 14:59:37,457 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == \result && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && 0 == \result) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
[2019-01-15 14:59:37,459 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == \result && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && 0 == \result) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
[2019-01-15 14:59:37,459 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == \result && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && 0 == \result) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
[2019-01-15 14:59:37,461 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == \result && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && 0 == \result) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
[2019-01-15 14:59:37,462 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == \result && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && 0 == \result) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
[2019-01-15 14:59:37,463 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == \result && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && 0 == \result) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
[2019-01-15 14:59:37,463 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == \result && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && 0 == \result) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
[2019-01-15 14:59:37,464 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == \result && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && 0 == \result) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
[2019-01-15 14:59:37,637 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2019-01-15 14:59:37,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2019-01-15 14:59:37,639 INFO L168 Benchmark]: Toolchain (without parser) took 20090.55 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 454.0 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -239.4 MB). Peak memory consumption was 214.7 MB. Max. memory is 11.5 GB.
[2019-01-15 14:59:37,640 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2019-01-15 14:59:37,641 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1272.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB.
[2019-01-15 14:59:37,641 INFO L168 Benchmark]: Boogie Procedure Inliner took 134.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB.
[2019-01-15 14:59:37,641 INFO L168 Benchmark]: Boogie Preprocessor took 139.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB.
[2019-01-15 14:59:37,642 INFO L168 Benchmark]: RCFGBuilder took 4261.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 875.7 MB in the end (delta: 203.9 MB). Peak memory consumption was 203.9 MB. Max. memory is 11.5 GB.
[2019-01-15 14:59:37,644 INFO L168 Benchmark]: TraceAbstraction took 13960.36 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 308.8 MB). Free memory was 875.7 MB in the beginning and 1.2 GB in the end (delta: -360.1 MB). Peak memory consumption was 252.5 MB. Max. memory is 11.5 GB.
[2019-01-15 14:59:37,644 INFO L168 Benchmark]: Witness Printer took 316.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 11.5 GB.
[2019-01-15 14:59:37,647 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB.
* CACSL2BoogieTranslator took 1272.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB.
* Boogie Procedure Inliner took 134.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB.
* Boogie Preprocessor took 139.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB.
* RCFGBuilder took 4261.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 875.7 MB in the end (delta: 203.9 MB). Peak memory consumption was 203.9 MB. Max. memory is 11.5 GB.
* TraceAbstraction took 13960.36 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 308.8 MB). Free memory was 875.7 MB in the beginning and 1.2 GB in the end (delta: -360.1 MB). Peak memory consumption was 252.5 MB. Max. memory is 11.5 GB.
* Witness Printer took 316.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 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: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 3034]: Loop Invariant
Derived loop invariant: (((firsterr + 12 <= 0 && ldv_spin == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 1874]: Loop Invariant
Derived loop invariant: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2421]: Loop Invariant
Derived loop invariant: 0
- InvariantResult [Line: 1]: Loop Invariant
Derived loop invariant: (((firsterr + 12 <= 0 && ldv_spin == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2077]: Loop Invariant
Derived loop invariant: ((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 3034]: Loop Invariant
Derived loop invariant: ldv_spin == 0 && nwriters_stress + 1 == 0
- InvariantResult [Line: 3056]: Loop Invariant
Derived loop invariant: 0
- InvariantResult [Line: 3034]: Loop Invariant
Derived loop invariant: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- 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: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2452]: Loop Invariant
Derived loop invariant: (nwriters_stress + 1 == 0 && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2891]: Loop Invariant
Derived loop invariant: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2984]: Loop Invariant
Derived loop invariant: (((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0
- InvariantResult [Line: 2891]: Loop Invariant
Derived loop invariant: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2270]: Loop Invariant
Derived loop invariant: ((firsterr + 12 <= 0 && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- 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: ldv_spin == 0 && nwriters_stress + 1 == 0
- InvariantResult [Line: 2891]: Loop Invariant
Derived loop invariant: ((firsterr + 12 <= 0 && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2379]: Loop Invariant
Derived loop invariant: (((firsterr + 12 <= 0 && ldv_spin == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2379]: Loop Invariant
Derived loop invariant: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- 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 == \result && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && 0 == \result) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2109]: Loop Invariant
Derived loop invariant: ((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2931]: Loop Invariant
Derived loop invariant: 0
- InvariantResult [Line: 2092]: Loop Invariant
Derived loop invariant: ((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2410]: Loop Invariant
Derived loop invariant: ((\result + 16 <= 0 && nwriters_stress + 1 == 0) && 1 == ldv_state_variable_0) || (((firsterr + 12 <= 0 && \result + 12 <= 0) && nwriters_stress + 1 == 0) && 1 == ldv_state_variable_0)
- InvariantResult [Line: 2931]: Loop Invariant
Derived loop invariant: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- 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: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- 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: (((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0
- 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: (((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0
- InvariantResult [Line: 1964]: Loop Invariant
Derived loop invariant: (((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0
- 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: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2109]: Loop Invariant
Derived loop invariant: ((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2931]: Loop Invariant
Derived loop invariant: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 1]: Loop Invariant
Derived loop invariant: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2092]: Loop Invariant
Derived loop invariant: ((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 1]: Loop Invariant
Derived loop invariant: 0
- InvariantResult [Line: 2379]: Loop Invariant
Derived loop invariant: ldv_spin == 0 && nwriters_stress + 1 == 0
- InvariantResult [Line: 1]: Loop Invariant
Derived loop invariant: ((firsterr + 12 <= 0 && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 1]: Loop Invariant
Derived loop invariant: 0
- InvariantResult [Line: 2379]: Loop Invariant
Derived loop invariant: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- 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 && ldv_spin == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 3060]: Loop Invariant
Derived loop invariant: 0
- InvariantResult [Line: 3041]: Loop Invariant
Derived loop invariant: (nwriters_stress + 1 == 0 && tmp___0 == 0) && 1 == ldv_state_variable_0
- 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 == \result && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && 0 == \result) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 3052]: Loop Invariant
Derived loop invariant: ((firsterr + 12 <= 0 && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 3008]: Loop Invariant
Derived loop invariant: ((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 3060]: Loop Invariant
Derived loop invariant: 0
- InvariantResult [Line: 3052]: Loop Invariant
Derived loop invariant: (((((((((0 == \result && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && 0 == \result) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- 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 && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- 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: ((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 1947]: Loop Invariant
Derived loop invariant: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- 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: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2014]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 3060]: Loop Invariant
Derived loop invariant: ((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && 1 == ldv_state_variable_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: ((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 1947]: Loop Invariant
Derived loop invariant: ((firsterr + 12 <= 0 && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 1930]: Loop Invariant
Derived loop invariant: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- 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: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 1930]: Loop Invariant
Derived loop invariant: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2866]: Loop Invariant
Derived loop invariant: (((((((((0 == \result && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && 0 == \result) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 1930]: Loop Invariant
Derived loop invariant: ((firsterr + 12 <= 0 && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2138]: Loop Invariant
Derived loop invariant: 0
- InvariantResult [Line: 3038]: Loop Invariant
Derived loop invariant: ((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2083]: Loop Invariant
Derived loop invariant: ((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && 1 == ldv_state_variable_0
- 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 == \result && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && 0 == \result) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 3071]: Loop Invariant
Derived loop invariant: 0
- InvariantResult [Line: 2605]: Loop Invariant
Derived loop invariant: ((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 1]: Loop Invariant
Derived loop invariant: ((firsterr + 12 <= 0 && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 1]: Loop Invariant
Derived loop invariant: ((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && 1 == ldv_state_variable_0
- 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: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 1]: Loop Invariant
Derived loop invariant: 0
- InvariantResult [Line: 1]: Loop Invariant
Derived loop invariant: ((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2974]: Loop Invariant
Derived loop invariant: ldv_spin == 0 && nwriters_stress + 1 == 0
- InvariantResult [Line: 2952]: Loop Invariant
Derived loop invariant: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2974]: Loop Invariant
Derived loop invariant: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 1882]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 2974]: Loop Invariant
Derived loop invariant: (((firsterr + 12 <= 0 && ldv_spin == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 1882]: Loop Invariant
Derived loop invariant: ((firsterr + 12 <= 0 && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 1882]: Loop Invariant
Derived loop invariant: (((((((((0 == \result && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && 0 == \result) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2974]: Loop Invariant
Derived loop invariant: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 1]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 2974]: Loop Invariant
Derived loop invariant: (((firsterr + 12 <= 0 && ldv_spin == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 1924]: Loop Invariant
Derived loop invariant: ((firsterr + 12 <= 0 && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: -1]: Loop Invariant
Derived loop invariant: (((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0
- InvariantResult [Line: 1924]: Loop Invariant
Derived loop invariant: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: -1]: Loop Invariant
Derived loop invariant: (((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0
- InvariantResult [Line: 2974]: Loop Invariant
Derived loop invariant: ldv_spin == 0 && nwriters_stress + 1 == 0
- InvariantResult [Line: 2996]: Loop Invariant
Derived loop invariant: ((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2261]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 2270]: Loop Invariant
Derived loop invariant: (((((((((0 == \result && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && 0 == \result) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2270]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 2270]: Loop Invariant
Derived loop invariant: ((firsterr + 12 <= 0 && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- 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: (((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0
- InvariantResult [Line: 2261]: Loop Invariant
Derived loop invariant: (((((((((0 == \result && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && 0 == \result) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- InvariantResult [Line: 2452]: Loop Invariant
Derived loop invariant: (nwriters_stress + 1 == 0 && tmp___0 == 0) && 1 == ldv_state_variable_0
- 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 && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- 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: (((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && onoff_interval == 0) && ldv_spin == 0) && lwsa == 0) && nwriters_stress + 1 == 0) && tmp___0 == 0) && 1 == ldv_state_variable_0
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 339 locations, 5 error locations. SAFE Result, 13.7s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 2.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 5754 SDtfs, 3718 SDslu, 4677 SDs, 0 SdLazy, 192 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 1630 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 152 LocationsWithAnnotation, 152 PreInvPairs, 553 NumberOfFragments, 2091 HoareAnnotationTreeSize, 152 FomulaSimplifications, 7235 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 152 FomulaSimplificationsInter, 446 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.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, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be correct!
Received shutdown request...