/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -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 -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 13:26:35,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 13:26:35,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 13:26:35,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 13:26:35,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 13:26:35,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 13:26:35,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 13:26:35,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 13:26:35,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 13:26:35,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 13:26:35,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 13:26:35,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 13:26:35,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 13:26:35,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 13:26:35,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 13:26:35,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 13:26:35,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 13:26:35,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 13:26:35,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 13:26:35,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 13:26:35,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 13:26:35,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 13:26:35,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 13:26:35,383 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 13:26:35,387 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 13:26:35,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 13:26:35,388 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 13:26:35,390 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 13:26:35,390 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 13:26:35,392 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 13:26:35,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 13:26:35,393 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 13:26:35,394 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 13:26:35,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 13:26:35,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 13:26:35,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 13:26:35,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 13:26:35,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 13:26:35,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 13:26:35,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 13:26:35,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 13:26:35,403 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 13:26:35,443 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 13:26:35,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 13:26:35,444 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 13:26:35,445 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 13:26:35,447 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 13:26:35,448 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 13:26:35,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 13:26:35,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 13:26:35,452 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 13:26:35,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 13:26:35,453 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 13:26:35,453 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 13:26:35,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 13:26:35,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 13:26:35,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 13:26:35,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 13:26:35,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 13:26:35,456 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 13:26:35,456 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 13:26:35,456 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 13:26:35,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 13:26:35,457 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 13:26:35,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 13:26:35,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 13:26:35,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 13:26:35,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 13:26:35,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 13:26:35,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 13:26:35,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 13:26:35,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 13:26:35,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 13:26:35,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 13:26:35,460 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 13:26:35,460 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 [2022-10-16 13:26:35,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 13:26:35,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 13:26:35,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 13:26:35,964 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 13:26:35,965 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 13:26:35,967 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 [2022-10-16 13:26:36,043 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e60481b26/15783548dc9246369408b09a624b6208/FLAGb96ea924b [2022-10-16 13:26:36,952 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 13:26:36,953 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 [2022-10-16 13:26:36,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e60481b26/15783548dc9246369408b09a624b6208/FLAGb96ea924b [2022-10-16 13:26:37,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e60481b26/15783548dc9246369408b09a624b6208 [2022-10-16 13:26:37,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 13:26:37,087 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 13:26:37,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 13:26:37,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 13:26:37,099 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 13:26:37,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:26:37" (1/1) ... [2022-10-16 13:26:37,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@402d7c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:37, skipping insertion in model container [2022-10-16 13:26:37,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:26:37" (1/1) ... [2022-10-16 13:26:37,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 13:26:37,183 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 13:26:37,635 WARN L1251 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2022-10-16 13:26:37,636 WARN L1251 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2022-10-16 13:26:37,829 WARN L230 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] [2022-10-16 13:26:38,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 13:26:38,148 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 13:26:38,201 WARN L1251 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2022-10-16 13:26:38,201 WARN L1251 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2022-10-16 13:26:38,212 WARN L230 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] [2022-10-16 13:26:38,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 13:26:38,315 INFO L208 MainTranslator]: Completed translation [2022-10-16 13:26:38,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:38 WrapperNode [2022-10-16 13:26:38,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 13:26:38,317 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 13:26:38,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 13:26:38,318 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 13:26:38,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:38" (1/1) ... [2022-10-16 13:26:38,360 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:38" (1/1) ... [2022-10-16 13:26:38,437 INFO L138 Inliner]: procedures = 114, calls = 288, calls flagged for inlining = 49, calls inlined = 38, statements flattened = 918 [2022-10-16 13:26:38,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 13:26:38,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 13:26:38,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 13:26:38,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 13:26:38,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:38" (1/1) ... [2022-10-16 13:26:38,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:38" (1/1) ... [2022-10-16 13:26:38,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:38" (1/1) ... [2022-10-16 13:26:38,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:38" (1/1) ... [2022-10-16 13:26:38,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:38" (1/1) ... [2022-10-16 13:26:38,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:38" (1/1) ... [2022-10-16 13:26:38,563 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:38" (1/1) ... [2022-10-16 13:26:38,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:38" (1/1) ... [2022-10-16 13:26:38,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 13:26:38,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 13:26:38,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 13:26:38,582 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 13:26:38,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:38" (1/1) ... [2022-10-16 13:26:38,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 13:26:38,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:26:38,626 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) [2022-10-16 13:26:38,651 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 [2022-10-16 13:26:38,694 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_stop_kthread [2022-10-16 13:26:38,695 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_stop_kthread [2022-10-16 13:26:38,695 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_lock [2022-10-16 13:26:38,695 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_lock [2022-10-16 13:26:38,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-10-16 13:26:38,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-10-16 13:26:38,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 13:26:38,696 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2022-10-16 13:26:38,696 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2022-10-16 13:26:38,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2022-10-16 13:26:38,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2022-10-16 13:26:38,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-16 13:26:38,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-16 13:26:38,697 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_create_kthread [2022-10-16 13:26:38,697 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_create_kthread [2022-10-16 13:26:38,697 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2022-10-16 13:26:38,697 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2022-10-16 13:26:38,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-10-16 13:26:38,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-10-16 13:26:38,698 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-10-16 13:26:38,698 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-10-16 13:26:38,698 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2022-10-16 13:26:38,698 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2022-10-16 13:26:38,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 13:26:38,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-10-16 13:26:38,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-10-16 13:26:38,699 INFO L130 BoogieDeclarations]: Found specification of procedure torture_random [2022-10-16 13:26:38,699 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_random [2022-10-16 13:26:38,699 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2022-10-16 13:26:38,699 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2022-10-16 13:26:38,699 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_end [2022-10-16 13:26:38,699 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_end [2022-10-16 13:26:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-16 13:26:38,700 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-16 13:26:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 13:26:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2022-10-16 13:26:38,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2022-10-16 13:26:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 13:26:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-10-16 13:26:38,701 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-10-16 13:26:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 13:26:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 13:26:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2022-10-16 13:26:38,701 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2022-10-16 13:26:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 13:26:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2022-10-16 13:26:38,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2022-10-16 13:26:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2022-10-16 13:26:38,702 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2022-10-16 13:26:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 13:26:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-16 13:26:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_delay [2022-10-16 13:26:38,703 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_delay [2022-10-16 13:26:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-10-16 13:26:38,703 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-10-16 13:26:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_unlock [2022-10-16 13:26:38,703 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_unlock [2022-10-16 13:26:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2022-10-16 13:26:38,704 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2022-10-16 13:26:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 13:26:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-10-16 13:26:38,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-10-16 13:26:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2022-10-16 13:26:38,704 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2022-10-16 13:26:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 13:26:38,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 13:26:39,055 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 13:26:39,058 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 13:26:39,249 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-10-16 13:26:40,143 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 13:26:40,157 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 13:26:40,157 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-16 13:26:40,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:26:40 BoogieIcfgContainer [2022-10-16 13:26:40,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 13:26:40,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 13:26:40,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 13:26:40,168 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 13:26:40,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:26:37" (1/3) ... [2022-10-16 13:26:40,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56368b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:26:40, skipping insertion in model container [2022-10-16 13:26:40,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:38" (2/3) ... [2022-10-16 13:26:40,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56368b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:26:40, skipping insertion in model container [2022-10-16 13:26:40,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:26:40" (3/3) ... [2022-10-16 13:26:40,172 INFO L112 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2022-10-16 13:26:40,194 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 13:26:40,195 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-10-16 13:26:40,276 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 13:26:40,285 INFO L357 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=FINITE_AUTOMATA, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@74bb1e5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 13:26:40,286 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-10-16 13:26:40,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 428 states, 298 states have (on average 1.4932885906040267) internal successors, (445), 355 states have internal predecessors, (445), 61 states have call successors, (61), 27 states have call predecessors, (61), 26 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) [2022-10-16 13:26:40,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-16 13:26:40,316 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:26:40,317 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:26:40,318 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-16 13:26:40,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:26:40,324 INFO L85 PathProgramCache]: Analyzing trace with hash -606025898, now seen corresponding path program 1 times [2022-10-16 13:26:40,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:26:40,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421724835] [2022-10-16 13:26:40,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:26:40,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:26:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:40,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:26:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:40,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:26:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:41,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:26:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:41,031 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 13:26:41,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:26:41,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421724835] [2022-10-16 13:26:41,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421724835] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:26:41,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:26:41,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 13:26:41,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284608526] [2022-10-16 13:26:41,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:26:41,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:26:41,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:26:41,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:26:41,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:26:41,104 INFO L87 Difference]: Start difference. First operand has 428 states, 298 states have (on average 1.4932885906040267) internal successors, (445), 355 states have internal predecessors, (445), 61 states have call successors, (61), 27 states have call predecessors, (61), 26 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 13:26:42,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:26:42,366 INFO L93 Difference]: Finished difference Result 1325 states and 1776 transitions. [2022-10-16 13:26:42,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 13:26:42,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-10-16 13:26:42,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:26:42,394 INFO L225 Difference]: With dead ends: 1325 [2022-10-16 13:26:42,395 INFO L226 Difference]: Without dead ends: 873 [2022-10-16 13:26:42,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:26:42,409 INFO L413 NwaCegarLoop]: 612 mSDtfsCounter, 760 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-10-16 13:26:42,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1171 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-10-16 13:26:42,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2022-10-16 13:26:42,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 731. [2022-10-16 13:26:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 541 states have (on average 1.4805914972273568) internal successors, (801), 602 states have internal predecessors, (801), 100 states have call successors, (100), 48 states have call predecessors, (100), 48 states have return successors, (98), 88 states have call predecessors, (98), 98 states have call successors, (98) [2022-10-16 13:26:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 999 transitions. [2022-10-16 13:26:42,614 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 999 transitions. Word has length 31 [2022-10-16 13:26:42,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:26:42,615 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 999 transitions. [2022-10-16 13:26:42,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 13:26:42,617 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 999 transitions. [2022-10-16 13:26:42,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-16 13:26:42,627 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:26:42,628 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:26:42,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 13:26:42,628 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-16 13:26:42,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:26:42,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1955965, now seen corresponding path program 1 times [2022-10-16 13:26:42,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:26:42,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44799301] [2022-10-16 13:26:42,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:26:42,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:26:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:42,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:26:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:42,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:26:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:42,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:26:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:42,840 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 13:26:42,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:26:42,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44799301] [2022-10-16 13:26:42,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44799301] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:26:42,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:26:42,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 13:26:42,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609747640] [2022-10-16 13:26:42,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:26:42,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:26:42,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:26:42,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:26:42,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:26:42,845 INFO L87 Difference]: Start difference. First operand 731 states and 999 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 13:26:43,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:26:43,784 INFO L93 Difference]: Finished difference Result 2261 states and 3103 transitions. [2022-10-16 13:26:43,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 13:26:43,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-10-16 13:26:43,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:26:43,797 INFO L225 Difference]: With dead ends: 2261 [2022-10-16 13:26:43,797 INFO L226 Difference]: Without dead ends: 1546 [2022-10-16 13:26:43,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:26:43,802 INFO L413 NwaCegarLoop]: 639 mSDtfsCounter, 712 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-16 13:26:43,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 1202 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-16 13:26:43,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2022-10-16 13:26:43,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1316. [2022-10-16 13:26:43,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1001 states have (on average 1.4765234765234765) internal successors, (1478), 1080 states have internal predecessors, (1478), 182 states have call successors, (182), 91 states have call predecessors, (182), 91 states have return successors, (178), 158 states have call predecessors, (178), 178 states have call successors, (178) [2022-10-16 13:26:43,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1838 transitions. [2022-10-16 13:26:43,903 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1838 transitions. Word has length 33 [2022-10-16 13:26:43,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:26:43,904 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 1838 transitions. [2022-10-16 13:26:43,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 13:26:43,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1838 transitions. [2022-10-16 13:26:43,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-16 13:26:43,906 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:26:43,906 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:26:43,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 13:26:43,907 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-16 13:26:43,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:26:43,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1189661605, now seen corresponding path program 1 times [2022-10-16 13:26:43,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:26:43,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242680656] [2022-10-16 13:26:43,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:26:43,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:26:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:43,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:26:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:44,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:26:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:44,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:26:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:44,044 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 13:26:44,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:26:44,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242680656] [2022-10-16 13:26:44,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242680656] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:26:44,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:26:44,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 13:26:44,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783705214] [2022-10-16 13:26:44,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:26:44,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:26:44,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:26:44,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:26:44,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:26:44,049 INFO L87 Difference]: Start difference. First operand 1316 states and 1838 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 13:26:45,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:26:45,019 INFO L93 Difference]: Finished difference Result 4088 states and 5742 transitions. [2022-10-16 13:26:45,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 13:26:45,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-10-16 13:26:45,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:26:45,042 INFO L225 Difference]: With dead ends: 4088 [2022-10-16 13:26:45,043 INFO L226 Difference]: Without dead ends: 2788 [2022-10-16 13:26:45,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:26:45,051 INFO L413 NwaCegarLoop]: 731 mSDtfsCounter, 687 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-16 13:26:45,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1336 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-16 13:26:45,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2022-10-16 13:26:45,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2376. [2022-10-16 13:26:45,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2376 states, 1833 states have (on average 1.475177304964539) internal successors, (2704), 1948 states have internal predecessors, (2704), 330 states have call successors, (330), 171 states have call predecessors, (330), 171 states have return successors, (322), 282 states have call predecessors, (322), 322 states have call successors, (322) [2022-10-16 13:26:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 3356 transitions. [2022-10-16 13:26:45,319 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 3356 transitions. Word has length 34 [2022-10-16 13:26:45,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:26:45,319 INFO L495 AbstractCegarLoop]: Abstraction has 2376 states and 3356 transitions. [2022-10-16 13:26:45,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 13:26:45,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 3356 transitions. [2022-10-16 13:26:45,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-16 13:26:45,324 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:26:45,325 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:26:45,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 13:26:45,325 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-16 13:26:45,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:26:45,326 INFO L85 PathProgramCache]: Analyzing trace with hash 797000830, now seen corresponding path program 1 times [2022-10-16 13:26:45,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:26:45,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834157786] [2022-10-16 13:26:45,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:26:45,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:26:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:45,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:26:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:45,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:26:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:45,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:26:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:45,616 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 13:26:45,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:26:45,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834157786] [2022-10-16 13:26:45,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834157786] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:26:45,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:26:45,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 13:26:45,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505492927] [2022-10-16 13:26:45,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:26:45,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:26:45,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:26:45,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:26:45,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:26:45,624 INFO L87 Difference]: Start difference. First operand 2376 states and 3356 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 13:26:46,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:26:46,515 INFO L93 Difference]: Finished difference Result 6176 states and 9032 transitions. [2022-10-16 13:26:46,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 13:26:46,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-10-16 13:26:46,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:26:46,550 INFO L225 Difference]: With dead ends: 6176 [2022-10-16 13:26:46,550 INFO L226 Difference]: Without dead ends: 3816 [2022-10-16 13:26:46,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:26:46,565 INFO L413 NwaCegarLoop]: 699 mSDtfsCounter, 386 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 13:26:46,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1395 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 13:26:46,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2022-10-16 13:26:46,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 2536. [2022-10-16 13:26:46,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 1985 states have (on average 1.4549118387909319) internal successors, (2888), 2100 states have internal predecessors, (2888), 338 states have call successors, (338), 171 states have call predecessors, (338), 171 states have return successors, (330), 290 states have call predecessors, (330), 330 states have call successors, (330) [2022-10-16 13:26:46,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 3556 transitions. [2022-10-16 13:26:46,835 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 3556 transitions. Word has length 35 [2022-10-16 13:26:46,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:26:46,836 INFO L495 AbstractCegarLoop]: Abstraction has 2536 states and 3556 transitions. [2022-10-16 13:26:46,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 13:26:46,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3556 transitions. [2022-10-16 13:26:46,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-16 13:26:46,837 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:26:46,837 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:26:46,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 13:26:46,838 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting lock_torture_cleanupErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-16 13:26:46,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:26:46,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1394469550, now seen corresponding path program 1 times [2022-10-16 13:26:46,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:26:46,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600049130] [2022-10-16 13:26:46,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:26:46,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:26:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:46,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:26:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:46,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:26:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:46,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:26:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:46,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-10-16 13:26:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 13:26:46,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:26:46,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600049130] [2022-10-16 13:26:46,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600049130] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:26:46,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:26:46,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 13:26:46,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938213112] [2022-10-16 13:26:46,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:26:46,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:26:46,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:26:46,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:26:46,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:26:46,971 INFO L87 Difference]: Start difference. First operand 2536 states and 3556 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-16 13:26:48,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:26:48,008 INFO L93 Difference]: Finished difference Result 7333 states and 10313 transitions. [2022-10-16 13:26:48,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 13:26:48,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-10-16 13:26:48,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:26:48,043 INFO L225 Difference]: With dead ends: 7333 [2022-10-16 13:26:48,043 INFO L226 Difference]: Without dead ends: 4485 [2022-10-16 13:26:48,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:26:48,057 INFO L413 NwaCegarLoop]: 782 mSDtfsCounter, 699 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-16 13:26:48,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 1351 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-16 13:26:48,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4485 states. [2022-10-16 13:26:48,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4485 to 3496. [2022-10-16 13:26:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3496 states, 2761 states have (on average 1.4491126403477002) internal successors, (4001), 2879 states have internal predecessors, (4001), 450 states have call successors, (450), 247 states have call predecessors, (450), 243 states have return successors, (446), 405 states have call predecessors, (446), 446 states have call successors, (446) [2022-10-16 13:26:48,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 3496 states and 4897 transitions. [2022-10-16 13:26:48,371 INFO L78 Accepts]: Start accepts. Automaton has 3496 states and 4897 transitions. Word has length 38 [2022-10-16 13:26:48,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:26:48,372 INFO L495 AbstractCegarLoop]: Abstraction has 3496 states and 4897 transitions. [2022-10-16 13:26:48,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-16 13:26:48,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3496 states and 4897 transitions. [2022-10-16 13:26:48,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-16 13:26:48,374 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:26:48,374 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-10-16 13:26:48,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 13:26:48,375 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-16 13:26:48,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:26:48,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1448643951, now seen corresponding path program 1 times [2022-10-16 13:26:48,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:26:48,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615875298] [2022-10-16 13:26:48,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:26:48,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:26:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:48,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:26:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:48,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:26:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:48,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:26:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:48,542 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 13:26:48,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:26:48,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615875298] [2022-10-16 13:26:48,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615875298] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:26:48,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550117957] [2022-10-16 13:26:48,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:26:48,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:26:48,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:26:48,548 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) [2022-10-16 13:26:48,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-16 13:26:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:48,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 13:26:48,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:26:48,848 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 13:26:48,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:26:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 13:26:48,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550117957] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 13:26:48,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 13:26:48,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-10-16 13:26:48,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792033344] [2022-10-16 13:26:48,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 13:26:48,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 13:26:48,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:26:48,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 13:26:48,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-16 13:26:48,916 INFO L87 Difference]: Start difference. First operand 3496 states and 4897 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 13:26:50,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:26:50,752 INFO L93 Difference]: Finished difference Result 14410 states and 21925 transitions. [2022-10-16 13:26:50,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 13:26:50,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-10-16 13:26:50,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:26:50,834 INFO L225 Difference]: With dead ends: 14410 [2022-10-16 13:26:50,834 INFO L226 Difference]: Without dead ends: 10930 [2022-10-16 13:26:50,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-16 13:26:50,849 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 1791 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1939 SdHoareTripleChecker+Valid, 3085 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-10-16 13:26:50,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1939 Valid, 3085 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-10-16 13:26:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10930 states. [2022-10-16 13:26:51,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10930 to 3742. [2022-10-16 13:26:51,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 2985 states have (on average 1.450251256281407) internal successors, (4329), 3101 states have internal predecessors, (4329), 474 states have call successors, (474), 247 states have call predecessors, (474), 243 states have return successors, (470), 429 states have call predecessors, (470), 470 states have call successors, (470) [2022-10-16 13:26:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 5273 transitions. [2022-10-16 13:26:51,381 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 5273 transitions. Word has length 40 [2022-10-16 13:26:51,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:26:51,382 INFO L495 AbstractCegarLoop]: Abstraction has 3742 states and 5273 transitions. [2022-10-16 13:26:51,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 13:26:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 5273 transitions. [2022-10-16 13:26:51,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 13:26:51,383 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:26:51,383 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-16 13:26:51,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 13:26:51,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-10-16 13:26:51,599 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-16 13:26:51,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:26:51,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1958290025, now seen corresponding path program 1 times [2022-10-16 13:26:51,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:26:51,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658546128] [2022-10-16 13:26:51,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:26:51,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:26:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:51,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:26:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:51,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:26:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:51,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:26:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:51,760 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 13:26:51,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:26:51,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658546128] [2022-10-16 13:26:51,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658546128] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:26:51,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040812888] [2022-10-16 13:26:51,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:26:51,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:26:51,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:26:51,763 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) [2022-10-16 13:26:51,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-16 13:26:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:51,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 13:26:51,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:26:51,982 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 13:26:51,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 13:26:51,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040812888] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:26:51,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 13:26:51,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-10-16 13:26:51,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813077408] [2022-10-16 13:26:51,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:26:51,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:26:51,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:26:51,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:26:51,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:26:51,985 INFO L87 Difference]: Start difference. First operand 3742 states and 5273 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 13:26:52,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:26:52,665 INFO L93 Difference]: Finished difference Result 6184 states and 9223 transitions. [2022-10-16 13:26:52,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 13:26:52,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2022-10-16 13:26:52,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:26:52,704 INFO L225 Difference]: With dead ends: 6184 [2022-10-16 13:26:52,704 INFO L226 Difference]: Without dead ends: 6180 [2022-10-16 13:26:52,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:26:52,710 INFO L413 NwaCegarLoop]: 791 mSDtfsCounter, 618 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 13:26:52,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1464 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 13:26:52,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6180 states. [2022-10-16 13:26:53,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6180 to 3714. [2022-10-16 13:26:53,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3714 states, 2961 states have (on average 1.4322863897331983) internal successors, (4241), 3073 states have internal predecessors, (4241), 474 states have call successors, (474), 247 states have call predecessors, (474), 243 states have return successors, (470), 429 states have call predecessors, (470), 470 states have call successors, (470) [2022-10-16 13:26:53,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 5185 transitions. [2022-10-16 13:26:53,082 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 5185 transitions. Word has length 41 [2022-10-16 13:26:53,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:26:53,085 INFO L495 AbstractCegarLoop]: Abstraction has 3714 states and 5185 transitions. [2022-10-16 13:26:53,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 13:26:53,085 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 5185 transitions. [2022-10-16 13:26:53,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-16 13:26:53,088 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:26:53,088 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-16 13:26:53,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-16 13:26:53,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-10-16 13:26:53,304 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-16 13:26:53,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:26:53,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1678666271, now seen corresponding path program 1 times [2022-10-16 13:26:53,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:26:53,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301381440] [2022-10-16 13:26:53,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:26:53,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:26:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:53,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:26:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:53,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:26:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:53,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:26:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 13:26:53,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:26:53,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301381440] [2022-10-16 13:26:53,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301381440] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:26:53,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:26:53,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 13:26:53,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6501874] [2022-10-16 13:26:53,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:26:53,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:26:53,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:26:53,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:26:53,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:26:53,416 INFO L87 Difference]: Start difference. First operand 3714 states and 5185 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 13:26:54,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:26:54,344 INFO L93 Difference]: Finished difference Result 8852 states and 12649 transitions. [2022-10-16 13:26:54,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 13:26:54,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-10-16 13:26:54,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:26:54,381 INFO L225 Difference]: With dead ends: 8852 [2022-10-16 13:26:54,381 INFO L226 Difference]: Without dead ends: 5154 [2022-10-16 13:26:54,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:26:54,398 INFO L413 NwaCegarLoop]: 712 mSDtfsCounter, 402 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 13:26:54,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1363 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 13:26:54,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5154 states. [2022-10-16 13:26:54,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5154 to 3722. [2022-10-16 13:26:54,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3722 states, 2969 states have (on average 1.4311215897608622) internal successors, (4249), 3081 states have internal predecessors, (4249), 474 states have call successors, (474), 247 states have call predecessors, (474), 243 states have return successors, (470), 429 states have call predecessors, (470), 470 states have call successors, (470) [2022-10-16 13:26:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 5193 transitions. [2022-10-16 13:26:54,757 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 5193 transitions. Word has length 44 [2022-10-16 13:26:54,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:26:54,758 INFO L495 AbstractCegarLoop]: Abstraction has 3722 states and 5193 transitions. [2022-10-16 13:26:54,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 13:26:54,760 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5193 transitions. [2022-10-16 13:26:54,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-16 13:26:54,761 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:26:54,762 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-16 13:26:54,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 13:26:54,762 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-16 13:26:54,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:26:54,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1336437347, now seen corresponding path program 1 times [2022-10-16 13:26:54,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:26:54,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220149482] [2022-10-16 13:26:54,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:26:54,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:26:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:54,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:26:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:54,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:26:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:54,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:26:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 13:26:54,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:26:54,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220149482] [2022-10-16 13:26:54,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220149482] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:26:54,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:26:54,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:26:54,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490873193] [2022-10-16 13:26:54,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:26:54,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:26:54,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:26:54,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:26:54,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:26:54,973 INFO L87 Difference]: Start difference. First operand 3722 states and 5193 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 13:26:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:26:55,991 INFO L93 Difference]: Finished difference Result 7853 states and 11006 transitions. [2022-10-16 13:26:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 13:26:55,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-10-16 13:26:55,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:26:56,010 INFO L225 Difference]: With dead ends: 7853 [2022-10-16 13:26:56,010 INFO L226 Difference]: Without dead ends: 4067 [2022-10-16 13:26:56,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:26:56,026 INFO L413 NwaCegarLoop]: 501 mSDtfsCounter, 162 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-16 13:26:56,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1337 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-16 13:26:56,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2022-10-16 13:26:56,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 3594. [2022-10-16 13:26:56,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3594 states, 2849 states have (on average 1.4324324324324325) internal successors, (4081), 2961 states have internal predecessors, (4081), 466 states have call successors, (466), 247 states have call predecessors, (466), 243 states have return successors, (462), 421 states have call predecessors, (462), 462 states have call successors, (462) [2022-10-16 13:26:56,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 5009 transitions. [2022-10-16 13:26:56,360 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 5009 transitions. Word has length 44 [2022-10-16 13:26:56,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:26:56,360 INFO L495 AbstractCegarLoop]: Abstraction has 3594 states and 5009 transitions. [2022-10-16 13:26:56,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 13:26:56,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 5009 transitions. [2022-10-16 13:26:56,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-10-16 13:26:56,361 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:26:56,362 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:26:56,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 13:26:56,362 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting lock_torture_cleanupErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-16 13:26:56,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:26:56,363 INFO L85 PathProgramCache]: Analyzing trace with hash -841952832, now seen corresponding path program 1 times [2022-10-16 13:26:56,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:26:56,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325072876] [2022-10-16 13:26:56,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:26:56,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:26:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:56,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:26:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:56,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:26:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:56,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:26:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:56,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-16 13:26:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 13:26:56,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:26:56,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325072876] [2022-10-16 13:26:56,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325072876] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:26:56,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:26:56,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:26:56,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671137340] [2022-10-16 13:26:56,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:26:56,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:26:56,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:26:56,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:26:56,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:26:56,583 INFO L87 Difference]: Start difference. First operand 3594 states and 5009 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-16 13:26:57,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:26:57,876 INFO L93 Difference]: Finished difference Result 7789 states and 10881 transitions. [2022-10-16 13:26:57,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 13:26:57,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2022-10-16 13:26:57,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:26:57,895 INFO L225 Difference]: With dead ends: 7789 [2022-10-16 13:26:57,896 INFO L226 Difference]: Without dead ends: 4211 [2022-10-16 13:26:57,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-16 13:26:57,909 INFO L413 NwaCegarLoop]: 530 mSDtfsCounter, 439 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-16 13:26:57,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 1340 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-16 13:26:57,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4211 states. [2022-10-16 13:26:58,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4211 to 3690. [2022-10-16 13:26:58,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3690 states, 2927 states have (on average 1.4287666552784422) internal successors, (4182), 3046 states have internal predecessors, (4182), 475 states have call successors, (475), 254 states have call predecessors, (475), 252 states have return successors, (473), 427 states have call predecessors, (473), 473 states have call successors, (473) [2022-10-16 13:26:58,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 5130 transitions. [2022-10-16 13:26:58,255 INFO L78 Accepts]: Start accepts. Automaton has 3690 states and 5130 transitions. Word has length 49 [2022-10-16 13:26:58,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:26:58,256 INFO L495 AbstractCegarLoop]: Abstraction has 3690 states and 5130 transitions. [2022-10-16 13:26:58,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-16 13:26:58,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 5130 transitions. [2022-10-16 13:26:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-16 13:26:58,257 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:26:58,257 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:26:58,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 13:26:58,258 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-16 13:26:58,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:26:58,258 INFO L85 PathProgramCache]: Analyzing trace with hash 407721026, now seen corresponding path program 1 times [2022-10-16 13:26:58,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:26:58,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45533723] [2022-10-16 13:26:58,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:26:58,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:26:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:58,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:26:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:58,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:26:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:58,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:26:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:58,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-16 13:26:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:58,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 13:26:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:58,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 13:26:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:58,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-10-16 13:26:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 13:26:58,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:26:58,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45533723] [2022-10-16 13:26:58,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45533723] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:26:58,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:26:58,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:26:58,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820009303] [2022-10-16 13:26:58,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:26:58,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:26:58,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:26:58,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:26:58,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:26:58,452 INFO L87 Difference]: Start difference. First operand 3690 states and 5130 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-16 13:26:59,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:26:59,178 INFO L93 Difference]: Finished difference Result 7657 states and 10727 transitions. [2022-10-16 13:26:59,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 13:26:59,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-10-16 13:26:59,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:26:59,195 INFO L225 Difference]: With dead ends: 7657 [2022-10-16 13:26:59,196 INFO L226 Difference]: Without dead ends: 4127 [2022-10-16 13:26:59,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-16 13:26:59,208 INFO L413 NwaCegarLoop]: 489 mSDtfsCounter, 647 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 13:26:59,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1027 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 13:26:59,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4127 states. [2022-10-16 13:26:59,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4127 to 3690. [2022-10-16 13:26:59,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3690 states, 2927 states have (on average 1.4260334813802529) internal successors, (4174), 3046 states have internal predecessors, (4174), 475 states have call successors, (475), 254 states have call predecessors, (475), 252 states have return successors, (473), 427 states have call predecessors, (473), 473 states have call successors, (473) [2022-10-16 13:26:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 5122 transitions. [2022-10-16 13:26:59,574 INFO L78 Accepts]: Start accepts. Automaton has 3690 states and 5122 transitions. Word has length 65 [2022-10-16 13:26:59,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:26:59,574 INFO L495 AbstractCegarLoop]: Abstraction has 3690 states and 5122 transitions. [2022-10-16 13:26:59,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-16 13:26:59,575 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 5122 transitions. [2022-10-16 13:26:59,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-10-16 13:26:59,576 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:26:59,576 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:26:59,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 13:26:59,577 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-16 13:26:59,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:26:59,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2138713405, now seen corresponding path program 1 times [2022-10-16 13:26:59,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:26:59,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970268179] [2022-10-16 13:26:59,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:26:59,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:26:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:59,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:26:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:59,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:26:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:59,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:26:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:59,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 13:26:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:59,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 13:26:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:59,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 13:26:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:59,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-10-16 13:26:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:26:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 13:26:59,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:26:59,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970268179] [2022-10-16 13:26:59,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970268179] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:26:59,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:26:59,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:26:59,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502634342] [2022-10-16 13:26:59,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:26:59,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:26:59,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:26:59,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:26:59,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:26:59,776 INFO L87 Difference]: Start difference. First operand 3690 states and 5122 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 13:27:00,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:27:00,471 INFO L93 Difference]: Finished difference Result 7605 states and 10623 transitions. [2022-10-16 13:27:00,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 13:27:00,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2022-10-16 13:27:00,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:27:00,489 INFO L225 Difference]: With dead ends: 7605 [2022-10-16 13:27:00,490 INFO L226 Difference]: Without dead ends: 4075 [2022-10-16 13:27:00,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-16 13:27:00,501 INFO L413 NwaCegarLoop]: 478 mSDtfsCounter, 626 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 13:27:00,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 993 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 13:27:00,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2022-10-16 13:27:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 3638. [2022-10-16 13:27:00,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3638 states, 2879 states have (on average 1.416464050017367) internal successors, (4078), 2994 states have internal predecessors, (4078), 475 states have call successors, (475), 254 states have call predecessors, (475), 252 states have return successors, (473), 427 states have call predecessors, (473), 473 states have call successors, (473) [2022-10-16 13:27:00,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3638 states to 3638 states and 5026 transitions. [2022-10-16 13:27:00,877 INFO L78 Accepts]: Start accepts. Automaton has 3638 states and 5026 transitions. Word has length 68 [2022-10-16 13:27:00,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:27:00,878 INFO L495 AbstractCegarLoop]: Abstraction has 3638 states and 5026 transitions. [2022-10-16 13:27:00,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 13:27:00,878 INFO L276 IsEmpty]: Start isEmpty. Operand 3638 states and 5026 transitions. [2022-10-16 13:27:00,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-10-16 13:27:00,879 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:27:00,879 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:27:00,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 13:27:00,880 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting lock_torture_stats_printErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-16 13:27:00,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:27:00,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1041502052, now seen corresponding path program 1 times [2022-10-16 13:27:00,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:27:00,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673611482] [2022-10-16 13:27:00,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:27:00,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:27:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:01,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:27:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:01,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:27:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:01,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:27:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:01,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 13:27:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:01,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 13:27:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:01,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 13:27:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:01,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-10-16 13:27:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:01,127 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 13:27:01,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:27:01,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673611482] [2022-10-16 13:27:01,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673611482] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:27:01,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:27:01,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 13:27:01,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113950788] [2022-10-16 13:27:01,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:27:01,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:27:01,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:27:01,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:27:01,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:27:01,130 INFO L87 Difference]: Start difference. First operand 3638 states and 5026 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 13:27:02,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:27:02,123 INFO L93 Difference]: Finished difference Result 4489 states and 6375 transitions. [2022-10-16 13:27:02,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 13:27:02,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 75 [2022-10-16 13:27:02,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:27:02,140 INFO L225 Difference]: With dead ends: 4489 [2022-10-16 13:27:02,140 INFO L226 Difference]: Without dead ends: 4483 [2022-10-16 13:27:02,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:27:02,144 INFO L413 NwaCegarLoop]: 486 mSDtfsCounter, 239 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 13:27:02,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 1284 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 13:27:02,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4483 states. [2022-10-16 13:27:02,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4483 to 3766. [2022-10-16 13:27:02,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3766 states, 3007 states have (on average 1.4250083139341536) internal successors, (4285), 3122 states have internal predecessors, (4285), 475 states have call successors, (475), 254 states have call predecessors, (475), 252 states have return successors, (473), 427 states have call predecessors, (473), 473 states have call successors, (473) [2022-10-16 13:27:02,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3766 states to 3766 states and 5233 transitions. [2022-10-16 13:27:02,611 INFO L78 Accepts]: Start accepts. Automaton has 3766 states and 5233 transitions. Word has length 75 [2022-10-16 13:27:02,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:27:02,612 INFO L495 AbstractCegarLoop]: Abstraction has 3766 states and 5233 transitions. [2022-10-16 13:27:02,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 13:27:02,612 INFO L276 IsEmpty]: Start isEmpty. Operand 3766 states and 5233 transitions. [2022-10-16 13:27:02,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-10-16 13:27:02,618 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:27:02,618 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:27:02,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 13:27:02,618 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting lock_torture_stats_printErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-16 13:27:02,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:27:02,619 INFO L85 PathProgramCache]: Analyzing trace with hash 541071691, now seen corresponding path program 1 times [2022-10-16 13:27:02,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:27:02,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666990222] [2022-10-16 13:27:02,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:27:02,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:27:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:02,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:27:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:02,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:27:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:02,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:27:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:02,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 13:27:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:02,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 13:27:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:02,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 13:27:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:02,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-10-16 13:27:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:02,916 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 13:27:02,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:27:02,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666990222] [2022-10-16 13:27:02,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666990222] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:27:02,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:27:02,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 13:27:02,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746356219] [2022-10-16 13:27:02,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:27:02,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 13:27:02,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:27:02,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 13:27:02,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:27:02,921 INFO L87 Difference]: Start difference. First operand 3766 states and 5233 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 13:27:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:27:04,133 INFO L93 Difference]: Finished difference Result 7938 states and 11126 transitions. [2022-10-16 13:27:04,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 13:27:04,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 78 [2022-10-16 13:27:04,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:27:04,151 INFO L225 Difference]: With dead ends: 7938 [2022-10-16 13:27:04,152 INFO L226 Difference]: Without dead ends: 4292 [2022-10-16 13:27:04,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-16 13:27:04,165 INFO L413 NwaCegarLoop]: 508 mSDtfsCounter, 390 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 13:27:04,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1361 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-16 13:27:04,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4292 states. [2022-10-16 13:27:04,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4292 to 3743. [2022-10-16 13:27:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3743 states, 2984 states have (on average 1.4222520107238605) internal successors, (4244), 3099 states have internal predecessors, (4244), 475 states have call successors, (475), 254 states have call predecessors, (475), 252 states have return successors, (473), 427 states have call predecessors, (473), 473 states have call successors, (473) [2022-10-16 13:27:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5192 transitions. [2022-10-16 13:27:04,548 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5192 transitions. Word has length 78 [2022-10-16 13:27:04,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:27:04,549 INFO L495 AbstractCegarLoop]: Abstraction has 3743 states and 5192 transitions. [2022-10-16 13:27:04,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 13:27:04,549 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5192 transitions. [2022-10-16 13:27:04,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-10-16 13:27:04,551 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:27:04,551 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:27:04,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 13:27:04,551 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting lock_torture_cleanupErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-16 13:27:04,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:27:04,552 INFO L85 PathProgramCache]: Analyzing trace with hash -165857091, now seen corresponding path program 1 times [2022-10-16 13:27:04,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:27:04,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921971407] [2022-10-16 13:27:04,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:27:04,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:27:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:04,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:27:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:04,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:27:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:04,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:27:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:04,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 13:27:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:04,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 13:27:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:04,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 13:27:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:04,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-10-16 13:27:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:04,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 13:27:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:04,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 13:27:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:27:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 13:27:04,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:27:04,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921971407] [2022-10-16 13:27:04,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921971407] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:27:04,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:27:04,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 13:27:04,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102436901] [2022-10-16 13:27:04,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:27:04,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:27:04,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:27:04,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:27:04,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:27:04,722 INFO L87 Difference]: Start difference. First operand 3743 states and 5192 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 13:27:05,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:27:05,883 INFO L93 Difference]: Finished difference Result 4449 states and 6309 transitions. [2022-10-16 13:27:05,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 13:27:05,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 81 [2022-10-16 13:27:05,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:27:05,900 INFO L225 Difference]: With dead ends: 4449 [2022-10-16 13:27:05,901 INFO L226 Difference]: Without dead ends: 4447 [2022-10-16 13:27:05,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:27:05,904 INFO L413 NwaCegarLoop]: 499 mSDtfsCounter, 174 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 13:27:05,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1309 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 13:27:05,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4447 states. [2022-10-16 13:27:06,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4447 to 3779. [2022-10-16 13:27:06,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3779 states, 3011 states have (on average 1.4214546662238459) internal successors, (4280), 3126 states have internal predecessors, (4280), 484 states have call successors, (484), 254 states have call predecessors, (484), 252 states have return successors, (482), 436 states have call predecessors, (482), 482 states have call successors, (482) [2022-10-16 13:27:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3779 states to 3779 states and 5246 transitions. [2022-10-16 13:27:06,369 INFO L78 Accepts]: Start accepts. Automaton has 3779 states and 5246 transitions. Word has length 81 [2022-10-16 13:27:06,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:27:06,369 INFO L495 AbstractCegarLoop]: Abstraction has 3779 states and 5246 transitions. [2022-10-16 13:27:06,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 13:27:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3779 states and 5246 transitions. [2022-10-16 13:27:06,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-10-16 13:27:06,371 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:27:06,371 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:27:06,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-16 13:27:06,372 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting lock_torture_stats_printErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-16 13:27:06,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:27:06,372 INFO L85 PathProgramCache]: Analyzing trace with hash -23297391, now seen corresponding path program 1 times [2022-10-16 13:27:06,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:27:06,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959444930] [2022-10-16 13:27:06,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:27:06,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:27:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 13:27:06,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 13:27:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 13:27:06,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 13:27:06,697 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 13:27:06,698 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location lock_torture_stats_printErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 42 remaining) [2022-10-16 13:27:06,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 42 remaining) [2022-10-16 13:27:06,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 42 remaining) [2022-10-16 13:27:06,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lock_torture_stats_printErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 42 remaining) [2022-10-16 13:27:06,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lock_torture_stats_printErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 42 remaining) [2022-10-16 13:27:06,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lock_torture_stats_printErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 42 remaining) [2022-10-16 13:27:06,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lock_torture_stats_printErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 42 remaining) [2022-10-16 13:27:06,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lock_torture_stats_printErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 42 remaining) [2022-10-16 13:27:06,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lock_torture_stats_printErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 42 remaining) [2022-10-16 13:27:06,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lock_torture_stats_printErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 42 remaining) [2022-10-16 13:27:06,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lock_torture_stats_printErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 42 remaining) [2022-10-16 13:27:06,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lock_torture_stats_printErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 42 remaining) [2022-10-16 13:27:06,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location torture_spin_lock_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 42 remaining) [2022-10-16 13:27:06,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location torture_spin_lock_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 42 remaining) [2022-10-16 13:27:06,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location torture_spin_lock_write_delayErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 42 remaining) [2022-10-16 13:27:06,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location torture_spin_lock_write_delayErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 42 remaining) [2022-10-16 13:27:06,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lock_torture_cleanupErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 42 remaining) [2022-10-16 13:27:06,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lock_torture_cleanupErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 42 remaining) [2022-10-16 13:27:06,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 42 remaining) [2022-10-16 13:27:06,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 42 remaining) [2022-10-16 13:27:06,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 42 remaining) [2022-10-16 13:27:06,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 42 remaining) [2022-10-16 13:27:06,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 42 remaining) [2022-10-16 13:27:06,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 42 remaining) [2022-10-16 13:27:06,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 42 remaining) [2022-10-16 13:27:06,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 42 remaining) [2022-10-16 13:27:06,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 42 remaining) [2022-10-16 13:27:06,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 42 remaining) [2022-10-16 13:27:06,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 42 remaining) [2022-10-16 13:27:06,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 42 remaining) [2022-10-16 13:27:06,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 42 remaining) [2022-10-16 13:27:06,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 42 remaining) [2022-10-16 13:27:06,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 42 remaining) [2022-10-16 13:27:06,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 42 remaining) [2022-10-16 13:27:06,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 42 remaining) [2022-10-16 13:27:06,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 42 remaining) [2022-10-16 13:27:06,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 42 remaining) [2022-10-16 13:27:06,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 42 remaining) [2022-10-16 13:27:06,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 42 remaining) [2022-10-16 13:27:06,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 42 remaining) [2022-10-16 13:27:06,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 42 remaining) [2022-10-16 13:27:06,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 42 remaining) [2022-10-16 13:27:06,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-16 13:27:06,715 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:27:06,722 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 13:27:06,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:27:06 BoogieIcfgContainer [2022-10-16 13:27:06,904 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 13:27:06,905 INFO L158 Benchmark]: Toolchain (without parser) took 29822.71ms. Allocated memory was 151.0MB in the beginning and 897.6MB in the end (delta: 746.6MB). Free memory was 121.6MB in the beginning and 743.3MB in the end (delta: -621.7MB). Peak memory consumption was 126.3MB. Max. memory is 8.0GB. [2022-10-16 13:27:06,905 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 151.0MB. Free memory was 122.5MB in the beginning and 122.4MB in the end (delta: 82.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 13:27:06,906 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1225.94ms. Allocated memory is still 151.0MB. Free memory was 121.4MB in the beginning and 105.5MB in the end (delta: 16.0MB). Peak memory consumption was 28.6MB. Max. memory is 8.0GB. [2022-10-16 13:27:06,906 INFO L158 Benchmark]: Boogie Procedure Inliner took 121.53ms. Allocated memory is still 151.0MB. Free memory was 105.5MB in the beginning and 99.7MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-16 13:27:06,906 INFO L158 Benchmark]: Boogie Preprocessor took 141.06ms. Allocated memory is still 151.0MB. Free memory was 99.7MB in the beginning and 94.4MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-10-16 13:27:06,907 INFO L158 Benchmark]: RCFGBuilder took 1579.78ms. Allocated memory was 151.0MB in the beginning and 200.3MB in the end (delta: 49.3MB). Free memory was 93.9MB in the beginning and 166.4MB in the end (delta: -72.5MB). Peak memory consumption was 71.7MB. Max. memory is 8.0GB. [2022-10-16 13:27:06,907 INFO L158 Benchmark]: TraceAbstraction took 26740.69ms. Allocated memory was 200.3MB in the beginning and 897.6MB in the end (delta: 697.3MB). Free memory was 165.3MB in the beginning and 743.3MB in the end (delta: -578.0MB). Peak memory consumption was 119.3MB. Max. memory is 8.0GB. [2022-10-16 13:27:06,909 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.31ms. Allocated memory is still 151.0MB. Free memory was 122.5MB in the beginning and 122.4MB in the end (delta: 82.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1225.94ms. Allocated memory is still 151.0MB. Free memory was 121.4MB in the beginning and 105.5MB in the end (delta: 16.0MB). Peak memory consumption was 28.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 121.53ms. Allocated memory is still 151.0MB. Free memory was 105.5MB in the beginning and 99.7MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 141.06ms. Allocated memory is still 151.0MB. Free memory was 99.7MB in the beginning and 94.4MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1579.78ms. Allocated memory was 151.0MB in the beginning and 200.3MB in the end (delta: 49.3MB). Free memory was 93.9MB in the beginning and 166.4MB in the end (delta: -72.5MB). Peak memory consumption was 71.7MB. Max. memory is 8.0GB. * TraceAbstraction took 26740.69ms. Allocated memory was 200.3MB in the beginning and 897.6MB in the end (delta: 697.3MB). Free memory was 165.3MB in the beginning and 743.3MB in the end (delta: -578.0MB). Peak memory consumption was 119.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 2320]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of strcmp at line 2444, overapproximation of large string literal at line 2071, overapproximation of bitwiseAnd at line 2892. Possible FailurePath: [L2036] int ldv_state_variable_3 ; [L2037] int ldv_state_variable_1 ; [L2038] int LDV_IN_INTERRUPT = 1; [L2039] int ldv_state_variable_2 ; [L2040] int ref_cnt ; [L2041] int ldv_state_variable_0 ; [L2063] static int nwriters_stress = -1; [L2064] static int onoff_holdoff = 0; [L2065] static int onoff_interval = 0; [L2066] static int shuffle_interval = 3; [L2067] static int shutdown_secs = 0; [L2068] static int stat_interval = 60; [L2069] static int stutter = 5; [L2070] static bool verbose = 1; [L2071] static char *torture_type = (char *)"spin_lock"; [L2072] static atomic_t n_lock_torture_errors ; [L2073] static struct task_struct *stats_task ; [L2074] static struct task_struct **writer_tasks ; [L2075] static int nrealwriters_stress ; [L2076] static bool lock_is_write_held ; [L2077] static struct lock_writer_stress_stats *lwsa ; [L2078] int locktorture_runnable = 1; [L2080] static struct lock_torture_ops *cur_ops ; [L2119-L2120] static struct lock_torture_ops lock_busted_ops = {0, & torture_lock_busted_write_lock, & torture_lock_busted_write_delay, & torture_lock_busted_write_unlock, 0UL, "lock_busted"}; [L2121-L2122] static spinlock_t torture_spinlock = {{{{{0U}}, 3735899821U, 4294967295U, (void *)-1, {0, {0, 0}, "torture_spinlock", 0, 0UL}}}}; [L2171-L2172] static struct lock_torture_ops spin_lock_ops = {0, & torture_spin_lock_write_lock, & torture_spin_lock_write_delay, & torture_spin_lock_write_unlock, 0UL, "spin_lock"}; [L2189-L2190] static struct lock_torture_ops spin_lock_irq_ops = {0, & torture_spin_lock_write_lock_irq, & torture_spin_lock_write_delay, & torture_lock_spin_write_unlock_irq, 0UL, "spin_lock_irq"}; [L2587] int ldv_retval_0 ; [L2888] int ldv_spin = 0; VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2598] struct torture_random_state *ldvarg0 ; [L2599] void *tmp ; [L2600] struct torture_random_state *ldvarg1 ; [L2601] void *tmp___0 ; [L2602] struct torture_random_state *ldvarg2 ; [L2603] void *tmp___1 ; [L2604] int tmp___2 ; [L2605] int tmp___3 ; [L2606] int tmp___4 ; [L2607] int tmp___5 ; [L2608] int tmp___6 ; VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2610] CALL, EXPR ldv_zalloc(16UL) VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L1978] void *p ; [L1979] void *tmp ; [L1980] int tmp___0 ; [L1982] tmp___0 = __VERIFIER_nondet_int() [L1983] COND TRUE tmp___0 != 0 [L1984] return ((void *)0); VAL [\old(size)=16, \result={0:0}, cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, size=16, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp___0=1, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2610] RET, EXPR ldv_zalloc(16UL) VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_zalloc(16UL)={0:0}, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2610] tmp = ldv_zalloc(16UL) [L2611] ldvarg0 = (struct torture_random_state *)tmp VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0={0:0}, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp={0:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2612] CALL, EXPR ldv_zalloc(16UL) VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L1978] void *p ; [L1979] void *tmp ; [L1980] int tmp___0 ; [L1982] tmp___0 = __VERIFIER_nondet_int() [L1983] COND TRUE tmp___0 != 0 [L1984] return ((void *)0); VAL [\old(size)=16, \result={0:0}, cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, size=16, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp___0=1, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2612] RET, EXPR ldv_zalloc(16UL) VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_zalloc(16UL)={0:0}, ldvarg0={0:0}, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp={0:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2612] tmp___0 = ldv_zalloc(16UL) [L2613] ldvarg1 = (struct torture_random_state *)tmp___0 VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0={0:0}, ldvarg1={0:0}, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp={0:0}, tmp___0={0:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2614] CALL, EXPR ldv_zalloc(16UL) VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L1978] void *p ; [L1979] void *tmp ; [L1980] int tmp___0 ; [L1982] tmp___0 = __VERIFIER_nondet_int() [L1983] COND TRUE tmp___0 != 0 [L1984] return ((void *)0); VAL [\old(size)=16, \result={0:0}, cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, size=16, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp___0=1, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2614] RET, EXPR ldv_zalloc(16UL) VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_zalloc(16UL)={0:0}, ldvarg0={0:0}, ldvarg1={0:0}, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp={0:0}, tmp___0={0:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2614] tmp___1 = ldv_zalloc(16UL) [L2615] ldvarg2 = (struct torture_random_state *)tmp___1 [L2616] FCALL ldv_initialize() [L2617] ldv_state_variable_1 = 0 [L2618] ref_cnt = 0 [L2619] ldv_state_variable_0 = 1 [L2620] ldv_state_variable_3 = 0 [L2621] ldv_state_variable_2 = 0 VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg2={0:0}, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2623] tmp___2 = __VERIFIER_nondet_int() [L2625] case 0: [L2683] case 1: VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg2={0:0}, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___2=1, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2684] COND TRUE ldv_state_variable_0 != 0 [L2685] tmp___4 = __VERIFIER_nondet_int() [L2687] case 0: [L2695] case 1: VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg2={0:0}, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___2=1, tmp___4=1, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2696] COND TRUE ldv_state_variable_0 == 1 [L2697] CALL lock_torture_init() [L2416] int i ; [L2417] int firsterr ; [L2418] struct lock_torture_ops *torture_ops[3U] ; [L2419] bool tmp ; [L2420] int tmp___0 ; [L2421] int tmp___1 ; [L2422] unsigned int tmp___2 ; [L2423] void *tmp___3 ; [L2424] void *tmp___4 ; [L2426] firsterr = 0 [L2427] torture_ops[0] = & lock_busted_ops [L2428] torture_ops[1] = & spin_lock_ops [L2429] torture_ops[2] = & spin_lock_irq_ops [L2430] CALL, EXPR torture_init_begin(torture_type, (int )verbose, & locktorture_runnable) [L3035] return __VERIFIER_nondet_bool(); [L2430] RET, EXPR torture_init_begin(torture_type, (int )verbose, & locktorture_runnable) [L2430] tmp = torture_init_begin(torture_type, (int )verbose, & locktorture_runnable) [L2431] COND TRUE \read(tmp) [L2432] tmp___0 = 0 VAL [cur_ops={0:0}, firsterr=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2436] COND FALSE !(\read(tmp___0)) [L2440] i = 0 VAL [cur_ops={0:0}, firsterr=0, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2451] COND TRUE (unsigned int )i <= 2U VAL [cur_ops={0:0}, firsterr=0, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2443] EXPR torture_ops[i] [L2443] cur_ops = torture_ops[i] [L2444] EXPR cur_ops->name [L2444] tmp___1 = strcmp((char const *)torture_type, cur_ops->name) [L2445] COND TRUE tmp___1 == 0 VAL [cur_ops={50:0}, firsterr=0, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, tmp___1=0, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2456] COND FALSE !(i == 3) [L2474] EXPR cur_ops->init VAL [cur_ops={50:0}, cur_ops->init={0:0}, firsterr=0, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, tmp___1=0, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2474] COND FALSE !((unsigned long )cur_ops->init != (unsigned long )((void (*)(void))0)) [L2478] COND FALSE !(nwriters_stress >= 0) [L2481] CALL, EXPR cpumask_weight(cpu_online_mask) [L1887] int tmp ; [L1889] CALL, EXPR bitmap_weight((unsigned long const *)(& srcp->bits), nr_cpu_ids) [L1877] int tmp___0 ; [L1879] CALL, EXPR __bitmap_weight(src, nbits) [L2951] return __VERIFIER_nondet_int(); [L1879] RET, EXPR __bitmap_weight(src, nbits) [L1879] tmp___0 = __bitmap_weight(src, nbits) [L1880] return (tmp___0); VAL [\old(nbits)=34359738340, \result=-1073741825, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nbits=34359738340, nr_cpu_ids=34359738340, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, src={34359738339:34359738342}, src={34359738339:34359738342}, stat_interval=60, stats_task={48:0}, stutter=5, tmp___0=-1073741825, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L1889] RET, EXPR bitmap_weight((unsigned long const *)(& srcp->bits), nr_cpu_ids) [L1889] tmp = bitmap_weight((unsigned long const *)(& srcp->bits), nr_cpu_ids) [L1890] return ((unsigned int )tmp); VAL [\result=-1073741825, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, srcp={34359738339:34359738342}, srcp={34359738339:34359738342}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=-1073741825, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2481] RET, EXPR cpumask_weight(cpu_online_mask) [L2481] tmp___2 = cpumask_weight(cpu_online_mask) [L2482] nrealwriters_stress = (int )(tmp___2 * 2U) VAL [cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, firsterr=0, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, tmp___1=0, tmp___2=3221225471, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2484] CALL lock_torture_print_module_parms(cur_ops, "Start of test") VAL [cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, cur_ops___0={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tag={36:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2484] RET lock_torture_print_module_parms(cur_ops, "Start of test") VAL [cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, firsterr=0, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, tmp___1=0, tmp___2=3221225471, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2485] lock_is_write_held = 0 VAL [cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, firsterr=0, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, tmp___1=0, tmp___2=3221225471, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2486] CALL, EXPR kmalloc((unsigned long )nrealwriters_stress * 16UL, 208U) VAL [cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2874] CALL ldv_check_alloc_flags(flags) VAL [\old(flags)=208, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2892] COND TRUE ldv_spin == 0 || ! (flags & 16U) VAL [\old(flags)=208, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, flags=208, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2874] RET ldv_check_alloc_flags(flags) VAL [\old(flags)=208, \old(size)=4294967264, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, flags=208, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, size=4294967264, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2875] CALL ldv_kmalloc_12(size, flags) [L1942] void *tmp___2 ; [L1944] CALL, EXPR __kmalloc(size, flags) [L1937] CALL, EXPR ldv_malloc(size) VAL [\old(size)=4294967264, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L1961] void *p ; [L1962] void *tmp ; [L1963] int tmp___0 ; [L1965] tmp___0 = __VERIFIER_nondet_int() [L1966] COND TRUE tmp___0 != 0 [L1967] return ((void *)0); VAL [\old(size)=4294967264, \result={0:0}, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, size=4294967264, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp___0=1, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L1937] RET, EXPR ldv_malloc(size) VAL [\old(size)=4294967264, \old(t)=208, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_malloc(size)={0:0}, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, size=4294967264, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, t=208, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L1937] return ldv_malloc(size); [L1944] RET, EXPR __kmalloc(size, flags) [L1944] tmp___2 = __kmalloc(size, flags) [L1945] return (tmp___2); VAL [\old(flags)=208, \old(size)=4294967264, \result={0:0}, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, flags=208, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, size=4294967264, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp___2={0:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2875] RET ldv_kmalloc_12(size, flags) [L2876] return ((void *)0); VAL [\old(flags)=208, \old(size)=4294967264, \result={0:0}, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, flags=208, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, size=4294967264, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2486] RET, EXPR kmalloc((unsigned long )nrealwriters_stress * 16UL, 208U) VAL [cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, firsterr=0, i=0, kmalloc((unsigned long )nrealwriters_stress * 16UL, 208U)={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, tmp___1=0, tmp___2=3221225471, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2486] tmp___3 = kmalloc((unsigned long )nrealwriters_stress * 16UL, 208U) [L2487] lwsa = (struct lock_writer_stress_stats *)tmp___3 VAL [cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, firsterr=0, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, tmp___1=0, tmp___2=3221225471, tmp___3={0:0}, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2488] COND TRUE (unsigned long )lwsa == (unsigned long )((struct lock_writer_stress_stats *)0) VAL [cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, firsterr=0, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, tmp___1=0, tmp___2=3221225471, tmp___3={0:0}, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2489] COND TRUE (int )verbose [L2493] firsterr = -12 VAL [cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, firsterr=-12, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, tmp___1=0, tmp___2=3221225471, tmp___3={0:0}, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2582] FCALL torture_init_end() VAL [cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, firsterr=-12, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, tmp___1=0, tmp___2=3221225471, tmp___3={0:0}, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2583] CALL lock_torture_cleanup() VAL [\old(writer_tasks)=0, \old(writer_tasks)=0, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2373] int i ; [L2374] bool tmp ; [L2375] bool tmp___0 ; [L2376] int tmp___1 ; [L2378] CALL, EXPR torture_cleanup() [L3031] return __VERIFIER_nondet_bool(); [L2378] RET, EXPR torture_cleanup() [L2378] tmp = torture_cleanup() [L2379] COND FALSE !((int )tmp) VAL [\old(writer_tasks)=0, \old(writer_tasks)=0, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=0, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2383] COND FALSE !((unsigned long )writer_tasks != (unsigned long )((struct task_struct **)0)) VAL [\old(writer_tasks)=0, \old(writer_tasks)=0, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=0, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2398] FCALL _torture_stop_kthread((char *)"Stopping lock_torture_stats task", & stats_task) VAL [\old(writer_tasks)=0, \old(writer_tasks)=0, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=0, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2399] CALL lock_torture_stats_print() VAL [\old(writer_tasks)=0, \old(writer_tasks)=0, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2316] int size ; [L2317] char *buf ; [L2318] void *tmp ; VAL [\old(writer_tasks)=0, \old(writer_tasks)=0, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2320] nrealwriters_stress * 200 VAL [\old(writer_tasks)=0, \old(writer_tasks)=0, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] - UnprovableResult [Line: 2096]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2096]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2320]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2320]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2320]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2286]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2286]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2295]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2295]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2304]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2304]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2142]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2142]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2157]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2157]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2388]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2388]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2664]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2664]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2672]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2672]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2449]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2449]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2463]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2463]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2502]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2502]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2509]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2509]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2509]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2509]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2562]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2562]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2759]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2759]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2767]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2767]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2817]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2817]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2825]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2825]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 28 procedures, 429 locations, 42 error locations. Started 1 CEGAR loops. OverallTime: 26.5s, OverallIterations: 16, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9382 SdHoareTripleChecker+Valid, 10.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8732 mSDsluCounter, 21018 SdHoareTripleChecker+Invalid, 8.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11611 mSDsCounter, 1838 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7188 IncrementalHoareTripleChecker+Invalid, 9026 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1838 mSolverCounterUnsat, 9407 mSDtfsCounter, 7188 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 321 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3779occurred in iteration=15, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 17941 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 919 NumberOfCodeBlocks, 919 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 859 ConstructedInterpolants, 0 QuantifiedInterpolants, 1802 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1367 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 225/242 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-16 13:27:06,960 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...