./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 bfd0d9ac Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c0e62a2f55ddaeb08563a2d9bb0bfed8d8d740037b0faa92e9ebf8fe89adc120 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-bfd0d9a [2021-11-01 16:21:59,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-01 16:21:59,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-01 16:21:59,391 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-01 16:21:59,392 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-01 16:21:59,393 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-01 16:21:59,394 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-01 16:21:59,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-01 16:21:59,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-01 16:21:59,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-01 16:21:59,398 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-01 16:21:59,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-01 16:21:59,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-01 16:21:59,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-01 16:21:59,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-01 16:21:59,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-01 16:21:59,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-01 16:21:59,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-01 16:21:59,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-01 16:21:59,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-01 16:21:59,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-01 16:21:59,416 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-01 16:21:59,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-01 16:21:59,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-01 16:21:59,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-01 16:21:59,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-01 16:21:59,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-01 16:21:59,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-01 16:21:59,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-01 16:21:59,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-01 16:21:59,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-01 16:21:59,428 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-01 16:21:59,429 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-01 16:21:59,430 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-01 16:21:59,431 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-01 16:21:59,431 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-01 16:21:59,432 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-01 16:21:59,432 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-01 16:21:59,432 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-01 16:21:59,433 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-01 16:21:59,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-01 16:21:59,434 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-01 16:21:59,464 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-01 16:21:59,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-01 16:21:59,465 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-01 16:21:59,466 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-01 16:21:59,467 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-01 16:21:59,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-01 16:21:59,467 INFO L138 SettingsManager]: * Use SBE=true [2021-11-01 16:21:59,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-01 16:21:59,467 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-01 16:21:59,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-01 16:21:59,468 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-01 16:21:59,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-01 16:21:59,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-01 16:21:59,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-01 16:21:59,469 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-01 16:21:59,469 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-01 16:21:59,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-01 16:21:59,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-01 16:21:59,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-01 16:21:59,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-01 16:21:59,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-01 16:21:59,471 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-01 16:21:59,471 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-01 16:21:59,471 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-01 16:21:59,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-01 16:21:59,471 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-01 16:21:59,471 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-01 16:21:59,472 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-01 16:21:59,473 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-01 16:21:59,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_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 -> c0e62a2f55ddaeb08563a2d9bb0bfed8d8d740037b0faa92e9ebf8fe89adc120 [2021-11-01 16:21:59,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-01 16:21:59,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-01 16:21:59,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-01 16:21:59,707 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-01 16:21:59,708 INFO L275 PluginConnector]: CDTParser initialized [2021-11-01 16:21:59,709 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../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 [2021-11-01 16:21:59,765 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/450f153a1/b7a006638cc74bbeac45258c919db0ce/FLAG8c5b2a20e [2021-11-01 16:22:00,314 INFO L306 CDTParser]: Found 1 translation units. [2021-11-01 16:22:00,315 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/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 [2021-11-01 16:22:00,337 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/450f153a1/b7a006638cc74bbeac45258c919db0ce/FLAG8c5b2a20e [2021-11-01 16:22:00,576 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/450f153a1/b7a006638cc74bbeac45258c919db0ce [2021-11-01 16:22:00,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-01 16:22:00,582 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-01 16:22:00,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-01 16:22:00,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-01 16:22:00,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-01 16:22:00,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 04:22:00" (1/1) ... [2021-11-01 16:22:00,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f7e452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:22:00, skipping insertion in model container [2021-11-01 16:22:00,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 04:22:00" (1/1) ... [2021-11-01 16:22:00,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-01 16:22:00,658 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-01 16:22:00,910 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2021-11-01 16:22:00,913 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2021-11-01 16:22:00,995 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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[52456,52469] [2021-11-01 16:22:01,170 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-01 16:22:01,186 INFO L203 MainTranslator]: Completed pre-run [2021-11-01 16:22:01,243 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2021-11-01 16:22:01,243 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2021-11-01 16:22:01,265 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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[52456,52469] [2021-11-01 16:22:01,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-01 16:22:01,393 INFO L208 MainTranslator]: Completed translation [2021-11-01 16:22:01,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:22:01 WrapperNode [2021-11-01 16:22:01,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-01 16:22:01,395 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-01 16:22:01,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-01 16:22:01,395 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-01 16:22:01,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:22:01" (1/1) ... [2021-11-01 16:22:01,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:22:01" (1/1) ... [2021-11-01 16:22:01,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-01 16:22:01,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-01 16:22:01,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-01 16:22:01,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-01 16:22:01,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:22:01" (1/1) ... [2021-11-01 16:22:01,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:22:01" (1/1) ... [2021-11-01 16:22:01,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:22:01" (1/1) ... [2021-11-01 16:22:01,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:22:01" (1/1) ... [2021-11-01 16:22:01,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:22:01" (1/1) ... [2021-11-01 16:22:01,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:22:01" (1/1) ... [2021-11-01 16:22:01,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:22:01" (1/1) ... [2021-11-01 16:22:01,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-01 16:22:01,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-01 16:22:01,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-01 16:22:01,586 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-01 16:22:01,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:22:01" (1/1) ... [2021-11-01 16:22:01,593 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-01 16:22:01,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-01 16:22:01,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-01 16:22:01,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-01 16:22:01,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-01 16:22:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-01 16:22:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-01 16:22:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-01 16:22:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-01 16:22:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-01 16:22:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-01 16:22:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-01 16:22:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-01 16:22:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-01 16:22:01,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-01 16:22:02,733 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-01 16:22:02,733 INFO L299 CfgBuilder]: Removed 358 assume(true) statements. [2021-11-01 16:22:02,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 04:22:02 BoogieIcfgContainer [2021-11-01 16:22:02,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-01 16:22:02,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-01 16:22:02,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-01 16:22:02,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-01 16:22:02,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 04:22:00" (1/3) ... [2021-11-01 16:22:02,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196f09c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 04:22:02, skipping insertion in model container [2021-11-01 16:22:02,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:22:01" (2/3) ... [2021-11-01 16:22:02,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196f09c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 04:22:02, skipping insertion in model container [2021-11-01 16:22:02,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 04:22:02" (3/3) ... [2021-11-01 16:22:02,743 INFO L111 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2021-11-01 16:22:02,750 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-01 16:22:02,750 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-01 16:22:02,801 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-01 16:22:02,806 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-01 16:22:02,806 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-01 16:22:02,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 350 states, 344 states have (on average 1.4709302325581395) internal successors, (506), 349 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:02,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-01 16:22:02,843 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 16:22:02,844 INFO L514 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] [2021-11-01 16:22:02,844 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-01 16:22:02,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 16:22:02,849 INFO L85 PathProgramCache]: Analyzing trace with hash 519222377, now seen corresponding path program 1 times [2021-11-01 16:22:02,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 16:22:02,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218611929] [2021-11-01 16:22:02,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 16:22:02,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 16:22:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 16:22:03,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 16:22:03,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 16:22:03,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218611929] [2021-11-01 16:22:03,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218611929] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 16:22:03,277 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 16:22:03,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-01 16:22:03,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019834617] [2021-11-01 16:22:03,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-01 16:22:03,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 16:22:03,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-01 16:22:03,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 16:22:03,326 INFO L87 Difference]: Start difference. First operand has 350 states, 344 states have (on average 1.4709302325581395) internal successors, (506), 349 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:04,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 16:22:04,473 INFO L93 Difference]: Finished difference Result 832 states and 1212 transitions. [2021-11-01 16:22:04,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-01 16:22:04,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-01 16:22:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 16:22:04,493 INFO L225 Difference]: With dead ends: 832 [2021-11-01 16:22:04,494 INFO L226 Difference]: Without dead ends: 445 [2021-11-01 16:22:04,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.65ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 16:22:04,508 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 406 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 793.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.94ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1047.53ms IncrementalHoareTripleChecker+Time [2021-11-01 16:22:04,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 10 Invalid, 771 Unknown, 0 Unchecked, 10.94ms Time], IncrementalHoareTripleChecker [3 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 1047.53ms Time] [2021-11-01 16:22:04,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-11-01 16:22:04,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2021-11-01 16:22:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 440 states have (on average 1.4363636363636363) internal successors, (632), 444 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:04,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 632 transitions. [2021-11-01 16:22:04,572 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 632 transitions. Word has length 22 [2021-11-01 16:22:04,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 16:22:04,572 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 632 transitions. [2021-11-01 16:22:04,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:04,573 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 632 transitions. [2021-11-01 16:22:04,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-01 16:22:04,577 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 16:22:04,577 INFO L514 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] [2021-11-01 16:22:04,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-01 16:22:04,578 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-01 16:22:04,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 16:22:04,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1139587811, now seen corresponding path program 1 times [2021-11-01 16:22:04,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 16:22:04,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947261418] [2021-11-01 16:22:04,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 16:22:04,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 16:22:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 16:22:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 16:22:04,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 16:22:04,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947261418] [2021-11-01 16:22:04,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947261418] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 16:22:04,670 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 16:22:04,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-01 16:22:04,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921858011] [2021-11-01 16:22:04,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-01 16:22:04,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 16:22:04,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-01 16:22:04,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 16:22:04,672 INFO L87 Difference]: Start difference. First operand 445 states and 632 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:05,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 16:22:05,224 INFO L93 Difference]: Finished difference Result 872 states and 1243 transitions. [2021-11-01 16:22:05,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-01 16:22:05,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-01 16:22:05,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 16:22:05,226 INFO L225 Difference]: With dead ends: 872 [2021-11-01 16:22:05,227 INFO L226 Difference]: Without dead ends: 445 [2021-11-01 16:22:05,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.97ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 16:22:05,228 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 416 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 414.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.11ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 525.86ms IncrementalHoareTripleChecker+Time [2021-11-01 16:22:05,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 0 Invalid, 438 Unknown, 0 Unchecked, 1.11ms Time], IncrementalHoareTripleChecker [0 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 525.86ms Time] [2021-11-01 16:22:05,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-11-01 16:22:05,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2021-11-01 16:22:05,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 440 states have (on average 1.434090909090909) internal successors, (631), 444 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 631 transitions. [2021-11-01 16:22:05,252 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 631 transitions. Word has length 27 [2021-11-01 16:22:05,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 16:22:05,253 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 631 transitions. [2021-11-01 16:22:05,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:05,253 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 631 transitions. [2021-11-01 16:22:05,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-01 16:22:05,255 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 16:22:05,255 INFO L514 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] [2021-11-01 16:22:05,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-01 16:22:05,256 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-01 16:22:05,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 16:22:05,256 INFO L85 PathProgramCache]: Analyzing trace with hash 236856078, now seen corresponding path program 1 times [2021-11-01 16:22:05,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 16:22:05,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074583972] [2021-11-01 16:22:05,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 16:22:05,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 16:22:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 16:22:05,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 16:22:05,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 16:22:05,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074583972] [2021-11-01 16:22:05,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074583972] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 16:22:05,358 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 16:22:05,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-01 16:22:05,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810807972] [2021-11-01 16:22:05,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-01 16:22:05,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 16:22:05,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-01 16:22:05,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 16:22:05,360 INFO L87 Difference]: Start difference. First operand 445 states and 631 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:06,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 16:22:06,258 INFO L93 Difference]: Finished difference Result 839 states and 1208 transitions. [2021-11-01 16:22:06,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-01 16:22:06,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-01 16:22:06,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 16:22:06,262 INFO L225 Difference]: With dead ends: 839 [2021-11-01 16:22:06,262 INFO L226 Difference]: Without dead ends: 819 [2021-11-01 16:22:06,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.74ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 16:22:06,264 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 387 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 663.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.83ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 859.05ms IncrementalHoareTripleChecker+Time [2021-11-01 16:22:06,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 0 Invalid, 852 Unknown, 0 Unchecked, 2.83ms Time], IncrementalHoareTripleChecker [16 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 859.05ms Time] [2021-11-01 16:22:06,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2021-11-01 16:22:06,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2021-11-01 16:22:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 814 states have (on average 1.457002457002457) internal successors, (1186), 818 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:06,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1186 transitions. [2021-11-01 16:22:06,313 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1186 transitions. Word has length 30 [2021-11-01 16:22:06,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 16:22:06,314 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1186 transitions. [2021-11-01 16:22:06,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1186 transitions. [2021-11-01 16:22:06,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-01 16:22:06,320 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 16:22:06,321 INFO L514 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] [2021-11-01 16:22:06,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-01 16:22:06,321 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-01 16:22:06,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 16:22:06,322 INFO L85 PathProgramCache]: Analyzing trace with hash -2121048348, now seen corresponding path program 1 times [2021-11-01 16:22:06,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 16:22:06,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391489310] [2021-11-01 16:22:06,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 16:22:06,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 16:22:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 16:22:06,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 16:22:06,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 16:22:06,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391489310] [2021-11-01 16:22:06,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391489310] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 16:22:06,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 16:22:06,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-01 16:22:06,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136762446] [2021-11-01 16:22:06,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-01 16:22:06,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 16:22:06,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-01 16:22:06,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 16:22:06,406 INFO L87 Difference]: Start difference. First operand 819 states and 1186 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:07,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 16:22:07,312 INFO L93 Difference]: Finished difference Result 2267 states and 3290 transitions. [2021-11-01 16:22:07,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-01 16:22:07,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-01 16:22:07,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 16:22:07,318 INFO L225 Difference]: With dead ends: 2267 [2021-11-01 16:22:07,319 INFO L226 Difference]: Without dead ends: 1466 [2021-11-01 16:22:07,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.72ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 16:22:07,321 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 372 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 625.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.44ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 840.72ms IncrementalHoareTripleChecker+Time [2021-11-01 16:22:07,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 0 Invalid, 872 Unknown, 0 Unchecked, 3.44ms Time], IncrementalHoareTripleChecker [2 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 840.72ms Time] [2021-11-01 16:22:07,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2021-11-01 16:22:07,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1446. [2021-11-01 16:22:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1441 states have (on average 1.4600971547536432) internal successors, (2104), 1445 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:07,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 2104 transitions. [2021-11-01 16:22:07,364 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 2104 transitions. Word has length 37 [2021-11-01 16:22:07,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 16:22:07,365 INFO L470 AbstractCegarLoop]: Abstraction has 1446 states and 2104 transitions. [2021-11-01 16:22:07,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:07,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 2104 transitions. [2021-11-01 16:22:07,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-01 16:22:07,367 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 16:22:07,367 INFO L514 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] [2021-11-01 16:22:07,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-01 16:22:07,368 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-01 16:22:07,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 16:22:07,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1129102007, now seen corresponding path program 1 times [2021-11-01 16:22:07,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 16:22:07,369 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459486129] [2021-11-01 16:22:07,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 16:22:07,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 16:22:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 16:22:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 16:22:07,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 16:22:07,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459486129] [2021-11-01 16:22:07,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459486129] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 16:22:07,431 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 16:22:07,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-01 16:22:07,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213322610] [2021-11-01 16:22:07,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-01 16:22:07,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 16:22:07,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-01 16:22:07,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 16:22:07,433 INFO L87 Difference]: Start difference. First operand 1446 states and 2104 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:08,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 16:22:08,319 INFO L93 Difference]: Finished difference Result 4000 states and 5824 transitions. [2021-11-01 16:22:08,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-01 16:22:08,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-01 16:22:08,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 16:22:08,329 INFO L225 Difference]: With dead ends: 4000 [2021-11-01 16:22:08,329 INFO L226 Difference]: Without dead ends: 2572 [2021-11-01 16:22:08,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.65ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 16:22:08,333 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 370 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 626.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.27ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 804.15ms IncrementalHoareTripleChecker+Time [2021-11-01 16:22:08,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 0 Invalid, 941 Unknown, 0 Unchecked, 2.27ms Time], IncrementalHoareTripleChecker [2 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 804.15ms Time] [2021-11-01 16:22:08,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2021-11-01 16:22:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2552. [2021-11-01 16:22:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2547 states have (on average 1.458971338829996) internal successors, (3716), 2551 states have internal predecessors, (3716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:08,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3716 transitions. [2021-11-01 16:22:08,407 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3716 transitions. Word has length 41 [2021-11-01 16:22:08,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 16:22:08,407 INFO L470 AbstractCegarLoop]: Abstraction has 2552 states and 3716 transitions. [2021-11-01 16:22:08,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:08,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3716 transitions. [2021-11-01 16:22:08,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-01 16:22:08,410 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 16:22:08,413 INFO L514 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] [2021-11-01 16:22:08,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-01 16:22:08,413 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-01 16:22:08,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 16:22:08,414 INFO L85 PathProgramCache]: Analyzing trace with hash -457313738, now seen corresponding path program 1 times [2021-11-01 16:22:08,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 16:22:08,415 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248436844] [2021-11-01 16:22:08,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 16:22:08,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 16:22:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 16:22:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-01 16:22:08,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 16:22:08,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248436844] [2021-11-01 16:22:08,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248436844] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 16:22:08,508 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 16:22:08,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-01 16:22:08,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384086016] [2021-11-01 16:22:08,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-01 16:22:08,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 16:22:08,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-01 16:22:08,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 16:22:08,510 INFO L87 Difference]: Start difference. First operand 2552 states and 3716 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:09,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 16:22:09,429 INFO L93 Difference]: Finished difference Result 6504 states and 9538 transitions. [2021-11-01 16:22:09,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-01 16:22:09,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-01 16:22:09,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 16:22:09,443 INFO L225 Difference]: With dead ends: 6504 [2021-11-01 16:22:09,443 INFO L226 Difference]: Without dead ends: 3970 [2021-11-01 16:22:09,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.67ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 16:22:09,448 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 412 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 647.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.09ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 813.25ms IncrementalHoareTripleChecker+Time [2021-11-01 16:22:09,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [412 Valid, 0 Invalid, 888 Unknown, 0 Unchecked, 2.09ms Time], IncrementalHoareTripleChecker [1 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 813.25ms Time] [2021-11-01 16:22:09,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3970 states. [2021-11-01 16:22:09,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3970 to 2560. [2021-11-01 16:22:09,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2560 states, 2555 states have (on average 1.4575342465753425) internal successors, (3724), 2559 states have internal predecessors, (3724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:09,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3724 transitions. [2021-11-01 16:22:09,557 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3724 transitions. Word has length 42 [2021-11-01 16:22:09,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 16:22:09,558 INFO L470 AbstractCegarLoop]: Abstraction has 2560 states and 3724 transitions. [2021-11-01 16:22:09,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:09,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3724 transitions. [2021-11-01 16:22:09,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-01 16:22:09,560 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 16:22:09,560 INFO L514 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] [2021-11-01 16:22:09,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-01 16:22:09,561 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-01 16:22:09,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 16:22:09,561 INFO L85 PathProgramCache]: Analyzing trace with hash -316765128, now seen corresponding path program 1 times [2021-11-01 16:22:09,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 16:22:09,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400669722] [2021-11-01 16:22:09,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 16:22:09,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 16:22:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 16:22:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-01 16:22:09,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 16:22:09,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400669722] [2021-11-01 16:22:09,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400669722] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 16:22:09,646 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 16:22:09,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-01 16:22:09,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290822586] [2021-11-01 16:22:09,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-01 16:22:09,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 16:22:09,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-01 16:22:09,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-01 16:22:09,648 INFO L87 Difference]: Start difference. First operand 2560 states and 3724 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 16:22:10,649 INFO L93 Difference]: Finished difference Result 5126 states and 7459 transitions. [2021-11-01 16:22:10,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-01 16:22:10,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-01 16:22:10,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 16:22:10,659 INFO L225 Difference]: With dead ends: 5126 [2021-11-01 16:22:10,659 INFO L226 Difference]: Without dead ends: 2536 [2021-11-01 16:22:10,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.63ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-01 16:22:10,665 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 734.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.05ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 923.80ms IncrementalHoareTripleChecker+Time [2021-11-01 16:22:10,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 0 Invalid, 1314 Unknown, 0 Unchecked, 3.05ms Time], IncrementalHoareTripleChecker [2 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 923.80ms Time] [2021-11-01 16:22:10,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2021-11-01 16:22:10,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2528. [2021-11-01 16:22:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2528 states, 2523 states have (on average 1.453824811732065) internal successors, (3668), 2527 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 3668 transitions. [2021-11-01 16:22:10,766 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 3668 transitions. Word has length 42 [2021-11-01 16:22:10,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 16:22:10,768 INFO L470 AbstractCegarLoop]: Abstraction has 2528 states and 3668 transitions. [2021-11-01 16:22:10,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 3668 transitions. [2021-11-01 16:22:10,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-01 16:22:10,771 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 16:22:10,771 INFO L514 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] [2021-11-01 16:22:10,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-01 16:22:10,772 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-01 16:22:10,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 16:22:10,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1266781576, now seen corresponding path program 1 times [2021-11-01 16:22:10,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 16:22:10,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128405432] [2021-11-01 16:22:10,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 16:22:10,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 16:22:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 16:22:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 16:22:10,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 16:22:10,883 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128405432] [2021-11-01 16:22:10,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128405432] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 16:22:10,883 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 16:22:10,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-01 16:22:10,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162813169] [2021-11-01 16:22:10,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-01 16:22:10,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 16:22:10,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-01 16:22:10,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 16:22:10,886 INFO L87 Difference]: Start difference. First operand 2528 states and 3668 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:12,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 16:22:12,179 INFO L93 Difference]: Finished difference Result 6258 states and 9126 transitions. [2021-11-01 16:22:12,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-01 16:22:12,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-01 16:22:12,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 16:22:12,198 INFO L225 Difference]: With dead ends: 6258 [2021-11-01 16:22:12,198 INFO L226 Difference]: Without dead ends: 3748 [2021-11-01 16:22:12,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.65ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 16:22:12,203 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 376 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 998.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.09ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1199.13ms IncrementalHoareTripleChecker+Time [2021-11-01 16:22:12,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 0 Invalid, 1122 Unknown, 0 Unchecked, 2.09ms Time], IncrementalHoareTripleChecker [13 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 1199.13ms Time] [2021-11-01 16:22:12,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3748 states. [2021-11-01 16:22:12,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3748 to 3724. [2021-11-01 16:22:12,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3724 states, 3719 states have (on average 1.451465447700995) internal successors, (5398), 3723 states have internal predecessors, (5398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:12,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3724 states to 3724 states and 5398 transitions. [2021-11-01 16:22:12,305 INFO L78 Accepts]: Start accepts. Automaton has 3724 states and 5398 transitions. Word has length 65 [2021-11-01 16:22:12,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 16:22:12,306 INFO L470 AbstractCegarLoop]: Abstraction has 3724 states and 5398 transitions. [2021-11-01 16:22:12,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:12,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 5398 transitions. [2021-11-01 16:22:12,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-01 16:22:12,311 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 16:22:12,311 INFO L514 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] [2021-11-01 16:22:12,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-01 16:22:12,311 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-01 16:22:12,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 16:22:12,312 INFO L85 PathProgramCache]: Analyzing trace with hash 736484461, now seen corresponding path program 1 times [2021-11-01 16:22:12,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 16:22:12,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595279622] [2021-11-01 16:22:12,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 16:22:12,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 16:22:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 16:22:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 16:22:12,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 16:22:12,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595279622] [2021-11-01 16:22:12,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595279622] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 16:22:12,388 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 16:22:12,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-01 16:22:12,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444004456] [2021-11-01 16:22:12,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-01 16:22:12,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 16:22:12,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-01 16:22:12,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 16:22:12,390 INFO L87 Difference]: Start difference. First operand 3724 states and 5398 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:13,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 16:22:13,509 INFO L93 Difference]: Finished difference Result 9229 states and 13444 transitions. [2021-11-01 16:22:13,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-01 16:22:13,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-01 16:22:13,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 16:22:13,529 INFO L225 Difference]: With dead ends: 9229 [2021-11-01 16:22:13,530 INFO L226 Difference]: Without dead ends: 5523 [2021-11-01 16:22:13,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.58ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 16:22:13,536 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 373 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 811.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.54ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1025.23ms IncrementalHoareTripleChecker+Time [2021-11-01 16:22:13,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 0 Invalid, 1123 Unknown, 0 Unchecked, 1.54ms Time], IncrementalHoareTripleChecker [13 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 1025.23ms Time] [2021-11-01 16:22:13,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5523 states. [2021-11-01 16:22:13,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5523 to 5497. [2021-11-01 16:22:13,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5497 states, 5492 states have (on average 1.4482884195193009) internal successors, (7954), 5496 states have internal predecessors, (7954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5497 states to 5497 states and 7954 transitions. [2021-11-01 16:22:13,699 INFO L78 Accepts]: Start accepts. Automaton has 5497 states and 7954 transitions. Word has length 69 [2021-11-01 16:22:13,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 16:22:13,699 INFO L470 AbstractCegarLoop]: Abstraction has 5497 states and 7954 transitions. [2021-11-01 16:22:13,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:13,699 INFO L276 IsEmpty]: Start isEmpty. Operand 5497 states and 7954 transitions. [2021-11-01 16:22:13,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-01 16:22:13,706 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 16:22:13,706 INFO L514 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] [2021-11-01 16:22:13,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-01 16:22:13,707 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-01 16:22:13,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 16:22:13,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1469644628, now seen corresponding path program 1 times [2021-11-01 16:22:13,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 16:22:13,708 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384484016] [2021-11-01 16:22:13,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 16:22:13,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 16:22:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 16:22:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-01 16:22:13,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 16:22:13,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384484016] [2021-11-01 16:22:13,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384484016] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-01 16:22:13,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450485055] [2021-11-01 16:22:13,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 16:22:13,810 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-01 16:22:13,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-01 16:22:13,816 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-01 16:22:13,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-01 16:22:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 16:22:14,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-01 16:22:14,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 16:22:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-01 16:22:14,351 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-01 16:22:14,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450485055] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 16:22:14,351 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-01 16:22:14,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2021-11-01 16:22:14,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808683759] [2021-11-01 16:22:14,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-01 16:22:14,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 16:22:14,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-01 16:22:14,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-01 16:22:14,353 INFO L87 Difference]: Start difference. First operand 5497 states and 7954 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:15,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 16:22:15,771 INFO L93 Difference]: Finished difference Result 11734 states and 16923 transitions. [2021-11-01 16:22:15,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-01 16:22:15,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-01 16:22:15,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 16:22:15,792 INFO L225 Difference]: With dead ends: 11734 [2021-11-01 16:22:15,792 INFO L226 Difference]: Without dead ends: 5562 [2021-11-01 16:22:15,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.51ms TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-01 16:22:15,802 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1016.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.52ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1280.74ms IncrementalHoareTripleChecker+Time [2021-11-01 16:22:15,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 1728 Unknown, 0 Unchecked, 2.52ms Time], IncrementalHoareTripleChecker [2 Valid, 1726 Invalid, 0 Unknown, 0 Unchecked, 1280.74ms Time] [2021-11-01 16:22:15,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5562 states. [2021-11-01 16:22:15,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5562 to 5440. [2021-11-01 16:22:15,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5440 states, 5435 states have (on average 1.4437902483900644) internal successors, (7847), 5439 states have internal predecessors, (7847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:15,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5440 states to 5440 states and 7847 transitions. [2021-11-01 16:22:15,988 INFO L78 Accepts]: Start accepts. Automaton has 5440 states and 7847 transitions. Word has length 75 [2021-11-01 16:22:15,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 16:22:15,988 INFO L470 AbstractCegarLoop]: Abstraction has 5440 states and 7847 transitions. [2021-11-01 16:22:15,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:15,989 INFO L276 IsEmpty]: Start isEmpty. Operand 5440 states and 7847 transitions. [2021-11-01 16:22:15,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-01 16:22:15,991 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 16:22:15,991 INFO L514 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] [2021-11-01 16:22:16,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-01 16:22:16,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-01 16:22:16,207 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-01 16:22:16,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 16:22:16,208 INFO L85 PathProgramCache]: Analyzing trace with hash 9935809, now seen corresponding path program 1 times [2021-11-01 16:22:16,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 16:22:16,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538240890] [2021-11-01 16:22:16,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 16:22:16,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 16:22:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 16:22:16,290 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-01 16:22:16,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 16:22:16,291 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538240890] [2021-11-01 16:22:16,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538240890] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 16:22:16,291 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 16:22:16,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-01 16:22:16,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555458553] [2021-11-01 16:22:16,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-01 16:22:16,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 16:22:16,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-01 16:22:16,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 16:22:16,292 INFO L87 Difference]: Start difference. First operand 5440 states and 7847 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:16,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 16:22:16,956 INFO L93 Difference]: Finished difference Result 10826 states and 15619 transitions. [2021-11-01 16:22:16,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-01 16:22:16,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-11-01 16:22:16,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 16:22:16,976 INFO L225 Difference]: With dead ends: 10826 [2021-11-01 16:22:16,977 INFO L226 Difference]: Without dead ends: 5404 [2021-11-01 16:22:16,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.77ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 16:22:16,987 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 391 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 401.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.56ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 528.36ms IncrementalHoareTripleChecker+Time [2021-11-01 16:22:16,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 0 Invalid, 428 Unknown, 0 Unchecked, 0.56ms Time], IncrementalHoareTripleChecker [0 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 528.36ms Time] [2021-11-01 16:22:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5404 states. [2021-11-01 16:22:17,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5404 to 5404. [2021-11-01 16:22:17,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5404 states, 5399 states have (on average 1.4400814965734394) internal successors, (7775), 5403 states have internal predecessors, (7775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:17,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5404 states to 5404 states and 7775 transitions. [2021-11-01 16:22:17,112 INFO L78 Accepts]: Start accepts. Automaton has 5404 states and 7775 transitions. Word has length 77 [2021-11-01 16:22:17,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 16:22:17,113 INFO L470 AbstractCegarLoop]: Abstraction has 5404 states and 7775 transitions. [2021-11-01 16:22:17,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:17,113 INFO L276 IsEmpty]: Start isEmpty. Operand 5404 states and 7775 transitions. [2021-11-01 16:22:17,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-01 16:22:17,120 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 16:22:17,120 INFO L514 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] [2021-11-01 16:22:17,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-01 16:22:17,120 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-01 16:22:17,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 16:22:17,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1410017757, now seen corresponding path program 1 times [2021-11-01 16:22:17,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 16:22:17,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687767936] [2021-11-01 16:22:17,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 16:22:17,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 16:22:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 16:22:17,204 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-01 16:22:17,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 16:22:17,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687767936] [2021-11-01 16:22:17,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687767936] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-01 16:22:17,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231134745] [2021-11-01 16:22:17,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 16:22:17,205 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-01 16:22:17,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-01 16:22:17,206 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-01 16:22:17,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-01 16:22:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 16:22:17,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-01 16:22:17,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 16:22:17,670 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-01 16:22:17,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-01 16:22:17,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231134745] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 16:22:17,670 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-01 16:22:17,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-11-01 16:22:17,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462581758] [2021-11-01 16:22:17,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-01 16:22:17,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 16:22:17,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-01 16:22:17,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-01 16:22:17,672 INFO L87 Difference]: Start difference. First operand 5404 states and 7775 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:19,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 16:22:19,235 INFO L93 Difference]: Finished difference Result 16164 states and 23270 transitions. [2021-11-01 16:22:19,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-01 16:22:19,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-11-01 16:22:19,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 16:22:19,271 INFO L225 Difference]: With dead ends: 16164 [2021-11-01 16:22:19,271 INFO L226 Difference]: Without dead ends: 16152 [2021-11-01 16:22:19,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.67ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-01 16:22:19,278 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 813 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 1574 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1058.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.50ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1355.36ms IncrementalHoareTripleChecker+Time [2021-11-01 16:22:19,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [813 Valid, 0 Invalid, 1584 Unknown, 0 Unchecked, 2.50ms Time], IncrementalHoareTripleChecker [10 Valid, 1574 Invalid, 0 Unknown, 0 Unchecked, 1355.36ms Time] [2021-11-01 16:22:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16152 states. [2021-11-01 16:22:19,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16152 to 15962. [2021-11-01 16:22:19,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15962 states, 15957 states have (on average 1.4450084602368867) internal successors, (23058), 15961 states have internal predecessors, (23058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15962 states to 15962 states and 23058 transitions. [2021-11-01 16:22:19,731 INFO L78 Accepts]: Start accepts. Automaton has 15962 states and 23058 transitions. Word has length 78 [2021-11-01 16:22:19,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 16:22:19,731 INFO L470 AbstractCegarLoop]: Abstraction has 15962 states and 23058 transitions. [2021-11-01 16:22:19,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:19,732 INFO L276 IsEmpty]: Start isEmpty. Operand 15962 states and 23058 transitions. [2021-11-01 16:22:19,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-01 16:22:19,739 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 16:22:19,740 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-01 16:22:19,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-01 16:22:19,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-01 16:22:19,965 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-01 16:22:19,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 16:22:19,965 INFO L85 PathProgramCache]: Analyzing trace with hash 552854658, now seen corresponding path program 1 times [2021-11-01 16:22:19,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 16:22:19,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541981502] [2021-11-01 16:22:19,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 16:22:19,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 16:22:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 16:22:20,036 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-01 16:22:20,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 16:22:20,036 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541981502] [2021-11-01 16:22:20,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541981502] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 16:22:20,037 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 16:22:20,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-01 16:22:20,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078773250] [2021-11-01 16:22:20,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-01 16:22:20,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 16:22:20,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-01 16:22:20,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 16:22:20,038 INFO L87 Difference]: Start difference. First operand 15962 states and 23058 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:20,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 16:22:20,840 INFO L93 Difference]: Finished difference Result 20871 states and 30413 transitions. [2021-11-01 16:22:20,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-01 16:22:20,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-11-01 16:22:20,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 16:22:20,848 INFO L225 Difference]: With dead ends: 20871 [2021-11-01 16:22:20,848 INFO L226 Difference]: Without dead ends: 4785 [2021-11-01 16:22:20,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.68ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 16:22:20,868 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 187 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 480.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.89ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 630.65ms IncrementalHoareTripleChecker+Time [2021-11-01 16:22:20,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 0 Invalid, 757 Unknown, 0 Unchecked, 0.89ms Time], IncrementalHoareTripleChecker [1 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 630.65ms Time] [2021-11-01 16:22:20,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4785 states. [2021-11-01 16:22:20,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4785 to 4785. [2021-11-01 16:22:20,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4785 states, 4784 states have (on average 1.473871237458194) internal successors, (7051), 4784 states have internal predecessors, (7051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4785 states to 4785 states and 7051 transitions. [2021-11-01 16:22:20,977 INFO L78 Accepts]: Start accepts. Automaton has 4785 states and 7051 transitions. Word has length 86 [2021-11-01 16:22:20,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 16:22:20,978 INFO L470 AbstractCegarLoop]: Abstraction has 4785 states and 7051 transitions. [2021-11-01 16:22:20,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:20,978 INFO L276 IsEmpty]: Start isEmpty. Operand 4785 states and 7051 transitions. [2021-11-01 16:22:20,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-01 16:22:20,984 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 16:22:20,985 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 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] [2021-11-01 16:22:20,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-01 16:22:20,985 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-01 16:22:20,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 16:22:20,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1293494006, now seen corresponding path program 1 times [2021-11-01 16:22:20,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 16:22:20,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404796363] [2021-11-01 16:22:20,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 16:22:20,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 16:22:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 16:22:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-01 16:22:21,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 16:22:21,106 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404796363] [2021-11-01 16:22:21,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404796363] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 16:22:21,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 16:22:21,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-01 16:22:21,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367062046] [2021-11-01 16:22:21,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-01 16:22:21,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 16:22:21,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-01 16:22:21,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 16:22:21,109 INFO L87 Difference]: Start difference. First operand 4785 states and 7051 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:22,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 16:22:22,389 INFO L93 Difference]: Finished difference Result 14310 states and 21099 transitions. [2021-11-01 16:22:22,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-01 16:22:22,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-01 16:22:22,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 16:22:22,406 INFO L225 Difference]: With dead ends: 14310 [2021-11-01 16:22:22,461 INFO L226 Difference]: Without dead ends: 9543 [2021-11-01 16:22:22,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.76ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 16:22:22,470 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 379 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 831.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.47ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1083.98ms IncrementalHoareTripleChecker+Time [2021-11-01 16:22:22,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 0 Invalid, 895 Unknown, 0 Unchecked, 1.47ms Time], IncrementalHoareTripleChecker [4 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 1083.98ms Time] [2021-11-01 16:22:22,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9543 states. [2021-11-01 16:22:22,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9543 to 4788. [2021-11-01 16:22:22,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4788 states, 4787 states have (on average 1.4735742636306663) internal successors, (7054), 4787 states have internal predecessors, (7054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:22,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4788 states to 4788 states and 7054 transitions. [2021-11-01 16:22:22,662 INFO L78 Accepts]: Start accepts. Automaton has 4788 states and 7054 transitions. Word has length 87 [2021-11-01 16:22:22,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 16:22:22,662 INFO L470 AbstractCegarLoop]: Abstraction has 4788 states and 7054 transitions. [2021-11-01 16:22:22,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:22,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4788 states and 7054 transitions. [2021-11-01 16:22:22,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-01 16:22:22,668 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 16:22:22,668 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 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, 1, 1] [2021-11-01 16:22:22,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-01 16:22:22,669 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-01 16:22:22,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 16:22:22,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1610575735, now seen corresponding path program 1 times [2021-11-01 16:22:22,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 16:22:22,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144340450] [2021-11-01 16:22:22,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 16:22:22,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 16:22:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 16:22:22,789 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-01 16:22:22,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 16:22:22,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144340450] [2021-11-01 16:22:22,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144340450] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 16:22:22,790 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 16:22:22,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-01 16:22:22,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168128689] [2021-11-01 16:22:22,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-01 16:22:22,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 16:22:22,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-01 16:22:22,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-01 16:22:22,792 INFO L87 Difference]: Start difference. First operand 4788 states and 7054 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:23,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 16:22:23,329 INFO L93 Difference]: Finished difference Result 5158 states and 7559 transitions. [2021-11-01 16:22:23,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-01 16:22:23,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-11-01 16:22:23,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 16:22:23,331 INFO L225 Difference]: With dead ends: 5158 [2021-11-01 16:22:23,331 INFO L226 Difference]: Without dead ends: 0 [2021-11-01 16:22:23,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.72ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-01 16:22:23,338 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 215 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 363.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.87ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 496.83ms IncrementalHoareTripleChecker+Time [2021-11-01 16:22:23,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 0 Invalid, 340 Unknown, 0 Unchecked, 0.87ms Time], IncrementalHoareTripleChecker [3 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 496.83ms Time] [2021-11-01 16:22:23,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-01 16:22:23,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-01 16:22:23,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-01 16:22:23,339 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2021-11-01 16:22:23,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 16:22:23,339 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-01 16:22:23,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 16:22:23,340 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-01 16:22:23,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-01 16:22:23,342 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-11-01 16:22:23,343 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-11-01 16:22:23,343 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2021-11-01 16:22:23,343 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2021-11-01 16:22:23,343 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-11-01 16:22:23,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-01 16:22:23,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-01 16:22:23,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:23,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 16:22:25,162 INFO L861 garLoopResultBuilder]: At program point L2876(lines 2871 2878) the Hoare annotation is: true [2021-11-01 16:22:25,162 INFO L854 garLoopResultBuilder]: At program point L2876-2(lines 2871 2878) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0) (= |ULTIMATE.start_kmalloc_#res.base| 0)) [2021-11-01 16:22:25,163 INFO L854 garLoopResultBuilder]: At program point L2876-1(lines 2871 2878) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0) (= |ULTIMATE.start_kmalloc_#res.base| 0)) [2021-11-01 16:22:25,163 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 2013) no Hoare annotation was computed. [2021-11-01 16:22:25,163 INFO L858 garLoopResultBuilder]: For program point L2744(lines 2744 2748) no Hoare annotation was computed. [2021-11-01 16:22:25,163 INFO L854 garLoopResultBuilder]: At program point L2876-3(lines 2871 2878) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,163 INFO L858 garLoopResultBuilder]: For program point L2744-2(lines 2723 2773) no Hoare annotation was computed. [2021-11-01 16:22:25,163 INFO L858 garLoopResultBuilder]: For program point L2282(lines 2282 2285) no Hoare annotation was computed. [2021-11-01 16:22:25,163 INFO L858 garLoopResultBuilder]: For program point L2282-2(lines 2282 2285) no Hoare annotation was computed. [2021-11-01 16:22:25,164 INFO L858 garLoopResultBuilder]: For program point L2150(lines 2150 2153) no Hoare annotation was computed. [2021-11-01 16:22:25,164 INFO L858 garLoopResultBuilder]: For program point L2282-3(lines 2282 2285) no Hoare annotation was computed. [2021-11-01 16:22:25,164 INFO L858 garLoopResultBuilder]: For program point L2282-6(lines 2282 2285) no Hoare annotation was computed. [2021-11-01 16:22:25,164 INFO L854 garLoopResultBuilder]: At program point L2084(lines 2081 2086) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-01 16:22:25,164 INFO L858 garLoopResultBuilder]: For program point L2150-2(lines 2150 2153) no Hoare annotation was computed. [2021-11-01 16:22:25,164 INFO L858 garLoopResultBuilder]: For program point L2150-1(lines 2150 2153) no Hoare annotation was computed. [2021-11-01 16:22:25,165 INFO L858 garLoopResultBuilder]: For program point L2282-5(lines 2282 2285) no Hoare annotation was computed. [2021-11-01 16:22:25,165 INFO L858 garLoopResultBuilder]: For program point L2282-8(lines 2282 2285) no Hoare annotation was computed. [2021-11-01 16:22:25,165 INFO L858 garLoopResultBuilder]: For program point L2150-3(lines 2150 2153) no Hoare annotation was computed. [2021-11-01 16:22:25,165 INFO L854 garLoopResultBuilder]: At program point L2151-1(lines 2142 2154) the Hoare annotation is: false [2021-11-01 16:22:25,165 INFO L854 garLoopResultBuilder]: At program point L2151(lines 2142 2154) the Hoare annotation is: false [2021-11-01 16:22:25,165 INFO L854 garLoopResultBuilder]: At program point L2151-3(lines 2142 2154) the Hoare annotation is: false [2021-11-01 16:22:25,165 INFO L854 garLoopResultBuilder]: At program point L2151-2(lines 2142 2154) the Hoare annotation is: false [2021-11-01 16:22:25,166 INFO L861 garLoopResultBuilder]: At program point L2019(lines 2018 2021) the Hoare annotation is: true [2021-11-01 16:22:25,166 INFO L861 garLoopResultBuilder]: At program point L2019-1(lines 2018 2021) the Hoare annotation is: true [2021-11-01 16:22:25,166 INFO L861 garLoopResultBuilder]: At program point L2019-2(lines 2018 2021) the Hoare annotation is: true [2021-11-01 16:22:25,166 INFO L861 garLoopResultBuilder]: At program point L2019-3(lines 2018 2021) the Hoare annotation is: true [2021-11-01 16:22:25,166 INFO L861 garLoopResultBuilder]: At program point L2019-4(lines 2018 2021) the Hoare annotation is: true [2021-11-01 16:22:25,166 INFO L858 garLoopResultBuilder]: For program point L2813(line 2813) no Hoare annotation was computed. [2021-11-01 16:22:25,166 INFO L858 garLoopResultBuilder]: For program point L3078(lines 3078 3080) no Hoare annotation was computed. [2021-11-01 16:22:25,166 INFO L858 garLoopResultBuilder]: For program point L3078-2(lines 3078 3080) no Hoare annotation was computed. [2021-11-01 16:22:25,166 INFO L861 garLoopResultBuilder]: At program point L3078-1(lines 1 3080) the Hoare annotation is: true [2021-11-01 16:22:25,166 INFO L858 garLoopResultBuilder]: For program point L3078-4(lines 3078 3080) no Hoare annotation was computed. [2021-11-01 16:22:25,167 INFO L854 garLoopResultBuilder]: At program point L3078-3(lines 1 3080) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0) (= |ULTIMATE.start_kmalloc_#res.base| 0)) [2021-11-01 16:22:25,167 INFO L854 garLoopResultBuilder]: At program point L3078-5(lines 1 3080) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,167 INFO L858 garLoopResultBuilder]: For program point L2814(lines 2814 2819) no Hoare annotation was computed. [2021-11-01 16:22:25,167 INFO L858 garLoopResultBuilder]: For program point L1956(lines 1956 1958) no Hoare annotation was computed. [2021-11-01 16:22:25,167 INFO L858 garLoopResultBuilder]: For program point L1956-1(lines 1956 1958) no Hoare annotation was computed. [2021-11-01 16:22:25,170 INFO L858 garLoopResultBuilder]: For program point L1956-2(lines 1956 1958) no Hoare annotation was computed. [2021-11-01 16:22:25,170 INFO L854 garLoopResultBuilder]: At program point L1890(lines 1885 1892) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,170 INFO L858 garLoopResultBuilder]: For program point L1956-3(lines 1956 1958) no Hoare annotation was computed. [2021-11-01 16:22:25,171 INFO L858 garLoopResultBuilder]: For program point L1956-4(lines 1956 1958) no Hoare annotation was computed. [2021-11-01 16:22:25,171 INFO L858 garLoopResultBuilder]: For program point L1956-5(lines 1956 1958) no Hoare annotation was computed. [2021-11-01 16:22:25,171 INFO L858 garLoopResultBuilder]: For program point L1956-6(lines 1956 1958) no Hoare annotation was computed. [2021-11-01 16:22:25,171 INFO L858 garLoopResultBuilder]: For program point L2683(line 2683) no Hoare annotation was computed. [2021-11-01 16:22:25,171 INFO L858 garLoopResultBuilder]: For program point L2287(lines 2287 2290) no Hoare annotation was computed. [2021-11-01 16:22:25,171 INFO L858 garLoopResultBuilder]: For program point L2287-3(lines 2287 2290) no Hoare annotation was computed. [2021-11-01 16:22:25,171 INFO L858 garLoopResultBuilder]: For program point L2287-2(lines 2287 2290) no Hoare annotation was computed. [2021-11-01 16:22:25,172 INFO L858 garLoopResultBuilder]: For program point L2287-5(lines 2287 2290) no Hoare annotation was computed. [2021-11-01 16:22:25,172 INFO L858 garLoopResultBuilder]: For program point L2287-6(lines 2287 2290) no Hoare annotation was computed. [2021-11-01 16:22:25,172 INFO L858 garLoopResultBuilder]: For program point L2287-8(lines 2287 2290) no Hoare annotation was computed. [2021-11-01 16:22:25,172 INFO L858 garLoopResultBuilder]: For program point L1957(line 1957) no Hoare annotation was computed. [2021-11-01 16:22:25,172 INFO L858 garLoopResultBuilder]: For program point L1957-2(line 1957) no Hoare annotation was computed. [2021-11-01 16:22:25,172 INFO L858 garLoopResultBuilder]: For program point L1957-4(line 1957) no Hoare annotation was computed. [2021-11-01 16:22:25,172 INFO L858 garLoopResultBuilder]: For program point L1957-6(line 1957) no Hoare annotation was computed. [2021-11-01 16:22:25,173 INFO L858 garLoopResultBuilder]: For program point L2684(lines 2684 2718) no Hoare annotation was computed. [2021-11-01 16:22:25,173 INFO L858 garLoopResultBuilder]: For program point L1957-8(line 1957) no Hoare annotation was computed. [2021-11-01 16:22:25,173 INFO L858 garLoopResultBuilder]: For program point L1957-10(line 1957) no Hoare annotation was computed. [2021-11-01 16:22:25,173 INFO L858 garLoopResultBuilder]: For program point L1957-12(line 1957) no Hoare annotation was computed. [2021-11-01 16:22:25,173 INFO L854 garLoopResultBuilder]: At program point L2157-1(lines 2130 2163) the Hoare annotation is: false [2021-11-01 16:22:25,173 INFO L858 garLoopResultBuilder]: For program point L2157(lines 2157 2160) no Hoare annotation was computed. [2021-11-01 16:22:25,173 INFO L854 garLoopResultBuilder]: At program point L2157-3(lines 2130 2163) the Hoare annotation is: false [2021-11-01 16:22:25,174 INFO L858 garLoopResultBuilder]: For program point L2157-2(lines 2157 2160) no Hoare annotation was computed. [2021-11-01 16:22:25,174 INFO L854 garLoopResultBuilder]: At program point L2157-5(lines 2130 2163) the Hoare annotation is: false [2021-11-01 16:22:25,174 INFO L858 garLoopResultBuilder]: For program point L2157-4(lines 2157 2160) no Hoare annotation was computed. [2021-11-01 16:22:25,174 INFO L854 garLoopResultBuilder]: At program point L2157-7(lines 2130 2163) the Hoare annotation is: false [2021-11-01 16:22:25,174 INFO L858 garLoopResultBuilder]: For program point L2157-6(lines 2157 2160) no Hoare annotation was computed. [2021-11-01 16:22:25,174 INFO L854 garLoopResultBuilder]: At program point L2884(lines 2880 2886) the Hoare annotation is: false [2021-11-01 16:22:25,174 INFO L858 garLoopResultBuilder]: For program point L2686(lines 2686 2715) no Hoare annotation was computed. [2021-11-01 16:22:25,174 INFO L858 garLoopResultBuilder]: For program point L2488(lines 2488 2496) no Hoare annotation was computed. [2021-11-01 16:22:25,175 INFO L854 garLoopResultBuilder]: At program point L2951(lines 2950 2952) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,175 INFO L858 garLoopResultBuilder]: For program point L2687(line 2687) no Hoare annotation was computed. [2021-11-01 16:22:25,175 INFO L858 garLoopResultBuilder]: For program point L2489(lines 2489 2492) no Hoare annotation was computed. [2021-11-01 16:22:25,175 INFO L858 garLoopResultBuilder]: For program point L2489-2(lines 2489 2492) no Hoare annotation was computed. [2021-11-01 16:22:25,175 INFO L858 garLoopResultBuilder]: For program point L2291(lines 2291 2294) no Hoare annotation was computed. [2021-11-01 16:22:25,175 INFO L858 garLoopResultBuilder]: For program point L2291-3(lines 2291 2294) no Hoare annotation was computed. [2021-11-01 16:22:25,175 INFO L858 garLoopResultBuilder]: For program point L2291-2(lines 2291 2294) no Hoare annotation was computed. [2021-11-01 16:22:25,176 INFO L858 garLoopResultBuilder]: For program point L2291-5(lines 2291 2294) no Hoare annotation was computed. [2021-11-01 16:22:25,176 INFO L858 garLoopResultBuilder]: For program point L2291-6(lines 2291 2294) no Hoare annotation was computed. [2021-11-01 16:22:25,176 INFO L858 garLoopResultBuilder]: For program point L2291-8(lines 2291 2294) no Hoare annotation was computed. [2021-11-01 16:22:25,176 INFO L858 garLoopResultBuilder]: For program point L2688(lines 2688 2693) no Hoare annotation was computed. [2021-11-01 16:22:25,176 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 2013) no Hoare annotation was computed. [2021-11-01 16:22:25,176 INFO L861 garLoopResultBuilder]: At program point L1896(lines 1893 1898) the Hoare annotation is: true [2021-11-01 16:22:25,176 INFO L854 garLoopResultBuilder]: At program point L1896-1(lines 1893 1898) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0) (= |ULTIMATE.start_kmalloc_#res.base| 0)) [2021-11-01 16:22:25,176 INFO L854 garLoopResultBuilder]: At program point L1896-2(lines 1893 1898) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,177 INFO L858 garLoopResultBuilder]: For program point L2821(line 2821) no Hoare annotation was computed. [2021-11-01 16:22:25,177 INFO L858 garLoopResultBuilder]: For program point L2755(line 2755) no Hoare annotation was computed. [2021-11-01 16:22:25,177 INFO L854 garLoopResultBuilder]: At program point L2954(lines 1 3080) the Hoare annotation is: false [2021-11-01 16:22:25,177 INFO L854 garLoopResultBuilder]: At program point L2954-2(lines 1 3080) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-01 16:22:25,177 INFO L854 garLoopResultBuilder]: At program point L2954-1(lines 1 3080) the Hoare annotation is: false [2021-11-01 16:22:25,177 INFO L854 garLoopResultBuilder]: At program point L2954-4(lines 1 3080) the Hoare annotation is: false [2021-11-01 16:22:25,177 INFO L858 garLoopResultBuilder]: For program point L2822(lines 2822 2827) no Hoare annotation was computed. [2021-11-01 16:22:25,178 INFO L854 garLoopResultBuilder]: At program point L2954-3(lines 1 3080) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-01 16:22:25,178 INFO L858 garLoopResultBuilder]: For program point L2756(lines 2756 2761) no Hoare annotation was computed. [2021-11-01 16:22:25,178 INFO L854 garLoopResultBuilder]: At program point L2954-5(lines 1 3080) the Hoare annotation is: false [2021-11-01 16:22:25,178 INFO L858 garLoopResultBuilder]: For program point L2624(lines 2624 2838) no Hoare annotation was computed. [2021-11-01 16:22:25,178 INFO L858 garLoopResultBuilder]: For program point L2558(lines 2558 2561) no Hoare annotation was computed. [2021-11-01 16:22:25,178 INFO L858 garLoopResultBuilder]: For program point L2096(lines 2096 2109) no Hoare annotation was computed. [2021-11-01 16:22:25,179 INFO L854 garLoopResultBuilder]: At program point L2096-2(lines 2087 2112) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-01 16:22:25,179 INFO L858 garLoopResultBuilder]: For program point L2096-3(lines 2096 2109) no Hoare annotation was computed. [2021-11-01 16:22:25,179 INFO L854 garLoopResultBuilder]: At program point L2096-5(lines 2087 2112) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-01 16:22:25,179 INFO L858 garLoopResultBuilder]: For program point L2625(line 2625) no Hoare annotation was computed. [2021-11-01 16:22:25,179 INFO L858 garLoopResultBuilder]: For program point L2626(lines 2626 2681) no Hoare annotation was computed. [2021-11-01 16:22:25,179 INFO L861 garLoopResultBuilder]: At program point L2296(lines 2274 2312) the Hoare annotation is: true [2021-11-01 16:22:25,179 INFO L854 garLoopResultBuilder]: At program point L2296-2(lines 2274 2312) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,180 INFO L854 garLoopResultBuilder]: At program point L2296-1(lines 2274 2312) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0) (= |ULTIMATE.start_kmalloc_#res.base| 0)) [2021-11-01 16:22:25,180 INFO L858 garLoopResultBuilder]: For program point L1966(lines 1966 1973) no Hoare annotation was computed. [2021-11-01 16:22:25,180 INFO L858 garLoopResultBuilder]: For program point L1966-1(lines 1966 1973) no Hoare annotation was computed. [2021-11-01 16:22:25,180 INFO L858 garLoopResultBuilder]: For program point L1966-2(lines 1966 1973) no Hoare annotation was computed. [2021-11-01 16:22:25,180 INFO L858 garLoopResultBuilder]: For program point L1966-3(lines 1966 1973) no Hoare annotation was computed. [2021-11-01 16:22:25,180 INFO L858 garLoopResultBuilder]: For program point L2892(lines 2892 2895) no Hoare annotation was computed. [2021-11-01 16:22:25,180 INFO L858 garLoopResultBuilder]: For program point L2892-2(lines 2892 2895) no Hoare annotation was computed. [2021-11-01 16:22:25,181 INFO L858 garLoopResultBuilder]: For program point L2892-4(lines 2892 2895) no Hoare annotation was computed. [2021-11-01 16:22:25,181 INFO L858 garLoopResultBuilder]: For program point L2892-6(lines 2892 2895) no Hoare annotation was computed. [2021-11-01 16:22:25,181 INFO L858 garLoopResultBuilder]: For program point L2628(lines 2628 2678) no Hoare annotation was computed. [2021-11-01 16:22:25,181 INFO L858 garLoopResultBuilder]: For program point L2892-8(lines 2892 2895) no Hoare annotation was computed. [2021-11-01 16:22:25,181 INFO L861 garLoopResultBuilder]: At program point L2298(lines 2274 2312) the Hoare annotation is: true [2021-11-01 16:22:25,181 INFO L854 garLoopResultBuilder]: At program point L2298-2(lines 2274 2312) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,181 INFO L854 garLoopResultBuilder]: At program point L2298-1(lines 2274 2312) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0) (= |ULTIMATE.start_kmalloc_#res.base| 0)) [2021-11-01 16:22:25,182 INFO L858 garLoopResultBuilder]: For program point L2695(line 2695) no Hoare annotation was computed. [2021-11-01 16:22:25,182 INFO L858 garLoopResultBuilder]: For program point L2629(line 2629) no Hoare annotation was computed. [2021-11-01 16:22:25,182 INFO L854 garLoopResultBuilder]: At program point L2563(lines 2425 2585) the Hoare annotation is: false [2021-11-01 16:22:25,182 INFO L858 garLoopResultBuilder]: For program point L2431(lines 2431 2435) no Hoare annotation was computed. [2021-11-01 16:22:25,182 INFO L858 garLoopResultBuilder]: For program point L2431-2(lines 2425 2585) no Hoare annotation was computed. [2021-11-01 16:22:25,182 INFO L854 garLoopResultBuilder]: At program point L2960(lines 2846 2853) the Hoare annotation is: false [2021-11-01 16:22:25,182 INFO L858 garLoopResultBuilder]: For program point L2696(lines 2696 2711) no Hoare annotation was computed. [2021-11-01 16:22:25,183 INFO L858 garLoopResultBuilder]: For program point L2630(lines 2630 2634) no Hoare annotation was computed. [2021-11-01 16:22:25,183 INFO L858 garLoopResultBuilder]: For program point L2829(line 2829) no Hoare annotation was computed. [2021-11-01 16:22:25,183 INFO L858 garLoopResultBuilder]: For program point L2763(line 2763) no Hoare annotation was computed. [2021-11-01 16:22:25,183 INFO L854 garLoopResultBuilder]: At program point L2565(lines 2425 2585) the Hoare annotation is: false [2021-11-01 16:22:25,183 INFO L858 garLoopResultBuilder]: For program point L2764(lines 2764 2769) no Hoare annotation was computed. [2021-11-01 16:22:25,183 INFO L858 garLoopResultBuilder]: For program point L2698(lines 2698 2704) no Hoare annotation was computed. [2021-11-01 16:22:25,183 INFO L858 garLoopResultBuilder]: For program point L2698-2(lines 2696 2710) no Hoare annotation was computed. [2021-11-01 16:22:25,183 INFO L861 garLoopResultBuilder]: At program point L2368-2(lines 1 3080) the Hoare annotation is: true [2021-11-01 16:22:25,184 INFO L854 garLoopResultBuilder]: At program point L2368-6(lines 2361 2370) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,184 INFO L858 garLoopResultBuilder]: For program point L2104(lines 2104 2107) no Hoare annotation was computed. [2021-11-01 16:22:25,184 INFO L854 garLoopResultBuilder]: At program point L2368-9(lines 1 3080) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,184 INFO L858 garLoopResultBuilder]: For program point L2104-1(lines 2104 2107) no Hoare annotation was computed. [2021-11-01 16:22:25,184 INFO L861 garLoopResultBuilder]: At program point L1972(lines 1959 1975) the Hoare annotation is: true [2021-11-01 16:22:25,184 INFO L854 garLoopResultBuilder]: At program point L1972-1(lines 1959 1975) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,184 INFO L854 garLoopResultBuilder]: At program point L2963-1(lines 1 3080) the Hoare annotation is: false [2021-11-01 16:22:25,185 INFO L854 garLoopResultBuilder]: At program point L1972-2(lines 1959 1975) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,185 INFO L854 garLoopResultBuilder]: At program point L1972-3(lines 1959 1975) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,185 INFO L854 garLoopResultBuilder]: At program point L2963-2(lines 1 3080) the Hoare annotation is: false [2021-11-01 16:22:25,185 INFO L854 garLoopResultBuilder]: At program point L2105-1(lines 2096 2108) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-01 16:22:25,185 INFO L854 garLoopResultBuilder]: At program point L2105(lines 2096 2108) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-01 16:22:25,185 INFO L858 garLoopResultBuilder]: For program point L2568(lines 2568 2578) no Hoare annotation was computed. [2021-11-01 16:22:25,186 INFO L854 garLoopResultBuilder]: At program point L2568-2(lines 1 3080) the Hoare annotation is: false [2021-11-01 16:22:25,186 INFO L858 garLoopResultBuilder]: For program point L2304(line 2304) no Hoare annotation was computed. [2021-11-01 16:22:25,186 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-01 16:22:25,186 INFO L858 garLoopResultBuilder]: For program point L2304-2(lines 2303 2305) no Hoare annotation was computed. [2021-11-01 16:22:25,186 INFO L858 garLoopResultBuilder]: For program point L2304-3(line 2304) no Hoare annotation was computed. [2021-11-01 16:22:25,186 INFO L858 garLoopResultBuilder]: For program point L2304-6(line 2304) no Hoare annotation was computed. [2021-11-01 16:22:25,186 INFO L858 garLoopResultBuilder]: For program point L2304-5(lines 2303 2305) no Hoare annotation was computed. [2021-11-01 16:22:25,186 INFO L858 garLoopResultBuilder]: For program point L2304-8(lines 2303 2305) no Hoare annotation was computed. [2021-11-01 16:22:25,187 INFO L854 garLoopResultBuilder]: At program point L3031-1(lines 3030 3032) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,187 INFO L854 garLoopResultBuilder]: At program point L3031(lines 3030 3032) the Hoare annotation is: (and (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,187 INFO L854 garLoopResultBuilder]: At program point L3031-2(lines 3030 3032) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,187 INFO L854 garLoopResultBuilder]: At program point L2503(lines 2425 2585) the Hoare annotation is: false [2021-11-01 16:22:25,187 INFO L858 garLoopResultBuilder]: For program point L2305-1(line 2305) no Hoare annotation was computed. [2021-11-01 16:22:25,187 INFO L858 garLoopResultBuilder]: For program point L2305-3(line 2305) no Hoare annotation was computed. [2021-11-01 16:22:25,188 INFO L858 garLoopResultBuilder]: For program point L2305-5(line 2305) no Hoare annotation was computed. [2021-11-01 16:22:25,188 INFO L854 garLoopResultBuilder]: At program point L2966(lines 2862 2869) the Hoare annotation is: false [2021-11-01 16:22:25,188 INFO L854 garLoopResultBuilder]: At program point L2966-2(lines 2862 2869) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,188 INFO L854 garLoopResultBuilder]: At program point L2966-1(lines 2862 2869) the Hoare annotation is: false [2021-11-01 16:22:25,188 INFO L858 garLoopResultBuilder]: For program point L2636(line 2636) no Hoare annotation was computed. [2021-11-01 16:22:25,188 INFO L858 garLoopResultBuilder]: For program point L2637(lines 2637 2641) no Hoare annotation was computed. [2021-11-01 16:22:25,188 INFO L858 garLoopResultBuilder]: For program point L2637-2(lines 2628 2678) no Hoare annotation was computed. [2021-11-01 16:22:25,188 INFO L854 garLoopResultBuilder]: At program point L2505(lines 2425 2585) the Hoare annotation is: false [2021-11-01 16:22:25,189 INFO L861 garLoopResultBuilder]: At program point L2307-1(lines 2265 2313) the Hoare annotation is: true [2021-11-01 16:22:25,189 INFO L858 garLoopResultBuilder]: For program point L2307(lines 2307 2310) no Hoare annotation was computed. [2021-11-01 16:22:25,189 INFO L854 garLoopResultBuilder]: At program point L2307-3(lines 2265 2313) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0) (= |ULTIMATE.start_kmalloc_#res.base| 0)) [2021-11-01 16:22:25,189 INFO L858 garLoopResultBuilder]: For program point L2307-2(lines 2307 2310) no Hoare annotation was computed. [2021-11-01 16:22:25,189 INFO L854 garLoopResultBuilder]: At program point L2307-5(lines 2265 2313) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,189 INFO L858 garLoopResultBuilder]: For program point L2307-4(lines 2307 2310) no Hoare annotation was computed. [2021-11-01 16:22:25,189 INFO L858 garLoopResultBuilder]: For program point L2836(line 2836) no Hoare annotation was computed. [2021-11-01 16:22:25,190 INFO L854 garLoopResultBuilder]: At program point L3035(lines 3034 3036) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,190 INFO L858 garLoopResultBuilder]: For program point L2771(line 2771) no Hoare annotation was computed. [2021-11-01 16:22:25,190 INFO L858 garLoopResultBuilder]: For program point L2573(lines 2573 2576) no Hoare annotation was computed. [2021-11-01 16:22:25,190 INFO L854 garLoopResultBuilder]: At program point L2970(lines 2969 2971) the Hoare annotation is: false [2021-11-01 16:22:25,190 INFO L854 garLoopResultBuilder]: At program point L2970-1(lines 2969 2971) the Hoare annotation is: false [2021-11-01 16:22:25,190 INFO L854 garLoopResultBuilder]: At program point L2574(lines 1 3080) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,190 INFO L858 garLoopResultBuilder]: For program point L2508(lines 2508 2515) no Hoare annotation was computed. [2021-11-01 16:22:25,191 INFO L858 garLoopResultBuilder]: For program point L2508-2(lines 2425 2585) no Hoare annotation was computed. [2021-11-01 16:22:25,191 INFO L854 garLoopResultBuilder]: At program point L2839(lines 2609 2844) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-01 16:22:25,191 INFO L861 garLoopResultBuilder]: At program point L2707(lines 1 3080) the Hoare annotation is: true [2021-11-01 16:22:25,191 INFO L854 garLoopResultBuilder]: At program point L2179(lines 2173 2181) the Hoare annotation is: false [2021-11-01 16:22:25,191 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-01 16:22:25,191 INFO L854 garLoopResultBuilder]: At program point L3038(lines 3037 3039) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,192 INFO L858 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2021-11-01 16:22:25,192 INFO L858 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2021-11-01 16:22:25,192 INFO L858 garLoopResultBuilder]: For program point L-1-3(line -1) no Hoare annotation was computed. [2021-11-01 16:22:25,192 INFO L858 garLoopResultBuilder]: For program point L-1-4(line -1) no Hoare annotation was computed. [2021-11-01 16:22:25,192 INFO L858 garLoopResultBuilder]: For program point L-1-5(line -1) no Hoare annotation was computed. [2021-11-01 16:22:25,192 INFO L858 garLoopResultBuilder]: For program point L-1-6(line -1) no Hoare annotation was computed. [2021-11-01 16:22:25,192 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2013) no Hoare annotation was computed. [2021-11-01 16:22:25,192 INFO L858 garLoopResultBuilder]: For program point L2510(lines 2510 2513) no Hoare annotation was computed. [2021-11-01 16:22:25,193 INFO L854 garLoopResultBuilder]: At program point L2973-1(lines 2972 2974) the Hoare annotation is: (and (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,193 INFO L854 garLoopResultBuilder]: At program point L2973(lines 2972 2974) the Hoare annotation is: (and (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,193 INFO L854 garLoopResultBuilder]: At program point L2973-3(lines 2972 2974) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,193 INFO L854 garLoopResultBuilder]: At program point L2973-2(lines 2972 2974) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,193 INFO L854 garLoopResultBuilder]: At program point L2973-5(lines 2972 2974) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,193 INFO L854 garLoopResultBuilder]: At program point L2973-4(lines 2972 2974) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,194 INFO L858 garLoopResultBuilder]: For program point L2445(lines 2445 2448) no Hoare annotation was computed. [2021-11-01 16:22:25,194 INFO L858 garLoopResultBuilder]: For program point L2379-1(lines 2379 2382) no Hoare annotation was computed. [2021-11-01 16:22:25,194 INFO L858 garLoopResultBuilder]: For program point L2379(lines 2379 2382) no Hoare annotation was computed. [2021-11-01 16:22:25,194 INFO L858 garLoopResultBuilder]: For program point L2379-2(lines 2379 2382) no Hoare annotation was computed. [2021-11-01 16:22:25,194 INFO L858 garLoopResultBuilder]: For program point L1983(lines 1983 1990) no Hoare annotation was computed. [2021-11-01 16:22:25,194 INFO L858 garLoopResultBuilder]: For program point L1983-1(lines 1983 1990) no Hoare annotation was computed. [2021-11-01 16:22:25,194 INFO L858 garLoopResultBuilder]: For program point L1983-2(lines 1983 1990) no Hoare annotation was computed. [2021-11-01 16:22:25,195 INFO L854 garLoopResultBuilder]: At program point L2116(lines 1 3080) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,195 INFO L854 garLoopResultBuilder]: At program point L2116-2(lines 2113 2118) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-01 16:22:25,195 INFO L854 garLoopResultBuilder]: At program point L2116-1(lines 2113 2118) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-01 16:22:25,195 INFO L861 garLoopResultBuilder]: At program point L2843(lines 2596 2845) the Hoare annotation is: true [2021-11-01 16:22:25,195 INFO L858 garLoopResultBuilder]: For program point L2778(line 2778) no Hoare annotation was computed. [2021-11-01 16:22:25,195 INFO L858 garLoopResultBuilder]: For program point L2779(lines 2779 2834) no Hoare annotation was computed. [2021-11-01 16:22:25,195 INFO L858 garLoopResultBuilder]: For program point L2713(line 2713) no Hoare annotation was computed. [2021-11-01 16:22:25,196 INFO L858 garLoopResultBuilder]: For program point L2383(lines 2383 2397) no Hoare annotation was computed. [2021-11-01 16:22:25,196 INFO L858 garLoopResultBuilder]: For program point L2383-3(lines 2383 2397) no Hoare annotation was computed. [2021-11-01 16:22:25,196 INFO L858 garLoopResultBuilder]: For program point L2383-2(lines 2383 2397) no Hoare annotation was computed. [2021-11-01 16:22:25,196 INFO L858 garLoopResultBuilder]: For program point L2383-5(lines 2383 2397) no Hoare annotation was computed. [2021-11-01 16:22:25,196 INFO L858 garLoopResultBuilder]: For program point L2383-6(lines 2383 2397) no Hoare annotation was computed. [2021-11-01 16:22:25,196 INFO L858 garLoopResultBuilder]: For program point L2383-8(lines 2383 2397) no Hoare annotation was computed. [2021-11-01 16:22:25,196 INFO L858 garLoopResultBuilder]: For program point L2648(line 2648) no Hoare annotation was computed. [2021-11-01 16:22:25,197 INFO L854 garLoopResultBuilder]: At program point L2450(lines 2425 2585) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,197 INFO L858 garLoopResultBuilder]: For program point L2516-1(lines 2425 2585) no Hoare annotation was computed. [2021-11-01 16:22:25,197 INFO L854 garLoopResultBuilder]: At program point L2186(lines 2182 2188) the Hoare annotation is: false [2021-11-01 16:22:25,197 INFO L854 garLoopResultBuilder]: At program point L2186-1(lines 2182 2188) the Hoare annotation is: false [2021-11-01 16:22:25,197 INFO L858 garLoopResultBuilder]: For program point L2781(lines 2781 2831) no Hoare annotation was computed. [2021-11-01 16:22:25,197 INFO L858 garLoopResultBuilder]: For program point L2649(lines 2649 2653) no Hoare annotation was computed. [2021-11-01 16:22:25,197 INFO L858 garLoopResultBuilder]: For program point L2649-2(lines 2628 2678) no Hoare annotation was computed. [2021-11-01 16:22:25,197 INFO L854 garLoopResultBuilder]: At program point L1989(lines 1976 1992) the Hoare annotation is: (and (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,198 INFO L854 garLoopResultBuilder]: At program point L1989-1(lines 1976 1992) the Hoare annotation is: (and (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,198 INFO L854 garLoopResultBuilder]: At program point L1989-2(lines 1976 1992) the Hoare annotation is: (and (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,198 INFO L858 garLoopResultBuilder]: For program point L2782(line 2782) no Hoare annotation was computed. [2021-11-01 16:22:25,198 INFO L854 garLoopResultBuilder]: At program point L2584(lines 2414 2586) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 1)) (.cse1 (<= (+ ~nwriters_stress~0 1) 0))) (or (and .cse0 (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (<= (+ |ULTIMATE.start_lock_torture_init_#res| 12) 0) .cse1) (and .cse0 .cse1 (<= (+ |ULTIMATE.start_lock_torture_init_#res| 16) 0)))) [2021-11-01 16:22:25,198 INFO L858 garLoopResultBuilder]: For program point L2518(lines 2518 2521) no Hoare annotation was computed. [2021-11-01 16:22:25,198 INFO L854 garLoopResultBuilder]: At program point L2452(lines 2425 2585) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,199 INFO L858 garLoopResultBuilder]: For program point L2783(lines 2783 2787) no Hoare annotation was computed. [2021-11-01 16:22:25,199 INFO L854 garLoopResultBuilder]: At program point L2982(lines 2981 2983) the Hoare annotation is: (and (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,199 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 2013) no Hoare annotation was computed. [2021-11-01 16:22:25,199 INFO L854 garLoopResultBuilder]: At program point L3049-1(lines 3048 3050) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0) (= |ULTIMATE.start_kmalloc_#res.base| 0)) [2021-11-01 16:22:25,199 INFO L861 garLoopResultBuilder]: At program point L3049(lines 3048 3050) the Hoare annotation is: true [2021-11-01 16:22:25,199 INFO L854 garLoopResultBuilder]: At program point L3049-2(lines 3048 3050) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,200 INFO L854 garLoopResultBuilder]: At program point L2455(lines 2425 2585) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,200 INFO L854 garLoopResultBuilder]: At program point L2389-1(lines 2383 2396) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,200 INFO L854 garLoopResultBuilder]: At program point L2389(lines 2383 2396) the Hoare annotation is: (and (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,200 INFO L858 garLoopResultBuilder]: For program point L2323-1(lines 2323 2327) no Hoare annotation was computed. [2021-11-01 16:22:25,200 INFO L858 garLoopResultBuilder]: For program point L2323(lines 2323 2327) no Hoare annotation was computed. [2021-11-01 16:22:25,200 INFO L854 garLoopResultBuilder]: At program point L2389-2(lines 2383 2396) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,200 INFO L858 garLoopResultBuilder]: For program point L2323-2(lines 2323 2327) no Hoare annotation was computed. [2021-11-01 16:22:25,201 INFO L858 garLoopResultBuilder]: For program point L2720(line 2720) no Hoare annotation was computed. [2021-11-01 16:22:25,201 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 2013) no Hoare annotation was computed. [2021-11-01 16:22:25,201 INFO L858 garLoopResultBuilder]: For program point L2721(lines 2721 2776) no Hoare annotation was computed. [2021-11-01 16:22:25,201 INFO L854 garLoopResultBuilder]: At program point L2391-1(lines 2383 2396) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,201 INFO L854 garLoopResultBuilder]: At program point L2391(lines 2383 2396) the Hoare annotation is: (and (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,201 INFO L854 garLoopResultBuilder]: At program point L2391-2(lines 2383 2396) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,202 INFO L854 garLoopResultBuilder]: At program point L2127(lines 2123 2129) the Hoare annotation is: false [2021-11-01 16:22:25,202 INFO L854 garLoopResultBuilder]: At program point L2986(lines 2985 2987) the Hoare annotation is: false [2021-11-01 16:22:25,202 INFO L858 garLoopResultBuilder]: For program point L2524-1(lines 2425 2585) no Hoare annotation was computed. [2021-11-01 16:22:25,202 INFO L854 garLoopResultBuilder]: At program point L3053(lines 3052 3054) the Hoare annotation is: false [2021-11-01 16:22:25,202 INFO L858 garLoopResultBuilder]: For program point L2789(line 2789) no Hoare annotation was computed. [2021-11-01 16:22:25,202 INFO L858 garLoopResultBuilder]: For program point L2723(lines 2723 2773) no Hoare annotation was computed. [2021-11-01 16:22:25,202 INFO L858 garLoopResultBuilder]: For program point L2790(lines 2790 2794) no Hoare annotation was computed. [2021-11-01 16:22:25,202 INFO L858 garLoopResultBuilder]: For program point L2724(line 2724) no Hoare annotation was computed. [2021-11-01 16:22:25,203 INFO L858 garLoopResultBuilder]: For program point L2790-2(lines 2781 2831) no Hoare annotation was computed. [2021-11-01 16:22:25,203 INFO L858 garLoopResultBuilder]: For program point L2526(lines 2526 2529) no Hoare annotation was computed. [2021-11-01 16:22:25,203 INFO L858 garLoopResultBuilder]: For program point L2725(lines 2725 2729) no Hoare annotation was computed. [2021-11-01 16:22:25,203 INFO L854 garLoopResultBuilder]: At program point L2990(lines 2989 2991) the Hoare annotation is: false [2021-11-01 16:22:25,203 INFO L858 garLoopResultBuilder]: For program point L2660(line 2660) no Hoare annotation was computed. [2021-11-01 16:22:25,203 INFO L854 garLoopResultBuilder]: At program point L3057-1(lines 3056 3058) the Hoare annotation is: false [2021-11-01 16:22:25,203 INFO L854 garLoopResultBuilder]: At program point L3057(lines 3056 3058) the Hoare annotation is: false [2021-11-01 16:22:25,204 INFO L854 garLoopResultBuilder]: At program point L3057-3(lines 3056 3058) the Hoare annotation is: false [2021-11-01 16:22:25,204 INFO L854 garLoopResultBuilder]: At program point L3057-2(lines 3056 3058) the Hoare annotation is: false [2021-11-01 16:22:25,204 INFO L854 garLoopResultBuilder]: At program point L3057-5(lines 3056 3058) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-01 16:22:25,204 INFO L854 garLoopResultBuilder]: At program point L3057-4(lines 3056 3058) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-01 16:22:25,204 INFO L854 garLoopResultBuilder]: At program point L3057-7(lines 3056 3058) the Hoare annotation is: false [2021-11-01 16:22:25,204 INFO L854 garLoopResultBuilder]: At program point L3057-6(lines 3056 3058) the Hoare annotation is: false [2021-11-01 16:22:25,204 INFO L854 garLoopResultBuilder]: At program point L3057-9(lines 3056 3058) the Hoare annotation is: false [2021-11-01 16:22:25,205 INFO L854 garLoopResultBuilder]: At program point L3057-8(lines 3056 3058) the Hoare annotation is: false [2021-11-01 16:22:25,205 INFO L858 garLoopResultBuilder]: For program point L2661(lines 2661 2666) no Hoare annotation was computed. [2021-11-01 16:22:25,205 INFO L854 garLoopResultBuilder]: At program point L2926(lines 2922 2928) the Hoare annotation is: false [2021-11-01 16:22:25,205 INFO L854 garLoopResultBuilder]: At program point L2926-1(lines 2922 2928) the Hoare annotation is: false [2021-11-01 16:22:25,205 INFO L854 garLoopResultBuilder]: At program point L2464(lines 2456 2472) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,205 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-01 16:22:25,205 INFO L854 garLoopResultBuilder]: At program point L2994(lines 2993 2995) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-01 16:22:25,206 INFO L861 garLoopResultBuilder]: At program point L1937(lines 1935 1938) the Hoare annotation is: true [2021-11-01 16:22:25,206 INFO L854 garLoopResultBuilder]: At program point L1937-1(lines 1935 1938) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,206 INFO L854 garLoopResultBuilder]: At program point L1937-2(lines 1935 1938) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,206 INFO L854 garLoopResultBuilder]: At program point L1937-3(lines 1935 1938) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,206 INFO L854 garLoopResultBuilder]: At program point L2466(lines 2456 2472) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,206 INFO L858 garLoopResultBuilder]: For program point L2532-1(lines 2532 2539) no Hoare annotation was computed. [2021-11-01 16:22:25,207 INFO L854 garLoopResultBuilder]: At program point L3061(lines 3060 3062) the Hoare annotation is: false [2021-11-01 16:22:25,207 INFO L858 garLoopResultBuilder]: For program point L2731(line 2731) no Hoare annotation was computed. [2021-11-01 16:22:25,207 INFO L858 garLoopResultBuilder]: For program point L2401-1(lines 2401 2410) no Hoare annotation was computed. [2021-11-01 16:22:25,207 INFO L858 garLoopResultBuilder]: For program point L2401(lines 2401 2410) no Hoare annotation was computed. [2021-11-01 16:22:25,207 INFO L858 garLoopResultBuilder]: For program point L2401-2(lines 2401 2410) no Hoare annotation was computed. [2021-11-01 16:22:25,207 INFO L858 garLoopResultBuilder]: For program point L2732(lines 2732 2736) no Hoare annotation was computed. [2021-11-01 16:22:25,207 INFO L858 garLoopResultBuilder]: For program point L2732-2(lines 2723 2773) no Hoare annotation was computed. [2021-11-01 16:22:25,207 INFO L858 garLoopResultBuilder]: For program point L2534(lines 2534 2537) no Hoare annotation was computed. [2021-11-01 16:22:25,208 INFO L854 garLoopResultBuilder]: At program point L2998(lines 2997 2999) the Hoare annotation is: false [2021-11-01 16:22:25,208 INFO L858 garLoopResultBuilder]: For program point L2668(line 2668) no Hoare annotation was computed. [2021-11-01 16:22:25,208 INFO L854 garLoopResultBuilder]: At program point L2933-1(lines 2929 2935) the Hoare annotation is: false [2021-11-01 16:22:25,208 INFO L854 garLoopResultBuilder]: At program point L2933(lines 2929 2935) the Hoare annotation is: false [2021-11-01 16:22:25,208 INFO L854 garLoopResultBuilder]: At program point L2933-3(lines 2929 2935) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,208 INFO L854 garLoopResultBuilder]: At program point L2933-2(lines 2929 2935) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,208 INFO L854 garLoopResultBuilder]: At program point L2933-5(lines 2929 2935) the Hoare annotation is: false [2021-11-01 16:22:25,209 INFO L854 garLoopResultBuilder]: At program point L2933-4(lines 2929 2935) the Hoare annotation is: false [2021-11-01 16:22:25,209 INFO L858 garLoopResultBuilder]: For program point L2801(line 2801) no Hoare annotation was computed. [2021-11-01 16:22:25,209 INFO L858 garLoopResultBuilder]: For program point L2669(lines 2669 2674) no Hoare annotation was computed. [2021-11-01 16:22:25,209 INFO L858 garLoopResultBuilder]: For program point L2405-1(lines 2405 2409) no Hoare annotation was computed. [2021-11-01 16:22:25,209 INFO L858 garLoopResultBuilder]: For program point L2405(lines 2405 2409) no Hoare annotation was computed. [2021-11-01 16:22:25,209 INFO L858 garLoopResultBuilder]: For program point L2405-2(lines 2405 2409) no Hoare annotation was computed. [2021-11-01 16:22:25,209 INFO L861 garLoopResultBuilder]: At program point L2009(lines 2889 2898) the Hoare annotation is: true [2021-11-01 16:22:25,209 INFO L854 garLoopResultBuilder]: At program point L2009-1(lines 2889 2898) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,210 INFO L854 garLoopResultBuilder]: At program point L2009-2(lines 2889 2898) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,210 INFO L854 garLoopResultBuilder]: At program point L2009-3(lines 2889 2898) the Hoare annotation is: false [2021-11-01 16:22:25,210 INFO L854 garLoopResultBuilder]: At program point L2009-4(lines 2889 2898) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,210 INFO L858 garLoopResultBuilder]: For program point L2802(lines 2802 2806) no Hoare annotation was computed. [2021-11-01 16:22:25,210 INFO L858 garLoopResultBuilder]: For program point L2802-2(lines 2781 2831) no Hoare annotation was computed. [2021-11-01 16:22:25,210 INFO L858 garLoopResultBuilder]: For program point L2142(lines 2142 2155) no Hoare annotation was computed. [2021-11-01 16:22:25,210 INFO L858 garLoopResultBuilder]: For program point L2142-2(lines 2142 2155) no Hoare annotation was computed. [2021-11-01 16:22:25,211 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-01 16:22:25,211 INFO L858 garLoopResultBuilder]: For program point L2142-3(lines 2142 2155) no Hoare annotation was computed. [2021-11-01 16:22:25,211 INFO L858 garLoopResultBuilder]: For program point L2142-6(lines 2142 2155) no Hoare annotation was computed. [2021-11-01 16:22:25,211 INFO L858 garLoopResultBuilder]: For program point L2142-5(lines 2142 2155) no Hoare annotation was computed. [2021-11-01 16:22:25,211 INFO L858 garLoopResultBuilder]: For program point L2142-8(lines 2142 2155) no Hoare annotation was computed. [2021-11-01 16:22:25,211 INFO L858 garLoopResultBuilder]: For program point L2142-9(lines 2142 2155) no Hoare annotation was computed. [2021-11-01 16:22:25,211 INFO L858 garLoopResultBuilder]: For program point L2142-11(lines 2142 2155) no Hoare annotation was computed. [2021-11-01 16:22:25,211 INFO L854 garLoopResultBuilder]: At program point L3068(lines 3067 3069) the Hoare annotation is: false [2021-11-01 16:22:25,212 INFO L854 garLoopResultBuilder]: At program point L3002(lines 3001 3003) the Hoare annotation is: false [2021-11-01 16:22:25,212 INFO L861 garLoopResultBuilder]: At program point L1945(lines 1940 1947) the Hoare annotation is: true [2021-11-01 16:22:25,212 INFO L854 garLoopResultBuilder]: At program point L1945-1(lines 1940 1947) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,212 INFO L854 garLoopResultBuilder]: At program point L1945-2(lines 1940 1947) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,212 INFO L854 garLoopResultBuilder]: At program point L1945-3(lines 1940 1947) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ 12 ULTIMATE.start_lock_torture_init_~firsterr~0) 0) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-01 16:22:25,212 INFO L858 garLoopResultBuilder]: For program point L2474(lines 2474 2477) no Hoare annotation was computed. [2021-11-01 16:22:25,212 INFO L858 garLoopResultBuilder]: For program point L2474-2(lines 2425 2585) no Hoare annotation was computed. [2021-11-01 16:22:25,213 INFO L858 garLoopResultBuilder]: For program point L2012(line 2012) no Hoare annotation was computed. [2021-11-01 16:22:25,213 INFO L858 garLoopResultBuilder]: For program point L2012-1(line 2012) no Hoare annotation was computed. [2021-11-01 16:22:25,213 INFO L858 garLoopResultBuilder]: For program point L2012-2(line 2012) no Hoare annotation was computed. [2021-11-01 16:22:25,213 INFO L858 garLoopResultBuilder]: For program point L2012-3(line 2012) no Hoare annotation was computed. [2021-11-01 16:22:25,213 INFO L854 garLoopResultBuilder]: At program point L1880(lines 1875 1882) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ULTIMATE.start_lock_torture_init_~tmp___0~9 0) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2021-11-01 16:22:25,213 INFO L858 garLoopResultBuilder]: For program point L2012-4(line 2012) no Hoare annotation was computed. [2021-11-01 16:22:25,213 INFO L858 garLoopResultBuilder]: For program point L2542(lines 2542 2550) no Hoare annotation was computed. [2021-11-01 16:22:25,213 INFO L858 garLoopResultBuilder]: For program point L2543(lines 2543 2546) no Hoare annotation was computed. [2021-11-01 16:22:25,214 INFO L858 garLoopResultBuilder]: For program point L2543-2(lines 2543 2546) no Hoare annotation was computed. [2021-11-01 16:22:25,214 INFO L854 garLoopResultBuilder]: At program point L3072(lines 3071 3073) the Hoare annotation is: false [2021-11-01 16:22:25,214 INFO L854 garLoopResultBuilder]: At program point L3006(lines 3005 3007) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2021-11-01 16:22:25,214 INFO L858 garLoopResultBuilder]: For program point L2676(line 2676) no Hoare annotation was computed. [2021-11-01 16:22:25,214 INFO L858 garLoopResultBuilder]: For program point L2478-1(lines 2478 2483) no Hoare annotation was computed. [2021-11-01 16:22:25,214 INFO L858 garLoopResultBuilder]: For program point L2743(line 2743) no Hoare annotation was computed. [2021-11-01 16:22:25,217 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 16:22:25,218 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-01 16:22:25,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.11 04:22:25 BoogieIcfgContainer [2021-11-01 16:22:25,257 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-01 16:22:25,258 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-01 16:22:25,258 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-01 16:22:25,258 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-01 16:22:25,259 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 04:22:02" (3/4) ... [2021-11-01 16:22:25,261 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-01 16:22:25,290 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 161 nodes and edges [2021-11-01 16:22:25,292 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 63 nodes and edges [2021-11-01 16:22:25,294 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2021-11-01 16:22:25,296 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-01 16:22:25,297 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-01 16:22:25,299 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-01 16:22:25,301 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-01 16:22:25,326 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && \result + 12 <= 0) && nwriters_stress + 1 <= 0) || ((ldv_state_variable_0 == 1 && nwriters_stress + 1 <= 0) && \result + 16 <= 0) [2021-11-01 16:22:25,328 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 [2021-11-01 16:22:25,328 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 [2021-11-01 16:22:25,329 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 [2021-11-01 16:22:25,329 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 [2021-11-01 16:22:25,329 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 [2021-11-01 16:22:25,329 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 [2021-11-01 16:22:25,330 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 [2021-11-01 16:22:25,330 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 [2021-11-01 16:22:25,456 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-01 16:22:25,456 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-01 16:22:25,456 INFO L158 Benchmark]: Toolchain (without parser) took 24874.28ms. Allocated memory was 96.5MB in the beginning and 541.1MB in the end (delta: 444.6MB). Free memory was 63.3MB in the beginning and 216.1MB in the end (delta: -152.8MB). Peak memory consumption was 290.9MB. Max. memory is 16.1GB. [2021-11-01 16:22:25,457 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 54.3MB in the beginning and 54.2MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-01 16:22:25,458 INFO L158 Benchmark]: CACSL2BoogieTranslator took 810.13ms. Allocated memory was 96.5MB in the beginning and 119.5MB in the end (delta: 23.1MB). Free memory was 63.1MB in the beginning and 88.3MB in the end (delta: -25.2MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2021-11-01 16:22:25,458 INFO L158 Benchmark]: Boogie Procedure Inliner took 124.91ms. Allocated memory is still 119.5MB. Free memory was 88.3MB in the beginning and 78.3MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-01 16:22:25,458 INFO L158 Benchmark]: Boogie Preprocessor took 65.20ms. Allocated memory is still 119.5MB. Free memory was 78.3MB in the beginning and 70.5MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-01 16:22:25,459 INFO L158 Benchmark]: RCFGBuilder took 1149.89ms. Allocated memory is still 119.5MB. Free memory was 70.5MB in the beginning and 66.9MB in the end (delta: 3.6MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2021-11-01 16:22:25,459 INFO L158 Benchmark]: TraceAbstraction took 22519.69ms. Allocated memory was 119.5MB in the beginning and 541.1MB in the end (delta: 421.5MB). Free memory was 66.1MB in the beginning and 251.8MB in the end (delta: -185.7MB). Peak memory consumption was 309.7MB. Max. memory is 16.1GB. [2021-11-01 16:22:25,460 INFO L158 Benchmark]: Witness Printer took 198.27ms. Allocated memory is still 541.1MB. Free memory was 251.8MB in the beginning and 216.1MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2021-11-01 16:22:25,461 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 54.3MB in the beginning and 54.2MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 810.13ms. Allocated memory was 96.5MB in the beginning and 119.5MB in the end (delta: 23.1MB). Free memory was 63.1MB in the beginning and 88.3MB in the end (delta: -25.2MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 124.91ms. Allocated memory is still 119.5MB. Free memory was 88.3MB in the beginning and 78.3MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.20ms. Allocated memory is still 119.5MB. Free memory was 78.3MB in the beginning and 70.5MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1149.89ms. Allocated memory is still 119.5MB. Free memory was 70.5MB in the beginning and 66.9MB in the end (delta: 3.6MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. * TraceAbstraction took 22519.69ms. Allocated memory was 119.5MB in the beginning and 541.1MB in the end (delta: 421.5MB). Free memory was 66.1MB in the beginning and 251.8MB in the end (delta: -185.7MB). Peak memory consumption was 309.7MB. Max. memory is 16.1GB. * Witness Printer took 198.27ms. Allocated memory is still 541.1MB. Free memory was 251.8MB in the beginning and 216.1MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 2013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 2013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 2013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 2013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 2013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 350 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 22419.13ms, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 81.34ms, AutomataDifference: 15428.30ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 1817.56ms, InitialAbstractionConstructionTime: 15.67ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5157 SdHoareTripleChecker+Valid, 13414.63ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5157 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 10466.02ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6211 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13981 IncrementalHoareTripleChecker+Invalid, 14053 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 5 mSDtfsCounter, 13981 mSolverCounterSat, 38.17ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 84.39ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=15962occurred in iteration=12, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 1760.34ms AutomataMinimizationTime, 15 MinimizatonAttempts, 6575 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 149 LocationsWithAnnotation, 149 PreInvPairs, 699 NumberOfFragments, 2339 HoareAnnotationTreeSize, 149 FomulaSimplifications, 17502 FormulaSimplificationTreeSizeReduction, 407.67ms HoareSimplificationTime, 149 FomulaSimplificationsInter, 1494 FormulaSimplificationTreeSizeReductionInter, 1382.46ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 197.60ms SsaConstructionTime, 800.00ms SatisfiabilityAnalysisTime, 1248.87ms InterpolantComputationTime, 1020 NumberOfCodeBlocks, 1020 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1003 ConstructedInterpolants, 0 QuantifiedInterpolants, 1745 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1928 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 198/224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 2889]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 1875]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 1893]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2274]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 3067]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1959]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 1940]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 1893]: Loop Invariant Derived loop invariant: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 - InvariantResult [Line: 2096]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && ldv_spin == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2182]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3048]: Loop Invariant Derived loop invariant: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 - InvariantResult [Line: 2274]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2929]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2383]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && ldv_spin == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2361]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2414]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && \result + 12 <= 0) && nwriters_stress + 1 <= 0) || ((ldv_state_variable_0 == 1 && nwriters_stress + 1 <= 0) && \result + 16 <= 0) - InvariantResult [Line: 2130]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2889]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3034]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2173]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2113]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 3056]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3056]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1976]: Loop Invariant Derived loop invariant: ((((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2383]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2274]: Loop Invariant Derived loop invariant: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 - InvariantResult [Line: 2383]: Loop Invariant Derived loop invariant: ldv_spin == 0 && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2609]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 2596]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2929]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2130]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3001]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2929]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2871]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1935]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2113]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1885]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 1940]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 3030]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && ldv_spin == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2142]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2929]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2456]: Loop Invariant Derived loop invariant: (ldv_state_variable_0 == 1 && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2862]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2265]: Loop Invariant Derived loop invariant: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 - InvariantResult [Line: 2383]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && ldv_spin == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2862]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2182]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2989]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1935]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2972]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && ldv_spin == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 3056]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3052]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2972]: Loop Invariant Derived loop invariant: ldv_spin == 0 && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2969]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2142]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3071]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2142]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1893]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 3030]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2130]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2889]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2018]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2871]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2846]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3056]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2871]: Loop Invariant Derived loop invariant: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 - InvariantResult [Line: 3030]: Loop Invariant Derived loop invariant: ldv_spin == 0 && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2265]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1935]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 1976]: Loop Invariant Derived loop invariant: ((((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2087]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 2969]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2997]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2274]: Loop Invariant Derived loop invariant: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 - InvariantResult [Line: 3005]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 3056]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 1940]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2096]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 3056]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2383]: Loop Invariant Derived loop invariant: ldv_spin == 0 && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2018]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2889]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2922]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2985]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2018]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 2130]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2981]: Loop Invariant Derived loop invariant: ((((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 3056]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2142]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1959]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 3056]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 2862]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1976]: Loop Invariant Derived loop invariant: ((((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 1940]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 1959]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2972]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2889]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2265]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2950]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 3048]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1935]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2993]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 2274]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2871]: Loop Invariant Derived loop invariant: (((((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && \result == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) && \result == 0 - InvariantResult [Line: 2018]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2972]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2972]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && ldv_spin == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2880]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2383]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 3056]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2929]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2274]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 3056]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2972]: Loop Invariant Derived loop invariant: ldv_spin == 0 && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2922]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2018]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2081]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 3037]: Loop Invariant Derived loop invariant: (ldv_state_variable_0 == 1 && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 3048]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && 12 + firsterr <= 0) && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2087]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 2123]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2456]: Loop Invariant Derived loop invariant: (ldv_state_variable_0 == 1 && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 1959]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && tmp___0 == 0) && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2929]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2021-11-01 16:22:25,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...