./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3f6cb80c-085a-440c-8c70-25bd77012a03/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3f6cb80c-085a-440c-8c70-25bd77012a03/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3f6cb80c-085a-440c-8c70-25bd77012a03/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3f6cb80c-085a-440c-8c70-25bd77012a03/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3f6cb80c-085a-440c-8c70-25bd77012a03/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3f6cb80c-085a-440c-8c70-25bd77012a03/bin/uautomizer --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 822df095b5a1e0602f483fa9dd28340391e98426 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:44:44,259 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:44:44,261 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:44:44,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:44:44,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:44:44,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:44:44,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:44:44,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:44:44,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:44:44,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:44:44,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:44:44,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:44:44,281 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:44:44,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:44:44,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:44:44,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:44:44,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:44:44,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:44:44,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:44:44,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:44:44,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:44:44,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:44:44,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:44:44,292 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:44:44,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:44:44,295 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:44:44,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:44:44,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:44:44,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:44:44,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:44:44,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:44:44,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:44:44,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:44:44,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:44:44,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:44:44,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:44:44,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:44:44,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:44:44,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:44:44,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:44:44,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:44:44,303 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3f6cb80c-085a-440c-8c70-25bd77012a03/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-11-16 00:44:44,316 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:44:44,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:44:44,317 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:44:44,318 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:44:44,318 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:44:44,318 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:44:44,319 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:44:44,319 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:44:44,319 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:44:44,319 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:44:44,320 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:44:44,320 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:44:44,320 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:44:44,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:44:44,321 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:44:44,321 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:44:44,321 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:44:44,321 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:44:44,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:44:44,322 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:44:44,322 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:44:44,322 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:44:44,323 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:44:44,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:44:44,323 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:44:44,323 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:44:44,323 INFO L138 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_3f6cb80c-085a-440c-8c70-25bd77012a03/bin/uautomizer 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 -> 822df095b5a1e0602f483fa9dd28340391e98426 [2019-11-16 00:44:44,349 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:44:44,358 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:44:44,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:44:44,364 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:44:44,364 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:44:44,365 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3f6cb80c-085a-440c-8c70-25bd77012a03/bin/uautomizer/../../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2019-11-16 00:44:44,416 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f6cb80c-085a-440c-8c70-25bd77012a03/bin/uautomizer/data/0900691e8/324fd407892e4be7bab0cb7b06ab8a9f/FLAG78379ec60 [2019-11-16 00:44:44,960 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:44:44,962 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3f6cb80c-085a-440c-8c70-25bd77012a03/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2019-11-16 00:44:44,990 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f6cb80c-085a-440c-8c70-25bd77012a03/bin/uautomizer/data/0900691e8/324fd407892e4be7bab0cb7b06ab8a9f/FLAG78379ec60 [2019-11-16 00:44:45,220 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3f6cb80c-085a-440c-8c70-25bd77012a03/bin/uautomizer/data/0900691e8/324fd407892e4be7bab0cb7b06ab8a9f [2019-11-16 00:44:45,222 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:44:45,223 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:44:45,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:44:45,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:44:45,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:44:45,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:44:45" (1/1) ... [2019-11-16 00:44:45,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd6f9b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:45, skipping insertion in model container [2019-11-16 00:44:45,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:44:45" (1/1) ... [2019-11-16 00:44:45,236 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:44:45,307 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:44:45,678 WARN L1068 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1753] [2019-11-16 00:44:45,679 WARN L1068 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1754-1755] [2019-11-16 00:44:46,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:44:46,095 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:44:46,158 WARN L1068 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1753] [2019-11-16 00:44:46,159 WARN L1068 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1754-1755] [2019-11-16 00:44:46,255 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:44:46,331 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:44:46,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:46 WrapperNode [2019-11-16 00:44:46,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:44:46,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:44:46,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:44:46,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:44:46,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:46" (1/1) ... [2019-11-16 00:44:46,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:46" (1/1) ... [2019-11-16 00:44:46,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:44:46,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:44:46,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:44:46,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:44:46,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:46" (1/1) ... [2019-11-16 00:44:46,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:46" (1/1) ... [2019-11-16 00:44:46,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:46" (1/1) ... [2019-11-16 00:44:46,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:46" (1/1) ... [2019-11-16 00:44:46,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:46" (1/1) ... [2019-11-16 00:44:46,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:46" (1/1) ... [2019-11-16 00:44:46,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:46" (1/1) ... [2019-11-16 00:44:46,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:44:46,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:44:46,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:44:46,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:44:46,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f6cb80c-085a-440c-8c70-25bd77012a03/bin/uautomizer/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-11-16 00:44:46,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:44:46,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:44:46,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:44:46,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:44:46,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:44:46,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:44:46,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:44:46,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-16 00:44:46,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-16 00:44:46,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:44:46,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:44:49,167 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:44:49,168 INFO L284 CfgBuilder]: Removed 344 assume(true) statements. [2019-11-16 00:44:49,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:44:49 BoogieIcfgContainer [2019-11-16 00:44:49,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:44:49,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:44:49,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:44:49,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:44:49,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:44:45" (1/3) ... [2019-11-16 00:44:49,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273d7e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:44:49, skipping insertion in model container [2019-11-16 00:44:49,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:46" (2/3) ... [2019-11-16 00:44:49,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273d7e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:44:49, skipping insertion in model container [2019-11-16 00:44:49,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:44:49" (3/3) ... [2019-11-16 00:44:49,176 INFO L109 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2019-11-16 00:44:49,185 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:44:49,193 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-16 00:44:49,203 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-16 00:44:49,228 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:44:49,228 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:44:49,228 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:44:49,228 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:44:49,228 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:44:49,229 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:44:49,229 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:44:49,229 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:44:49,257 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states. [2019-11-16 00:44:49,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-16 00:44:49,271 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:49,272 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:49,276 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:49,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:49,282 INFO L82 PathProgramCache]: Analyzing trace with hash -608431788, now seen corresponding path program 1 times [2019-11-16 00:44:49,337 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:49,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770378545] [2019-11-16 00:44:49,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:49,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:49,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:49,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770378545] [2019-11-16 00:44:49,793 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:49,793 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:44:49,793 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404150554] [2019-11-16 00:44:49,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:44:49,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:49,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:44:49,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:49,817 INFO L87 Difference]: Start difference. First operand 336 states. Second operand 3 states. [2019-11-16 00:44:50,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:50,099 INFO L93 Difference]: Finished difference Result 797 states and 1162 transitions. [2019-11-16 00:44:50,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:44:50,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-16 00:44:50,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:50,125 INFO L225 Difference]: With dead ends: 797 [2019-11-16 00:44:50,125 INFO L226 Difference]: Without dead ends: 433 [2019-11-16 00:44:50,134 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:50,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-11-16 00:44:50,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2019-11-16 00:44:50,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-16 00:44:50,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 620 transitions. [2019-11-16 00:44:50,228 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 620 transitions. Word has length 22 [2019-11-16 00:44:50,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:50,229 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 620 transitions. [2019-11-16 00:44:50,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:44:50,229 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 620 transitions. [2019-11-16 00:44:50,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-16 00:44:50,236 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:50,236 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:50,237 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:50,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:50,237 INFO L82 PathProgramCache]: Analyzing trace with hash 164474749, now seen corresponding path program 1 times [2019-11-16 00:44:50,237 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:50,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441092453] [2019-11-16 00:44:50,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:50,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:50,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:50,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:50,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441092453] [2019-11-16 00:44:50,371 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:50,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:44:50,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255453629] [2019-11-16 00:44:50,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:44:50,373 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:50,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:44:50,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:50,373 INFO L87 Difference]: Start difference. First operand 433 states and 620 transitions. Second operand 3 states. [2019-11-16 00:44:50,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:50,393 INFO L93 Difference]: Finished difference Result 854 states and 1225 transitions. [2019-11-16 00:44:50,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:44:50,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-16 00:44:50,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:50,396 INFO L225 Difference]: With dead ends: 854 [2019-11-16 00:44:50,396 INFO L226 Difference]: Without dead ends: 433 [2019-11-16 00:44:50,398 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:50,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-11-16 00:44:50,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2019-11-16 00:44:50,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-16 00:44:50,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 619 transitions. [2019-11-16 00:44:50,414 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 619 transitions. Word has length 27 [2019-11-16 00:44:50,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:50,414 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 619 transitions. [2019-11-16 00:44:50,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:44:50,415 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 619 transitions. [2019-11-16 00:44:50,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-16 00:44:50,416 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:50,416 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:50,416 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:50,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:50,417 INFO L82 PathProgramCache]: Analyzing trace with hash -915481931, now seen corresponding path program 1 times [2019-11-16 00:44:50,417 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:50,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382037906] [2019-11-16 00:44:50,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:50,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:50,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:50,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382037906] [2019-11-16 00:44:50,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:50,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:44:50,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445440965] [2019-11-16 00:44:50,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:44:50,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:50,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:44:50,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:50,497 INFO L87 Difference]: Start difference. First operand 433 states and 619 transitions. Second operand 3 states. [2019-11-16 00:44:50,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:50,570 INFO L93 Difference]: Finished difference Result 821 states and 1190 transitions. [2019-11-16 00:44:50,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:44:50,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-16 00:44:50,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:50,575 INFO L225 Difference]: With dead ends: 821 [2019-11-16 00:44:50,575 INFO L226 Difference]: Without dead ends: 801 [2019-11-16 00:44:50,576 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:50,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-11-16 00:44:50,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2019-11-16 00:44:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2019-11-16 00:44:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1168 transitions. [2019-11-16 00:44:50,610 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1168 transitions. Word has length 30 [2019-11-16 00:44:50,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:50,611 INFO L462 AbstractCegarLoop]: Abstraction has 801 states and 1168 transitions. [2019-11-16 00:44:50,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:44:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1168 transitions. [2019-11-16 00:44:50,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-16 00:44:50,613 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:50,613 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:50,613 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:50,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:50,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1741341408, now seen corresponding path program 1 times [2019-11-16 00:44:50,614 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:50,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557280355] [2019-11-16 00:44:50,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:50,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:50,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:50,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557280355] [2019-11-16 00:44:50,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:50,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:44:50,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231905554] [2019-11-16 00:44:50,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:44:50,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:50,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:44:50,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:50,711 INFO L87 Difference]: Start difference. First operand 801 states and 1168 transitions. Second operand 3 states. [2019-11-16 00:44:50,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:50,829 INFO L93 Difference]: Finished difference Result 2225 states and 3248 transitions. [2019-11-16 00:44:50,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:44:50,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-16 00:44:50,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:50,837 INFO L225 Difference]: With dead ends: 2225 [2019-11-16 00:44:50,837 INFO L226 Difference]: Without dead ends: 1436 [2019-11-16 00:44:50,839 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:50,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2019-11-16 00:44:50,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1416. [2019-11-16 00:44:50,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-11-16 00:44:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2074 transitions. [2019-11-16 00:44:50,887 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2074 transitions. Word has length 37 [2019-11-16 00:44:50,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:50,887 INFO L462 AbstractCegarLoop]: Abstraction has 1416 states and 2074 transitions. [2019-11-16 00:44:50,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:44:50,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2074 transitions. [2019-11-16 00:44:50,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-16 00:44:50,890 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:50,890 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:50,891 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:50,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:50,891 INFO L82 PathProgramCache]: Analyzing trace with hash -548172063, now seen corresponding path program 1 times [2019-11-16 00:44:50,891 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:50,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079478788] [2019-11-16 00:44:50,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:50,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:50,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:50,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079478788] [2019-11-16 00:44:50,984 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:50,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:44:50,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715319152] [2019-11-16 00:44:50,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:44:50,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:50,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:44:50,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:50,985 INFO L87 Difference]: Start difference. First operand 1416 states and 2074 transitions. Second operand 3 states. [2019-11-16 00:44:51,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:51,160 INFO L93 Difference]: Finished difference Result 3922 states and 5746 transitions. [2019-11-16 00:44:51,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:44:51,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-16 00:44:51,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:51,175 INFO L225 Difference]: With dead ends: 3922 [2019-11-16 00:44:51,175 INFO L226 Difference]: Without dead ends: 2518 [2019-11-16 00:44:51,178 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:51,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2518 states. [2019-11-16 00:44:51,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2518 to 2498. [2019-11-16 00:44:51,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2498 states. [2019-11-16 00:44:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 3662 transitions. [2019-11-16 00:44:51,270 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 3662 transitions. Word has length 41 [2019-11-16 00:44:51,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:51,271 INFO L462 AbstractCegarLoop]: Abstraction has 2498 states and 3662 transitions. [2019-11-16 00:44:51,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:44:51,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 3662 transitions. [2019-11-16 00:44:51,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-16 00:44:51,273 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:51,273 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:51,274 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:51,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:51,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1040933221, now seen corresponding path program 1 times [2019-11-16 00:44:51,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:51,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730125863] [2019-11-16 00:44:51,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:51,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:51,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:44:51,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730125863] [2019-11-16 00:44:51,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:51,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:44:51,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218344229] [2019-11-16 00:44:51,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:44:51,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:51,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:44:51,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:51,345 INFO L87 Difference]: Start difference. First operand 2498 states and 3662 transitions. Second operand 3 states. [2019-11-16 00:44:51,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:51,504 INFO L93 Difference]: Finished difference Result 6402 states and 9436 transitions. [2019-11-16 00:44:51,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:44:51,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-16 00:44:51,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:51,526 INFO L225 Difference]: With dead ends: 6402 [2019-11-16 00:44:51,526 INFO L226 Difference]: Without dead ends: 3916 [2019-11-16 00:44:51,530 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:51,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3916 states. [2019-11-16 00:44:51,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3916 to 2506. [2019-11-16 00:44:51,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2019-11-16 00:44:51,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 3670 transitions. [2019-11-16 00:44:51,751 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 3670 transitions. Word has length 42 [2019-11-16 00:44:51,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:51,751 INFO L462 AbstractCegarLoop]: Abstraction has 2506 states and 3670 transitions. [2019-11-16 00:44:51,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:44:51,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 3670 transitions. [2019-11-16 00:44:51,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-16 00:44:51,754 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:51,754 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:51,754 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:51,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:51,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1181481831, now seen corresponding path program 1 times [2019-11-16 00:44:51,755 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:51,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670478715] [2019-11-16 00:44:51,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:51,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:51,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:51,821 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:44:51,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670478715] [2019-11-16 00:44:51,822 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:51,822 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:44:51,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263488985] [2019-11-16 00:44:51,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:44:51,823 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:51,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:44:51,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:44:51,823 INFO L87 Difference]: Start difference. First operand 2506 states and 3670 transitions. Second operand 4 states. [2019-11-16 00:44:52,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:52,120 INFO L93 Difference]: Finished difference Result 5024 states and 7357 transitions. [2019-11-16 00:44:52,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:44:52,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-16 00:44:52,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:52,133 INFO L225 Difference]: With dead ends: 5024 [2019-11-16 00:44:52,133 INFO L226 Difference]: Without dead ends: 2482 [2019-11-16 00:44:52,137 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:44:52,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2482 states. [2019-11-16 00:44:52,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2482 to 2474. [2019-11-16 00:44:52,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2474 states. [2019-11-16 00:44:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3614 transitions. [2019-11-16 00:44:52,241 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3614 transitions. Word has length 42 [2019-11-16 00:44:52,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:52,242 INFO L462 AbstractCegarLoop]: Abstraction has 2474 states and 3614 transitions. [2019-11-16 00:44:52,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:44:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3614 transitions. [2019-11-16 00:44:52,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:44:52,244 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:52,245 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:52,245 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:52,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:52,245 INFO L82 PathProgramCache]: Analyzing trace with hash -645054872, now seen corresponding path program 1 times [2019-11-16 00:44:52,245 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:52,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507113748] [2019-11-16 00:44:52,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:52,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:52,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:52,354 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:52,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507113748] [2019-11-16 00:44:52,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:52,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:44:52,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807018816] [2019-11-16 00:44:52,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:44:52,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:52,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:44:52,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:52,356 INFO L87 Difference]: Start difference. First operand 2474 states and 3614 transitions. Second operand 3 states. [2019-11-16 00:44:52,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:52,718 INFO L93 Difference]: Finished difference Result 6132 states and 9000 transitions. [2019-11-16 00:44:52,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:44:52,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-16 00:44:52,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:52,737 INFO L225 Difference]: With dead ends: 6132 [2019-11-16 00:44:52,738 INFO L226 Difference]: Without dead ends: 3670 [2019-11-16 00:44:52,741 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:52,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2019-11-16 00:44:52,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3646. [2019-11-16 00:44:52,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3646 states. [2019-11-16 00:44:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3646 states to 3646 states and 5320 transitions. [2019-11-16 00:44:52,883 INFO L78 Accepts]: Start accepts. Automaton has 3646 states and 5320 transitions. Word has length 65 [2019-11-16 00:44:52,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:52,885 INFO L462 AbstractCegarLoop]: Abstraction has 3646 states and 5320 transitions. [2019-11-16 00:44:52,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:44:52,885 INFO L276 IsEmpty]: Start isEmpty. Operand 3646 states and 5320 transitions. [2019-11-16 00:44:52,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:44:52,888 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:52,888 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:52,888 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:52,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:52,889 INFO L82 PathProgramCache]: Analyzing trace with hash 108258473, now seen corresponding path program 1 times [2019-11-16 00:44:52,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:52,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133231759] [2019-11-16 00:44:52,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:52,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:52,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:52,985 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:52,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133231759] [2019-11-16 00:44:52,986 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:52,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:44:52,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248453961] [2019-11-16 00:44:52,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:44:52,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:52,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:44:52,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:52,987 INFO L87 Difference]: Start difference. First operand 3646 states and 5320 transitions. Second operand 3 states. [2019-11-16 00:44:53,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:53,353 INFO L93 Difference]: Finished difference Result 9043 states and 13258 transitions. [2019-11-16 00:44:53,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:44:53,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-16 00:44:53,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:53,388 INFO L225 Difference]: With dead ends: 9043 [2019-11-16 00:44:53,389 INFO L226 Difference]: Without dead ends: 5409 [2019-11-16 00:44:53,399 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:53,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5409 states. [2019-11-16 00:44:53,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5409 to 5383. [2019-11-16 00:44:53,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5383 states. [2019-11-16 00:44:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5383 states to 5383 states and 7840 transitions. [2019-11-16 00:44:53,635 INFO L78 Accepts]: Start accepts. Automaton has 5383 states and 7840 transitions. Word has length 69 [2019-11-16 00:44:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:53,636 INFO L462 AbstractCegarLoop]: Abstraction has 5383 states and 7840 transitions. [2019-11-16 00:44:53,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:44:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 5383 states and 7840 transitions. [2019-11-16 00:44:53,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-16 00:44:53,639 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:53,639 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:53,639 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:53,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:53,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1297310612, now seen corresponding path program 1 times [2019-11-16 00:44:53,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:53,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571099022] [2019-11-16 00:44:53,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:53,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:53,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:53,850 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:44:53,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571099022] [2019-11-16 00:44:53,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:53,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:44:53,850 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185522202] [2019-11-16 00:44:53,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:44:53,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:53,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:44:53,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:44:53,851 INFO L87 Difference]: Start difference. First operand 5383 states and 7840 transitions. Second operand 5 states. [2019-11-16 00:44:54,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:54,246 INFO L93 Difference]: Finished difference Result 11476 states and 16665 transitions. [2019-11-16 00:44:54,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:44:54,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-11-16 00:44:54,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:54,281 INFO L225 Difference]: With dead ends: 11476 [2019-11-16 00:44:54,281 INFO L226 Difference]: Without dead ends: 5448 [2019-11-16 00:44:54,288 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:44:54,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5448 states. [2019-11-16 00:44:54,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5448 to 5326. [2019-11-16 00:44:54,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5326 states. [2019-11-16 00:44:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5326 states to 5326 states and 7733 transitions. [2019-11-16 00:44:54,456 INFO L78 Accepts]: Start accepts. Automaton has 5326 states and 7733 transitions. Word has length 75 [2019-11-16 00:44:54,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:54,456 INFO L462 AbstractCegarLoop]: Abstraction has 5326 states and 7733 transitions. [2019-11-16 00:44:54,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:44:54,457 INFO L276 IsEmpty]: Start isEmpty. Operand 5326 states and 7733 transitions. [2019-11-16 00:44:54,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-16 00:44:54,459 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:54,459 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:54,460 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:54,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:54,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1590700609, now seen corresponding path program 1 times [2019-11-16 00:44:54,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:54,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642134737] [2019-11-16 00:44:54,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:54,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:54,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:44:54,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642134737] [2019-11-16 00:44:54,535 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:54,535 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:44:54,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538415840] [2019-11-16 00:44:54,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:44:54,536 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:54,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:44:54,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:54,537 INFO L87 Difference]: Start difference. First operand 5326 states and 7733 transitions. Second operand 3 states. [2019-11-16 00:44:54,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:54,665 INFO L93 Difference]: Finished difference Result 10604 states and 15397 transitions. [2019-11-16 00:44:54,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:44:54,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-16 00:44:54,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:54,676 INFO L225 Difference]: With dead ends: 10604 [2019-11-16 00:44:54,677 INFO L226 Difference]: Without dead ends: 5290 [2019-11-16 00:44:54,683 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:44:54,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5290 states. [2019-11-16 00:44:54,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5290 to 5290. [2019-11-16 00:44:54,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5290 states. [2019-11-16 00:44:54,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5290 states to 5290 states and 7661 transitions. [2019-11-16 00:44:54,843 INFO L78 Accepts]: Start accepts. Automaton has 5290 states and 7661 transitions. Word has length 77 [2019-11-16 00:44:54,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:54,844 INFO L462 AbstractCegarLoop]: Abstraction has 5290 states and 7661 transitions. [2019-11-16 00:44:54,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:44:54,844 INFO L276 IsEmpty]: Start isEmpty. Operand 5290 states and 7661 transitions. [2019-11-16 00:44:54,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-16 00:44:54,847 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:54,847 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:54,847 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:54,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:54,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1130087027, now seen corresponding path program 1 times [2019-11-16 00:44:54,848 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:54,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881388757] [2019-11-16 00:44:54,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:54,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:54,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:44:54,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881388757] [2019-11-16 00:44:54,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:54,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:44:54,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507942424] [2019-11-16 00:44:54,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:44:54,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:54,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:44:54,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:44:54,971 INFO L87 Difference]: Start difference. First operand 5290 states and 7661 transitions. Second operand 4 states. [2019-11-16 00:44:55,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:55,070 INFO L93 Difference]: Finished difference Result 5409 states and 7825 transitions. [2019-11-16 00:44:55,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:44:55,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-16 00:44:55,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:55,071 INFO L225 Difference]: With dead ends: 5409 [2019-11-16 00:44:55,071 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:44:55,077 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:44:55,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:44:55,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:44:55,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:44:55,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:44:55,078 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2019-11-16 00:44:55,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:55,078 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:44:55,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:44:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:44:55,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:44:55,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:44:55,875 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-16 00:44:56,263 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 20 [2019-11-16 00:44:57,106 INFO L446 ceAbstractionStarter]: At program point L1885(lines 1882 1887) the Hoare annotation is: true [2019-11-16 00:44:57,106 INFO L439 ceAbstractionStarter]: At program point L1885-1(lines 1882 1887) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,107 INFO L439 ceAbstractionStarter]: At program point L1885-2(lines 1882 1887) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-11-16 00:44:57,107 INFO L443 ceAbstractionStarter]: For program point L2810(lines 2810 2815) no Hoare annotation was computed. [2019-11-16 00:44:57,107 INFO L443 ceAbstractionStarter]: For program point L2679(line 2679) no Hoare annotation was computed. [2019-11-16 00:44:57,107 INFO L443 ceAbstractionStarter]: For program point L2283(lines 2283 2286) no Hoare annotation was computed. [2019-11-16 00:44:57,107 INFO L443 ceAbstractionStarter]: For program point L2283-3(lines 2283 2286) no Hoare annotation was computed. [2019-11-16 00:44:57,107 INFO L443 ceAbstractionStarter]: For program point L2283-2(lines 2283 2286) no Hoare annotation was computed. [2019-11-16 00:44:57,107 INFO L443 ceAbstractionStarter]: For program point L2283-5(lines 2283 2286) no Hoare annotation was computed. [2019-11-16 00:44:57,107 INFO L443 ceAbstractionStarter]: For program point L2283-6(lines 2283 2286) no Hoare annotation was computed. [2019-11-16 00:44:57,107 INFO L439 ceAbstractionStarter]: At program point L3010(lines 3009 3011) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,108 INFO L443 ceAbstractionStarter]: For program point L2283-8(lines 2283 2286) no Hoare annotation was computed. [2019-11-16 00:44:57,108 INFO L443 ceAbstractionStarter]: For program point L2680(lines 2680 2714) no Hoare annotation was computed. [2019-11-16 00:44:57,108 INFO L439 ceAbstractionStarter]: At program point L3077(lines 3076 3078) the Hoare annotation is: false [2019-11-16 00:44:57,108 INFO L443 ceAbstractionStarter]: For program point L1954(lines 1954 1961) no Hoare annotation was computed. [2019-11-16 00:44:57,108 INFO L443 ceAbstractionStarter]: For program point L1954-1(lines 1954 1961) no Hoare annotation was computed. [2019-11-16 00:44:57,108 INFO L443 ceAbstractionStarter]: For program point L1954-2(lines 1954 1961) no Hoare annotation was computed. [2019-11-16 00:44:57,108 INFO L443 ceAbstractionStarter]: For program point L1954-3(lines 1954 1961) no Hoare annotation was computed. [2019-11-16 00:44:57,108 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2009) no Hoare annotation was computed. [2019-11-16 00:44:57,109 INFO L439 ceAbstractionStarter]: At program point L2153-1(lines 2126 2159) the Hoare annotation is: false [2019-11-16 00:44:57,109 INFO L443 ceAbstractionStarter]: For program point L2153(lines 2153 2156) no Hoare annotation was computed. [2019-11-16 00:44:57,109 INFO L439 ceAbstractionStarter]: At program point L2153-3(lines 2126 2159) the Hoare annotation is: false [2019-11-16 00:44:57,109 INFO L443 ceAbstractionStarter]: For program point L2153-2(lines 2153 2156) no Hoare annotation was computed. [2019-11-16 00:44:57,109 INFO L439 ceAbstractionStarter]: At program point L2153-5(lines 2126 2159) the Hoare annotation is: false [2019-11-16 00:44:57,109 INFO L443 ceAbstractionStarter]: For program point L2153-4(lines 2153 2156) no Hoare annotation was computed. [2019-11-16 00:44:57,109 INFO L439 ceAbstractionStarter]: At program point L2153-7(lines 2126 2159) the Hoare annotation is: false [2019-11-16 00:44:57,109 INFO L443 ceAbstractionStarter]: For program point L2153-6(lines 2153 2156) no Hoare annotation was computed. [2019-11-16 00:44:57,109 INFO L443 ceAbstractionStarter]: For program point L2682(lines 2682 2711) no Hoare annotation was computed. [2019-11-16 00:44:57,109 INFO L443 ceAbstractionStarter]: For program point L2484(lines 2484 2492) no Hoare annotation was computed. [2019-11-16 00:44:57,109 INFO L443 ceAbstractionStarter]: For program point L2683(line 2683) no Hoare annotation was computed. [2019-11-16 00:44:57,110 INFO L443 ceAbstractionStarter]: For program point L2485(lines 2485 2488) no Hoare annotation was computed. [2019-11-16 00:44:57,110 INFO L443 ceAbstractionStarter]: For program point L2485-2(lines 2485 2488) no Hoare annotation was computed. [2019-11-16 00:44:57,110 INFO L443 ceAbstractionStarter]: For program point L2287(lines 2287 2290) no Hoare annotation was computed. [2019-11-16 00:44:57,110 INFO L443 ceAbstractionStarter]: For program point L2287-3(lines 2287 2290) no Hoare annotation was computed. [2019-11-16 00:44:57,110 INFO L443 ceAbstractionStarter]: For program point L2287-2(lines 2287 2290) no Hoare annotation was computed. [2019-11-16 00:44:57,110 INFO L443 ceAbstractionStarter]: For program point L2287-5(lines 2287 2290) no Hoare annotation was computed. [2019-11-16 00:44:57,110 INFO L443 ceAbstractionStarter]: For program point L2287-6(lines 2287 2290) no Hoare annotation was computed. [2019-11-16 00:44:57,110 INFO L443 ceAbstractionStarter]: For program point L2287-8(lines 2287 2290) no Hoare annotation was computed. [2019-11-16 00:44:57,110 INFO L443 ceAbstractionStarter]: For program point L2684(lines 2684 2689) no Hoare annotation was computed. [2019-11-16 00:44:57,110 INFO L443 ceAbstractionStarter]: For program point L2817(line 2817) no Hoare annotation was computed. [2019-11-16 00:44:57,110 INFO L443 ceAbstractionStarter]: For program point L2751(line 2751) no Hoare annotation was computed. [2019-11-16 00:44:57,110 INFO L443 ceAbstractionStarter]: For program point L2818(lines 2818 2823) no Hoare annotation was computed. [2019-11-16 00:44:57,111 INFO L443 ceAbstractionStarter]: For program point L2752(lines 2752 2757) no Hoare annotation was computed. [2019-11-16 00:44:57,111 INFO L443 ceAbstractionStarter]: For program point L2620(lines 2620 2834) no Hoare annotation was computed. [2019-11-16 00:44:57,111 INFO L443 ceAbstractionStarter]: For program point L2554(lines 2554 2557) no Hoare annotation was computed. [2019-11-16 00:44:57,111 INFO L443 ceAbstractionStarter]: For program point L2092(lines 2092 2105) no Hoare annotation was computed. [2019-11-16 00:44:57,111 INFO L439 ceAbstractionStarter]: At program point L2092-2(lines 2083 2108) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,111 INFO L446 ceAbstractionStarter]: At program point L1960(lines 1947 1963) the Hoare annotation is: true [2019-11-16 00:44:57,111 INFO L443 ceAbstractionStarter]: For program point L2092-3(lines 2092 2105) no Hoare annotation was computed. [2019-11-16 00:44:57,111 INFO L439 ceAbstractionStarter]: At program point L1960-1(lines 1947 1963) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,111 INFO L439 ceAbstractionStarter]: At program point L1960-2(lines 1947 1963) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,112 INFO L439 ceAbstractionStarter]: At program point L2092-5(lines 2083 2108) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,112 INFO L439 ceAbstractionStarter]: At program point L1960-3(lines 1947 1963) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-11-16 00:44:57,112 INFO L443 ceAbstractionStarter]: For program point L2621(line 2621) no Hoare annotation was computed. [2019-11-16 00:44:57,112 INFO L443 ceAbstractionStarter]: For program point L2622(lines 2622 2677) no Hoare annotation was computed. [2019-11-16 00:44:57,112 INFO L446 ceAbstractionStarter]: At program point L2292(lines 2270 2308) the Hoare annotation is: true [2019-11-16 00:44:57,112 INFO L439 ceAbstractionStarter]: At program point L2292-2(lines 2270 2308) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-11-16 00:44:57,112 INFO L439 ceAbstractionStarter]: At program point L2292-1(lines 2270 2308) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,112 INFO L439 ceAbstractionStarter]: At program point L2887(lines 2883 2889) the Hoare annotation is: false [2019-11-16 00:44:57,113 INFO L439 ceAbstractionStarter]: At program point L2954(lines 2953 2955) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,114 INFO L443 ceAbstractionStarter]: For program point L2624(lines 2624 2674) no Hoare annotation was computed. [2019-11-16 00:44:57,114 INFO L446 ceAbstractionStarter]: At program point L2294(lines 2270 2308) the Hoare annotation is: true [2019-11-16 00:44:57,114 INFO L439 ceAbstractionStarter]: At program point L2294-2(lines 2270 2308) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-11-16 00:44:57,114 INFO L439 ceAbstractionStarter]: At program point L2294-1(lines 2270 2308) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,114 INFO L446 ceAbstractionStarter]: At program point L3087-1(lines 1 3089) the Hoare annotation is: true [2019-11-16 00:44:57,115 INFO L443 ceAbstractionStarter]: For program point L3087(lines 3087 3089) no Hoare annotation was computed. [2019-11-16 00:44:57,115 INFO L439 ceAbstractionStarter]: At program point L3087-3(lines 1 3089) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,115 INFO L443 ceAbstractionStarter]: For program point L3087-2(lines 3087 3089) no Hoare annotation was computed. [2019-11-16 00:44:57,115 INFO L439 ceAbstractionStarter]: At program point L3087-5(lines 1 3089) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-11-16 00:44:57,115 INFO L443 ceAbstractionStarter]: For program point L3087-4(lines 3087 3089) no Hoare annotation was computed. [2019-11-16 00:44:57,115 INFO L443 ceAbstractionStarter]: For program point L2691(line 2691) no Hoare annotation was computed. [2019-11-16 00:44:57,116 INFO L443 ceAbstractionStarter]: For program point L2625(line 2625) no Hoare annotation was computed. [2019-11-16 00:44:57,116 INFO L439 ceAbstractionStarter]: At program point L2559(lines 2421 2581) the Hoare annotation is: false [2019-11-16 00:44:57,116 INFO L443 ceAbstractionStarter]: For program point L2427(lines 2427 2431) no Hoare annotation was computed. [2019-11-16 00:44:57,116 INFO L443 ceAbstractionStarter]: For program point L2427-2(lines 2421 2581) no Hoare annotation was computed. [2019-11-16 00:44:57,116 INFO L443 ceAbstractionStarter]: For program point L2692(lines 2692 2707) no Hoare annotation was computed. [2019-11-16 00:44:57,116 INFO L443 ceAbstractionStarter]: For program point L2626(lines 2626 2630) no Hoare annotation was computed. [2019-11-16 00:44:57,116 INFO L439 ceAbstractionStarter]: At program point L2957-1(lines 1 3089) the Hoare annotation is: false [2019-11-16 00:44:57,117 INFO L439 ceAbstractionStarter]: At program point L2957(lines 1 3089) the Hoare annotation is: false [2019-11-16 00:44:57,117 INFO L439 ceAbstractionStarter]: At program point L2957-3(lines 1 3089) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,117 INFO L439 ceAbstractionStarter]: At program point L2957-2(lines 1 3089) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,117 INFO L439 ceAbstractionStarter]: At program point L2957-5(lines 1 3089) the Hoare annotation is: false [2019-11-16 00:44:57,117 INFO L439 ceAbstractionStarter]: At program point L2957-4(lines 1 3089) the Hoare annotation is: false [2019-11-16 00:44:57,117 INFO L443 ceAbstractionStarter]: For program point L2825(line 2825) no Hoare annotation was computed. [2019-11-16 00:44:57,118 INFO L443 ceAbstractionStarter]: For program point L2759(line 2759) no Hoare annotation was computed. [2019-11-16 00:44:57,118 INFO L439 ceAbstractionStarter]: At program point L2561(lines 2421 2581) the Hoare annotation is: false [2019-11-16 00:44:57,118 INFO L443 ceAbstractionStarter]: For program point L2760(lines 2760 2765) no Hoare annotation was computed. [2019-11-16 00:44:57,118 INFO L443 ceAbstractionStarter]: For program point L2694(lines 2694 2700) no Hoare annotation was computed. [2019-11-16 00:44:57,118 INFO L443 ceAbstractionStarter]: For program point L2694-2(lines 2692 2706) no Hoare annotation was computed. [2019-11-16 00:44:57,118 INFO L446 ceAbstractionStarter]: At program point L2364-2(lines 1 3089) the Hoare annotation is: true [2019-11-16 00:44:57,119 INFO L439 ceAbstractionStarter]: At program point L2364-6(lines 2357 2366) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,119 INFO L443 ceAbstractionStarter]: For program point L2100(lines 2100 2103) no Hoare annotation was computed. [2019-11-16 00:44:57,119 INFO L439 ceAbstractionStarter]: At program point L2364-9(lines 1 3089) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-11-16 00:44:57,119 INFO L443 ceAbstractionStarter]: For program point L2100-1(lines 2100 2103) no Hoare annotation was computed. [2019-11-16 00:44:57,119 INFO L439 ceAbstractionStarter]: At program point L2101-1(lines 2092 2104) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,119 INFO L439 ceAbstractionStarter]: At program point L2101(lines 2092 2104) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,120 INFO L443 ceAbstractionStarter]: For program point L2564(lines 2564 2574) no Hoare annotation was computed. [2019-11-16 00:44:57,120 INFO L439 ceAbstractionStarter]: At program point L2564-2(lines 1 3089) the Hoare annotation is: false [2019-11-16 00:44:57,120 INFO L443 ceAbstractionStarter]: For program point L2300(line 2300) no Hoare annotation was computed. [2019-11-16 00:44:57,120 INFO L443 ceAbstractionStarter]: For program point L2300-2(lines 2299 2301) no Hoare annotation was computed. [2019-11-16 00:44:57,120 INFO L443 ceAbstractionStarter]: For program point L2300-3(line 2300) no Hoare annotation was computed. [2019-11-16 00:44:57,120 INFO L443 ceAbstractionStarter]: For program point L2300-6(line 2300) no Hoare annotation was computed. [2019-11-16 00:44:57,120 INFO L443 ceAbstractionStarter]: For program point L2300-5(lines 2299 2301) no Hoare annotation was computed. [2019-11-16 00:44:57,121 INFO L443 ceAbstractionStarter]: For program point L2300-8(lines 2299 2301) no Hoare annotation was computed. [2019-11-16 00:44:57,121 INFO L443 ceAbstractionStarter]: For program point L2895(lines 2895 2898) no Hoare annotation was computed. [2019-11-16 00:44:57,121 INFO L443 ceAbstractionStarter]: For program point L2895-2(lines 2895 2898) no Hoare annotation was computed. [2019-11-16 00:44:57,121 INFO L443 ceAbstractionStarter]: For program point L2895-4(lines 2895 2898) no Hoare annotation was computed. [2019-11-16 00:44:57,121 INFO L443 ceAbstractionStarter]: For program point L2895-6(lines 2895 2898) no Hoare annotation was computed. [2019-11-16 00:44:57,121 INFO L443 ceAbstractionStarter]: For program point L2895-8(lines 2895 2898) no Hoare annotation was computed. [2019-11-16 00:44:57,121 INFO L439 ceAbstractionStarter]: At program point L2499(lines 2421 2581) the Hoare annotation is: false [2019-11-16 00:44:57,122 INFO L443 ceAbstractionStarter]: For program point L2301-1(line 2301) no Hoare annotation was computed. [2019-11-16 00:44:57,122 INFO L443 ceAbstractionStarter]: For program point L2301-3(line 2301) no Hoare annotation was computed. [2019-11-16 00:44:57,122 INFO L443 ceAbstractionStarter]: For program point L2301-5(line 2301) no Hoare annotation was computed. [2019-11-16 00:44:57,122 INFO L443 ceAbstractionStarter]: For program point L1971(lines 1971 1978) no Hoare annotation was computed. [2019-11-16 00:44:57,122 INFO L443 ceAbstractionStarter]: For program point L1971-1(lines 1971 1978) no Hoare annotation was computed. [2019-11-16 00:44:57,122 INFO L443 ceAbstractionStarter]: For program point L1971-2(lines 1971 1978) no Hoare annotation was computed. [2019-11-16 00:44:57,122 INFO L443 ceAbstractionStarter]: For program point L2632(line 2632) no Hoare annotation was computed. [2019-11-16 00:44:57,123 INFO L439 ceAbstractionStarter]: At program point L2963(lines 2842 2849) the Hoare annotation is: false [2019-11-16 00:44:57,123 INFO L443 ceAbstractionStarter]: For program point L2633(lines 2633 2637) no Hoare annotation was computed. [2019-11-16 00:44:57,123 INFO L443 ceAbstractionStarter]: For program point L2633-2(lines 2624 2674) no Hoare annotation was computed. [2019-11-16 00:44:57,123 INFO L439 ceAbstractionStarter]: At program point L2501(lines 2421 2581) the Hoare annotation is: false [2019-11-16 00:44:57,123 INFO L446 ceAbstractionStarter]: At program point L2303-1(lines 2261 2309) the Hoare annotation is: true [2019-11-16 00:44:57,123 INFO L443 ceAbstractionStarter]: For program point L2303(lines 2303 2306) no Hoare annotation was computed. [2019-11-16 00:44:57,124 INFO L439 ceAbstractionStarter]: At program point L2303-3(lines 2261 2309) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,124 INFO L443 ceAbstractionStarter]: For program point L2303-2(lines 2303 2306) no Hoare annotation was computed. [2019-11-16 00:44:57,124 INFO L439 ceAbstractionStarter]: At program point L2303-5(lines 2261 2309) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-11-16 00:44:57,124 INFO L443 ceAbstractionStarter]: For program point L2303-4(lines 2303 2306) no Hoare annotation was computed. [2019-11-16 00:44:57,124 INFO L443 ceAbstractionStarter]: For program point L2832(line 2832) no Hoare annotation was computed. [2019-11-16 00:44:57,124 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:44:57,124 INFO L443 ceAbstractionStarter]: For program point L2767(line 2767) no Hoare annotation was computed. [2019-11-16 00:44:57,125 INFO L443 ceAbstractionStarter]: For program point L2569(lines 2569 2572) no Hoare annotation was computed. [2019-11-16 00:44:57,125 INFO L439 ceAbstractionStarter]: At program point L2966-2(lines 1 3089) the Hoare annotation is: false [2019-11-16 00:44:57,125 INFO L439 ceAbstractionStarter]: At program point L2966-1(lines 1 3089) the Hoare annotation is: false [2019-11-16 00:44:57,125 INFO L439 ceAbstractionStarter]: At program point L2570(lines 1 3089) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0)) [2019-11-16 00:44:57,125 INFO L443 ceAbstractionStarter]: For program point L2504(lines 2504 2511) no Hoare annotation was computed. [2019-11-16 00:44:57,125 INFO L443 ceAbstractionStarter]: For program point L2504-2(lines 2421 2581) no Hoare annotation was computed. [2019-11-16 00:44:57,126 INFO L439 ceAbstractionStarter]: At program point L2835(lines 2605 2840) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,126 INFO L446 ceAbstractionStarter]: At program point L2703(lines 1 3089) the Hoare annotation is: true [2019-11-16 00:44:57,126 INFO L439 ceAbstractionStarter]: At program point L2175(lines 2169 2177) the Hoare annotation is: false [2019-11-16 00:44:57,126 INFO L439 ceAbstractionStarter]: At program point L1977(lines 1964 1980) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,126 INFO L439 ceAbstractionStarter]: At program point L1977-1(lines 1964 1980) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,126 INFO L439 ceAbstractionStarter]: At program point L1977-2(lines 1964 1980) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,127 INFO L443 ceAbstractionStarter]: For program point L2506(lines 2506 2509) no Hoare annotation was computed. [2019-11-16 00:44:57,127 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 2009) no Hoare annotation was computed. [2019-11-16 00:44:57,127 INFO L439 ceAbstractionStarter]: At program point L2969-1(lines 2858 2865) the Hoare annotation is: false [2019-11-16 00:44:57,127 INFO L439 ceAbstractionStarter]: At program point L2969(lines 2858 2865) the Hoare annotation is: false [2019-11-16 00:44:57,127 INFO L439 ceAbstractionStarter]: At program point L2969-2(lines 2858 2865) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,127 INFO L443 ceAbstractionStarter]: For program point L2441(lines 2441 2444) no Hoare annotation was computed. [2019-11-16 00:44:57,128 INFO L443 ceAbstractionStarter]: For program point L2375-1(lines 2375 2378) no Hoare annotation was computed. [2019-11-16 00:44:57,128 INFO L443 ceAbstractionStarter]: For program point L2375(lines 2375 2378) no Hoare annotation was computed. [2019-11-16 00:44:57,128 INFO L443 ceAbstractionStarter]: For program point L2375-2(lines 2375 2378) no Hoare annotation was computed. [2019-11-16 00:44:57,128 INFO L439 ceAbstractionStarter]: At program point L3036(lines 3035 3037) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-11-16 00:44:57,128 INFO L439 ceAbstractionStarter]: At program point L3036-2(lines 3035 3037) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0)) [2019-11-16 00:44:57,128 INFO L439 ceAbstractionStarter]: At program point L3036-1(lines 3035 3037) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,129 INFO L439 ceAbstractionStarter]: At program point L2112(lines 1 3089) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,129 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 2009) no Hoare annotation was computed. [2019-11-16 00:44:57,129 INFO L439 ceAbstractionStarter]: At program point L2112-2(lines 2109 2114) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,129 INFO L439 ceAbstractionStarter]: At program point L2112-1(lines 2109 2114) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,129 INFO L446 ceAbstractionStarter]: At program point L2839(lines 2592 2841) the Hoare annotation is: true [2019-11-16 00:44:57,129 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:44:57,130 INFO L443 ceAbstractionStarter]: For program point L-1-1(line -1) no Hoare annotation was computed. [2019-11-16 00:44:57,130 INFO L443 ceAbstractionStarter]: For program point L-1-2(line -1) no Hoare annotation was computed. [2019-11-16 00:44:57,130 INFO L443 ceAbstractionStarter]: For program point L-1-3(line -1) no Hoare annotation was computed. [2019-11-16 00:44:57,130 INFO L443 ceAbstractionStarter]: For program point L-1-4(line -1) no Hoare annotation was computed. [2019-11-16 00:44:57,130 INFO L443 ceAbstractionStarter]: For program point L-1-5(line -1) no Hoare annotation was computed. [2019-11-16 00:44:57,130 INFO L443 ceAbstractionStarter]: For program point L-1-6(line -1) no Hoare annotation was computed. [2019-11-16 00:44:57,130 INFO L443 ceAbstractionStarter]: For program point L2774(line 2774) no Hoare annotation was computed. [2019-11-16 00:44:57,131 INFO L439 ceAbstractionStarter]: At program point L2973-1(lines 2972 2974) the Hoare annotation is: false [2019-11-16 00:44:57,131 INFO L439 ceAbstractionStarter]: At program point L2973(lines 2972 2974) the Hoare annotation is: false [2019-11-16 00:44:57,131 INFO L443 ceAbstractionStarter]: For program point L2775(lines 2775 2830) no Hoare annotation was computed. [2019-11-16 00:44:57,131 INFO L443 ceAbstractionStarter]: For program point L2709(line 2709) no Hoare annotation was computed. [2019-11-16 00:44:57,131 INFO L443 ceAbstractionStarter]: For program point L2379(lines 2379 2393) no Hoare annotation was computed. [2019-11-16 00:44:57,131 INFO L443 ceAbstractionStarter]: For program point L2379-3(lines 2379 2393) no Hoare annotation was computed. [2019-11-16 00:44:57,131 INFO L443 ceAbstractionStarter]: For program point L2379-2(lines 2379 2393) no Hoare annotation was computed. [2019-11-16 00:44:57,132 INFO L443 ceAbstractionStarter]: For program point L2379-5(lines 2379 2393) no Hoare annotation was computed. [2019-11-16 00:44:57,132 INFO L443 ceAbstractionStarter]: For program point L2379-6(lines 2379 2393) no Hoare annotation was computed. [2019-11-16 00:44:57,132 INFO L443 ceAbstractionStarter]: For program point L2379-8(lines 2379 2393) no Hoare annotation was computed. [2019-11-16 00:44:57,132 INFO L439 ceAbstractionStarter]: At program point L3040(lines 3039 3041) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,132 INFO L443 ceAbstractionStarter]: For program point L2644(line 2644) no Hoare annotation was computed. [2019-11-16 00:44:57,132 INFO L439 ceAbstractionStarter]: At program point L2446(lines 2421 2581) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,133 INFO L443 ceAbstractionStarter]: For program point L2512-1(lines 2421 2581) no Hoare annotation was computed. [2019-11-16 00:44:57,133 INFO L439 ceAbstractionStarter]: At program point L2182(lines 2178 2184) the Hoare annotation is: false [2019-11-16 00:44:57,133 INFO L439 ceAbstractionStarter]: At program point L2182-1(lines 2178 2184) the Hoare annotation is: false [2019-11-16 00:44:57,133 INFO L443 ceAbstractionStarter]: For program point L2777(lines 2777 2827) no Hoare annotation was computed. [2019-11-16 00:44:57,133 INFO L443 ceAbstractionStarter]: For program point L2645(lines 2645 2649) no Hoare annotation was computed. [2019-11-16 00:44:57,133 INFO L443 ceAbstractionStarter]: For program point L2645-2(lines 2624 2674) no Hoare annotation was computed. [2019-11-16 00:44:57,133 INFO L439 ceAbstractionStarter]: At program point L2976(lines 2975 2977) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-11-16 00:44:57,134 INFO L439 ceAbstractionStarter]: At program point L2976-2(lines 2975 2977) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,134 INFO L439 ceAbstractionStarter]: At program point L2976-1(lines 2975 2977) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-11-16 00:44:57,134 INFO L439 ceAbstractionStarter]: At program point L2976-4(lines 2975 2977) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0)) [2019-11-16 00:44:57,134 INFO L439 ceAbstractionStarter]: At program point L2976-3(lines 2975 2977) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,134 INFO L443 ceAbstractionStarter]: For program point L2778(line 2778) no Hoare annotation was computed. [2019-11-16 00:44:57,134 INFO L439 ceAbstractionStarter]: At program point L2976-5(lines 2975 2977) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0)) [2019-11-16 00:44:57,135 INFO L439 ceAbstractionStarter]: At program point L2580(lines 2410 2582) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nwriters_stress~0 1))) (.cse1 (= ~ldv_state_variable_0~0 1))) (or (and (<= (+ |ULTIMATE.start_lock_torture_init_#res| 16) 0) .cse0 .cse1) (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (<= (+ |ULTIMATE.start_lock_torture_init_#res| 12) 0) .cse0 .cse1))) [2019-11-16 00:44:57,135 INFO L443 ceAbstractionStarter]: For program point L2514(lines 2514 2517) no Hoare annotation was computed. [2019-11-16 00:44:57,135 INFO L439 ceAbstractionStarter]: At program point L2448(lines 2421 2581) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,135 INFO L439 ceAbstractionStarter]: At program point L3043(lines 3042 3044) the Hoare annotation is: (and (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-11-16 00:44:57,135 INFO L443 ceAbstractionStarter]: For program point L2779(lines 2779 2783) no Hoare annotation was computed. [2019-11-16 00:44:57,136 INFO L439 ceAbstractionStarter]: At program point L2451(lines 2421 2581) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,136 INFO L439 ceAbstractionStarter]: At program point L2385-1(lines 2379 2392) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,136 INFO L439 ceAbstractionStarter]: At program point L2385(lines 2379 2392) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-11-16 00:44:57,136 INFO L443 ceAbstractionStarter]: For program point L2319-1(lines 2319 2323) no Hoare annotation was computed. [2019-11-16 00:44:57,136 INFO L443 ceAbstractionStarter]: For program point L2319(lines 2319 2323) no Hoare annotation was computed. [2019-11-16 00:44:57,136 INFO L439 ceAbstractionStarter]: At program point L2385-2(lines 2379 2392) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0)) [2019-11-16 00:44:57,137 INFO L443 ceAbstractionStarter]: For program point L2319-2(lines 2319 2323) no Hoare annotation was computed. [2019-11-16 00:44:57,137 INFO L443 ceAbstractionStarter]: For program point L2716(line 2716) no Hoare annotation was computed. [2019-11-16 00:44:57,137 INFO L443 ceAbstractionStarter]: For program point L2717(lines 2717 2772) no Hoare annotation was computed. [2019-11-16 00:44:57,137 INFO L439 ceAbstractionStarter]: At program point L2387-1(lines 2379 2392) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,137 INFO L439 ceAbstractionStarter]: At program point L2387(lines 2379 2392) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-11-16 00:44:57,137 INFO L439 ceAbstractionStarter]: At program point L2387-2(lines 2379 2392) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0)) [2019-11-16 00:44:57,138 INFO L439 ceAbstractionStarter]: At program point L2123(lines 2119 2125) the Hoare annotation is: false [2019-11-16 00:44:57,138 INFO L443 ceAbstractionStarter]: For program point L2520-1(lines 2421 2581) no Hoare annotation was computed. [2019-11-16 00:44:57,138 INFO L446 ceAbstractionStarter]: At program point L1926(lines 1924 1927) the Hoare annotation is: true [2019-11-16 00:44:57,138 INFO L439 ceAbstractionStarter]: At program point L1926-1(lines 1924 1927) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,138 INFO L439 ceAbstractionStarter]: At program point L1926-2(lines 1924 1927) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,138 INFO L439 ceAbstractionStarter]: At program point L1926-3(lines 1924 1927) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-11-16 00:44:57,139 INFO L443 ceAbstractionStarter]: For program point L2785(line 2785) no Hoare annotation was computed. [2019-11-16 00:44:57,139 INFO L443 ceAbstractionStarter]: For program point L2719(lines 2719 2769) no Hoare annotation was computed. [2019-11-16 00:44:57,139 INFO L443 ceAbstractionStarter]: For program point L2786(lines 2786 2790) no Hoare annotation was computed. [2019-11-16 00:44:57,139 INFO L443 ceAbstractionStarter]: For program point L2720(line 2720) no Hoare annotation was computed. [2019-11-16 00:44:57,139 INFO L443 ceAbstractionStarter]: For program point L2786-2(lines 2777 2827) no Hoare annotation was computed. [2019-11-16 00:44:57,139 INFO L443 ceAbstractionStarter]: For program point L2522(lines 2522 2525) no Hoare annotation was computed. [2019-11-16 00:44:57,139 INFO L443 ceAbstractionStarter]: For program point L2721(lines 2721 2725) no Hoare annotation was computed. [2019-11-16 00:44:57,140 INFO L439 ceAbstractionStarter]: At program point L2986(lines 2985 2987) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,140 INFO L443 ceAbstractionStarter]: For program point L2656(line 2656) no Hoare annotation was computed. [2019-11-16 00:44:57,140 INFO L443 ceAbstractionStarter]: For program point L2657(lines 2657 2662) no Hoare annotation was computed. [2019-11-16 00:44:57,140 INFO L446 ceAbstractionStarter]: At program point L3054(lines 3053 3055) the Hoare annotation is: true [2019-11-16 00:44:57,140 INFO L439 ceAbstractionStarter]: At program point L3054-2(lines 3053 3055) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-11-16 00:44:57,140 INFO L439 ceAbstractionStarter]: At program point L3054-1(lines 3053 3055) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,141 INFO L439 ceAbstractionStarter]: At program point L2460(lines 2452 2468) the Hoare annotation is: (and (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-11-16 00:44:57,141 INFO L439 ceAbstractionStarter]: At program point L2990(lines 2989 2991) the Hoare annotation is: false [2019-11-16 00:44:57,141 INFO L439 ceAbstractionStarter]: At program point L2462(lines 2452 2468) the Hoare annotation is: (and (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-11-16 00:44:57,141 INFO L443 ceAbstractionStarter]: For program point L2528-1(lines 2528 2535) no Hoare annotation was computed. [2019-11-16 00:44:57,141 INFO L443 ceAbstractionStarter]: For program point L2727(line 2727) no Hoare annotation was computed. [2019-11-16 00:44:57,141 INFO L443 ceAbstractionStarter]: For program point L2397-1(lines 2397 2406) no Hoare annotation was computed. [2019-11-16 00:44:57,142 INFO L443 ceAbstractionStarter]: For program point L2397(lines 2397 2406) no Hoare annotation was computed. [2019-11-16 00:44:57,142 INFO L443 ceAbstractionStarter]: For program point L2397-2(lines 2397 2406) no Hoare annotation was computed. [2019-11-16 00:44:57,142 INFO L439 ceAbstractionStarter]: At program point L3058(lines 3057 3059) the Hoare annotation is: false [2019-11-16 00:44:57,142 INFO L446 ceAbstractionStarter]: At program point L1935(lines 1930 1937) the Hoare annotation is: true [2019-11-16 00:44:57,142 INFO L439 ceAbstractionStarter]: At program point L1935-1(lines 1930 1937) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,142 INFO L439 ceAbstractionStarter]: At program point L1869(lines 1864 1871) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,143 INFO L439 ceAbstractionStarter]: At program point L1935-2(lines 1930 1937) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,143 INFO L439 ceAbstractionStarter]: At program point L1935-3(lines 1930 1937) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-11-16 00:44:57,143 INFO L443 ceAbstractionStarter]: For program point L2728(lines 2728 2732) no Hoare annotation was computed. [2019-11-16 00:44:57,143 INFO L443 ceAbstractionStarter]: For program point L2728-2(lines 2719 2769) no Hoare annotation was computed. [2019-11-16 00:44:57,143 INFO L443 ceAbstractionStarter]: For program point L2530(lines 2530 2533) no Hoare annotation was computed. [2019-11-16 00:44:57,143 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:44:57,143 INFO L439 ceAbstractionStarter]: At program point L2994(lines 2993 2995) the Hoare annotation is: false [2019-11-16 00:44:57,144 INFO L443 ceAbstractionStarter]: For program point L2664(line 2664) no Hoare annotation was computed. [2019-11-16 00:44:57,144 INFO L439 ceAbstractionStarter]: At program point L2929-1(lines 2925 2931) the Hoare annotation is: false [2019-11-16 00:44:57,144 INFO L439 ceAbstractionStarter]: At program point L2929(lines 2925 2931) the Hoare annotation is: false [2019-11-16 00:44:57,144 INFO L443 ceAbstractionStarter]: For program point L2797(line 2797) no Hoare annotation was computed. [2019-11-16 00:44:57,144 INFO L443 ceAbstractionStarter]: For program point L2665(lines 2665 2670) no Hoare annotation was computed. [2019-11-16 00:44:57,144 INFO L443 ceAbstractionStarter]: For program point L2401-1(lines 2401 2405) no Hoare annotation was computed. [2019-11-16 00:44:57,144 INFO L443 ceAbstractionStarter]: For program point L2401(lines 2401 2405) no Hoare annotation was computed. [2019-11-16 00:44:57,145 INFO L443 ceAbstractionStarter]: For program point L2401-2(lines 2401 2405) no Hoare annotation was computed. [2019-11-16 00:44:57,145 INFO L439 ceAbstractionStarter]: At program point L3062(lines 3061 3063) the Hoare annotation is: false [2019-11-16 00:44:57,145 INFO L439 ceAbstractionStarter]: At program point L3062-2(lines 3061 3063) the Hoare annotation is: false [2019-11-16 00:44:57,145 INFO L446 ceAbstractionStarter]: At program point L2005(lines 2892 2901) the Hoare annotation is: true [2019-11-16 00:44:57,145 INFO L439 ceAbstractionStarter]: At program point L3062-1(lines 3061 3063) the Hoare annotation is: false [2019-11-16 00:44:57,145 INFO L439 ceAbstractionStarter]: At program point L2005-1(lines 2892 2901) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,146 INFO L439 ceAbstractionStarter]: At program point L2005-2(lines 2892 2901) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,146 INFO L439 ceAbstractionStarter]: At program point L3062-4(lines 3061 3063) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,146 INFO L439 ceAbstractionStarter]: At program point L3062-3(lines 3061 3063) the Hoare annotation is: false [2019-11-16 00:44:57,146 INFO L439 ceAbstractionStarter]: At program point L2005-3(lines 2892 2901) the Hoare annotation is: false [2019-11-16 00:44:57,146 INFO L439 ceAbstractionStarter]: At program point L2005-4(lines 2892 2901) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-11-16 00:44:57,146 INFO L439 ceAbstractionStarter]: At program point L3062-6(lines 3061 3063) the Hoare annotation is: false [2019-11-16 00:44:57,147 INFO L439 ceAbstractionStarter]: At program point L3062-5(lines 3061 3063) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,147 INFO L443 ceAbstractionStarter]: For program point L2798(lines 2798 2802) no Hoare annotation was computed. [2019-11-16 00:44:57,147 INFO L439 ceAbstractionStarter]: At program point L3062-8(lines 3061 3063) the Hoare annotation is: false [2019-11-16 00:44:57,147 INFO L439 ceAbstractionStarter]: At program point L3062-7(lines 3061 3063) the Hoare annotation is: false [2019-11-16 00:44:57,147 INFO L443 ceAbstractionStarter]: For program point L2798-2(lines 2777 2827) no Hoare annotation was computed. [2019-11-16 00:44:57,147 INFO L439 ceAbstractionStarter]: At program point L3062-9(lines 3061 3063) the Hoare annotation is: false [2019-11-16 00:44:57,147 INFO L443 ceAbstractionStarter]: For program point L2138(lines 2138 2151) no Hoare annotation was computed. [2019-11-16 00:44:57,148 INFO L443 ceAbstractionStarter]: For program point L2138-2(lines 2138 2151) no Hoare annotation was computed. [2019-11-16 00:44:57,148 INFO L443 ceAbstractionStarter]: For program point L2138-3(lines 2138 2151) no Hoare annotation was computed. [2019-11-16 00:44:57,148 INFO L443 ceAbstractionStarter]: For program point L2138-6(lines 2138 2151) no Hoare annotation was computed. [2019-11-16 00:44:57,148 INFO L443 ceAbstractionStarter]: For program point L2138-5(lines 2138 2151) no Hoare annotation was computed. [2019-11-16 00:44:57,148 INFO L443 ceAbstractionStarter]: For program point L2138-8(lines 2138 2151) no Hoare annotation was computed. [2019-11-16 00:44:57,148 INFO L443 ceAbstractionStarter]: For program point L2138-9(lines 2138 2151) no Hoare annotation was computed. [2019-11-16 00:44:57,148 INFO L443 ceAbstractionStarter]: For program point L2138-11(lines 2138 2151) no Hoare annotation was computed. [2019-11-16 00:44:57,149 INFO L439 ceAbstractionStarter]: At program point L2998(lines 2997 2999) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,149 INFO L443 ceAbstractionStarter]: For program point L2470(lines 2470 2473) no Hoare annotation was computed. [2019-11-16 00:44:57,149 INFO L443 ceAbstractionStarter]: For program point L2470-2(lines 2421 2581) no Hoare annotation was computed. [2019-11-16 00:44:57,149 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 2009) no Hoare annotation was computed. [2019-11-16 00:44:57,149 INFO L443 ceAbstractionStarter]: For program point L2008(line 2008) no Hoare annotation was computed. [2019-11-16 00:44:57,149 INFO L443 ceAbstractionStarter]: For program point L2008-1(line 2008) no Hoare annotation was computed. [2019-11-16 00:44:57,150 INFO L443 ceAbstractionStarter]: For program point L2008-2(line 2008) no Hoare annotation was computed. [2019-11-16 00:44:57,150 INFO L443 ceAbstractionStarter]: For program point L2008-3(line 2008) no Hoare annotation was computed. [2019-11-16 00:44:57,150 INFO L443 ceAbstractionStarter]: For program point L2008-4(line 2008) no Hoare annotation was computed. [2019-11-16 00:44:57,150 INFO L439 ceAbstractionStarter]: At program point L3066(lines 3065 3067) the Hoare annotation is: false [2019-11-16 00:44:57,150 INFO L443 ceAbstractionStarter]: For program point L2538(lines 2538 2546) no Hoare annotation was computed. [2019-11-16 00:44:57,150 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 2009) no Hoare annotation was computed. [2019-11-16 00:44:57,150 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:44:57,151 INFO L443 ceAbstractionStarter]: For program point L2539(lines 2539 2542) no Hoare annotation was computed. [2019-11-16 00:44:57,151 INFO L443 ceAbstractionStarter]: For program point L2539-2(lines 2539 2542) no Hoare annotation was computed. [2019-11-16 00:44:57,151 INFO L439 ceAbstractionStarter]: At program point L3002(lines 3001 3003) the Hoare annotation is: false [2019-11-16 00:44:57,151 INFO L439 ceAbstractionStarter]: At program point L2936(lines 2932 2938) the Hoare annotation is: false [2019-11-16 00:44:57,151 INFO L439 ceAbstractionStarter]: At program point L2936-2(lines 2932 2938) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,151 INFO L439 ceAbstractionStarter]: At program point L1879(lines 1874 1881) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,152 INFO L439 ceAbstractionStarter]: At program point L2936-1(lines 2932 2938) the Hoare annotation is: false [2019-11-16 00:44:57,152 INFO L439 ceAbstractionStarter]: At program point L2936-4(lines 2932 2938) the Hoare annotation is: false [2019-11-16 00:44:57,152 INFO L439 ceAbstractionStarter]: At program point L2936-3(lines 2932 2938) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,152 INFO L439 ceAbstractionStarter]: At program point L2936-5(lines 2932 2938) the Hoare annotation is: false [2019-11-16 00:44:57,152 INFO L443 ceAbstractionStarter]: For program point L2672(line 2672) no Hoare annotation was computed. [2019-11-16 00:44:57,152 INFO L443 ceAbstractionStarter]: For program point L2474-1(lines 2474 2479) no Hoare annotation was computed. [2019-11-16 00:44:57,152 INFO L443 ceAbstractionStarter]: For program point L2739(line 2739) no Hoare annotation was computed. [2019-11-16 00:44:57,153 INFO L446 ceAbstractionStarter]: At program point L2872(lines 2867 2874) the Hoare annotation is: true [2019-11-16 00:44:57,153 INFO L439 ceAbstractionStarter]: At program point L2872-2(lines 2867 2874) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,153 INFO L439 ceAbstractionStarter]: At program point L2872-1(lines 2867 2874) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,153 INFO L443 ceAbstractionStarter]: For program point L2740(lines 2740 2744) no Hoare annotation was computed. [2019-11-16 00:44:57,153 INFO L439 ceAbstractionStarter]: At program point L2872-3(lines 2867 2874) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-11-16 00:44:57,153 INFO L443 ceAbstractionStarter]: For program point L2740-2(lines 2719 2769) no Hoare annotation was computed. [2019-11-16 00:44:57,154 INFO L443 ceAbstractionStarter]: For program point L2278(lines 2278 2281) no Hoare annotation was computed. [2019-11-16 00:44:57,154 INFO L443 ceAbstractionStarter]: For program point L2278-2(lines 2278 2281) no Hoare annotation was computed. [2019-11-16 00:44:57,154 INFO L443 ceAbstractionStarter]: For program point L2146(lines 2146 2149) no Hoare annotation was computed. [2019-11-16 00:44:57,154 INFO L443 ceAbstractionStarter]: For program point L2278-3(lines 2278 2281) no Hoare annotation was computed. [2019-11-16 00:44:57,154 INFO L443 ceAbstractionStarter]: For program point L2278-6(lines 2278 2281) no Hoare annotation was computed. [2019-11-16 00:44:57,154 INFO L443 ceAbstractionStarter]: For program point L2146-2(lines 2146 2149) no Hoare annotation was computed. [2019-11-16 00:44:57,154 INFO L443 ceAbstractionStarter]: For program point L2146-1(lines 2146 2149) no Hoare annotation was computed. [2019-11-16 00:44:57,155 INFO L443 ceAbstractionStarter]: For program point L2278-5(lines 2278 2281) no Hoare annotation was computed. [2019-11-16 00:44:57,155 INFO L439 ceAbstractionStarter]: At program point L2080(lines 2077 2082) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-16 00:44:57,155 INFO L443 ceAbstractionStarter]: For program point L2278-8(lines 2278 2281) no Hoare annotation was computed. [2019-11-16 00:44:57,155 INFO L443 ceAbstractionStarter]: For program point L2146-3(lines 2146 2149) no Hoare annotation was computed. [2019-11-16 00:44:57,155 INFO L439 ceAbstractionStarter]: At program point L2147-1(lines 2138 2150) the Hoare annotation is: false [2019-11-16 00:44:57,155 INFO L439 ceAbstractionStarter]: At program point L2147(lines 2138 2150) the Hoare annotation is: false [2019-11-16 00:44:57,155 INFO L439 ceAbstractionStarter]: At program point L2147-3(lines 2138 2150) the Hoare annotation is: false [2019-11-16 00:44:57,156 INFO L439 ceAbstractionStarter]: At program point L2147-2(lines 2138 2150) the Hoare annotation is: false [2019-11-16 00:44:57,156 INFO L446 ceAbstractionStarter]: At program point L2015(lines 2014 2017) the Hoare annotation is: true [2019-11-16 00:44:57,156 INFO L439 ceAbstractionStarter]: At program point L3006(lines 3005 3007) the Hoare annotation is: false [2019-11-16 00:44:57,156 INFO L446 ceAbstractionStarter]: At program point L2015-1(lines 2014 2017) the Hoare annotation is: true [2019-11-16 00:44:57,156 INFO L446 ceAbstractionStarter]: At program point L2015-2(lines 2014 2017) the Hoare annotation is: true [2019-11-16 00:44:57,156 INFO L446 ceAbstractionStarter]: At program point L2015-3(lines 2014 2017) the Hoare annotation is: true [2019-11-16 00:44:57,156 INFO L446 ceAbstractionStarter]: At program point L2015-4(lines 2014 2017) the Hoare annotation is: true [2019-11-16 00:44:57,157 INFO L439 ceAbstractionStarter]: At program point L3073(lines 3072 3074) the Hoare annotation is: false [2019-11-16 00:44:57,157 INFO L443 ceAbstractionStarter]: For program point L2809(line 2809) no Hoare annotation was computed. [2019-11-16 00:44:57,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:44:57 BoogieIcfgContainer [2019-11-16 00:44:57,230 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:44:57,230 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:44:57,231 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:44:57,231 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:44:57,231 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:44:49" (3/4) ... [2019-11-16 00:44:57,235 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:44:57,279 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 153 nodes and edges [2019-11-16 00:44:57,283 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 62 nodes and edges [2019-11-16 00:44:57,286 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-11-16 00:44:57,288 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-16 00:44:57,291 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:44:57,294 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-16 00:44:57,297 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-16 00:44:57,348 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result + 16 <= 0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) || (((firsterr + 12 <= 0 && \result + 12 <= 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) [2019-11-16 00:44:57,349 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-11-16 00:44:57,350 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-11-16 00:44:57,350 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-11-16 00:44:57,350 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-11-16 00:44:57,351 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-11-16 00:44:57,351 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-11-16 00:44:57,351 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-11-16 00:44:57,351 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-11-16 00:44:57,485 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3f6cb80c-085a-440c-8c70-25bd77012a03/bin/uautomizer/witness.graphml [2019-11-16 00:44:57,485 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:44:57,486 INFO L168 Benchmark]: Toolchain (without parser) took 12263.81 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 552.1 MB). Free memory was 940.8 MB in the beginning and 1.2 GB in the end (delta: -300.2 MB). Peak memory consumption was 251.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:57,487 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:44:57,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1108.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.7 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -201.4 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:57,488 INFO L168 Benchmark]: Boogie Procedure Inliner took 159.48 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: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:57,488 INFO L168 Benchmark]: Boogie Preprocessor took 132.35 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: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:57,488 INFO L168 Benchmark]: RCFGBuilder took 2545.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 891.8 MB in the end (delta: 231.3 MB). Peak memory consumption was 231.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:57,489 INFO L168 Benchmark]: TraceAbstraction took 8059.72 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 353.4 MB). Free memory was 891.8 MB in the beginning and 1.3 GB in the end (delta: -391.1 MB). Peak memory consumption was 211.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:57,489 INFO L168 Benchmark]: Witness Printer took 255.05 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:57,491 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1108.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.7 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -201.4 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 159.48 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: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 132.35 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: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2545.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 891.8 MB in the end (delta: 231.3 MB). Peak memory consumption was 231.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8059.72 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 353.4 MB). Free memory was 891.8 MB in the beginning and 1.3 GB in the end (delta: -391.1 MB). Peak memory consumption was 211.9 MB. Max. memory is 11.5 GB. * Witness Printer took 255.05 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2009]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2009]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2009]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2009]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2009]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2858]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2932]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2858]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1874]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2932]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2858]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2932]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0 - InvariantResult [Line: 2077]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2932]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3001]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3042]: Loop Invariant Derived loop invariant: (0 == tmp___0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 3061]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3053]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3009]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3061]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3053]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 3053]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2842]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3061]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2452]: Loop Invariant Derived loop invariant: (0 == tmp___0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2892]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2892]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2270]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 3061]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2892]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3061]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 3061]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2379]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 2892]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 3061]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2379]: Loop Invariant Derived loop invariant: (((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0 - InvariantResult [Line: 2379]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 3061]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2592]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2867]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2867]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2270]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3061]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2867]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 3072]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3061]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2867]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 3039]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2892]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2270]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2109]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2092]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2410]: Loop Invariant Derived loop invariant: ((\result + 16 <= 0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) || (((firsterr + 12 <= 0 && \result + 12 <= 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2989]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1964]: Loop Invariant Derived loop invariant: (((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1964]: Loop Invariant Derived loop invariant: (((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1964]: Loop Invariant Derived loop invariant: (((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2119]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2109]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2092]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2379]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 2975]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2379]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2975]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2975]: Loop Invariant Derived loop invariant: (((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0 - InvariantResult [Line: 2379]: Loop Invariant Derived loop invariant: (((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0 - InvariantResult [Line: 2975]: Loop Invariant Derived loop invariant: (((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0 - InvariantResult [Line: 2997]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2975]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 2169]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2953]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2975]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 2014]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3005]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2083]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1947]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1947]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2972]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2014]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1947]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2014]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2925]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2014]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2972]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2925]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1947]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 1930]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1864]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1930]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1930]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2083]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2014]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2605]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 3057]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3035]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 3035]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1930]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3035]: Loop Invariant Derived loop invariant: (((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0 - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2357]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2883]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1882]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1882]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 1882]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3065]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3076]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1924]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 1924]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2985]: Loop Invariant Derived loop invariant: (((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2932]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2261]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2270]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2270]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2932]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2270]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2993]: 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: 2261]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2452]: Loop Invariant Derived loop invariant: (0 == tmp___0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2261]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2178]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1924]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 336 locations, 5 error locations. Result: SAFE, OverallTime: 7.9s, OverallIterations: 12, TraceHistogramMax: 4, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, HoareTripleCheckerStatistics: 5680 SDtfs, 3682 SDslu, 4617 SDs, 0 SdLazy, 191 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5383occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 1630 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 149 LocationsWithAnnotation, 149 PreInvPairs, 550 NumberOfFragments, 2019 HoareAnnotationTreeSize, 149 FomulaSimplifications, 7228 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 149 FomulaSimplificationsInter, 411 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 605 NumberOfCodeBlocks, 605 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 593 ConstructedInterpolants, 0 QuantifiedInterpolants, 49703 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 94/94 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...