./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inl.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inl.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e9935ba6b05a3c7e4f0c65d8e33bc471835cb8eb350ac893c3dd9a00ab8c4f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:38:20,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:38:20,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:38:20,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:38:20,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:38:20,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:38:20,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:38:20,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:38:20,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:38:20,808 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:38:20,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:38:20,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:38:20,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:38:20,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:38:20,809 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:38:20,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:38:20,809 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:38:20,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:38:20,810 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:38:20,810 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:38:20,810 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:38:20,810 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:38:20,810 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:38:20,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:38:20,810 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:38:20,811 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:38:20,811 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:38:20,811 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:38:20,811 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:38:20,811 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:38:20,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:38:20,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:38:20,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:38:20,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:38:20,812 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:38:20,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:38:20,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:38:20,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:38:20,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:38:20,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:38:20,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:38:20,812 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:38:20,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:38:20,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:38:20,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:38:20,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:38:20,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:38:20,813 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e9935ba6b05a3c7e4f0c65d8e33bc471835cb8eb350ac893c3dd9a00ab8c4f5 [2025-01-09 22:38:21,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:38:21,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:38:21,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:38:21,052 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:38:21,053 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:38:21,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inl.i [2025-01-09 22:38:22,178 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e53a4793e/d9e03410eb504636a22eddc7fa506498/FLAGdd71d4515 [2025-01-09 22:38:22,621 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:38:22,621 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inl.i [2025-01-09 22:38:22,643 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e53a4793e/d9e03410eb504636a22eddc7fa506498/FLAGdd71d4515 [2025-01-09 22:38:22,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e53a4793e/d9e03410eb504636a22eddc7fa506498 [2025-01-09 22:38:22,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:38:22,659 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:38:22,660 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:38:22,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:38:22,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:38:22,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:38:22" (1/1) ... [2025-01-09 22:38:22,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f5e863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:22, skipping insertion in model container [2025-01-09 22:38:22,664 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:38:22" (1/1) ... [2025-01-09 22:38:22,705 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:38:23,328 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:38:23,347 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:38:23,360 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:38:23,416 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:38:23,441 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:38:23,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:38:23,484 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:38:23,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:38:23,758 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:38:23,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:23 WrapperNode [2025-01-09 22:38:23,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:38:23,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:38:23,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:38:23,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:38:23,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:23" (1/1) ... [2025-01-09 22:38:23,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:23" (1/1) ... [2025-01-09 22:38:23,951 INFO L138 Inliner]: procedures = 473, calls = 2667, calls flagged for inlining = 55, calls inlined = 37, statements flattened = 3342 [2025-01-09 22:38:23,952 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:38:23,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:38:23,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:38:23,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:38:23,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:23" (1/1) ... [2025-01-09 22:38:23,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:23" (1/1) ... [2025-01-09 22:38:23,979 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:23" (1/1) ... [2025-01-09 22:38:24,046 INFO L175 MemorySlicer]: Split 2024 memory accesses to 27 slices as follows [5, 3, 35, 1040, 480, 59, 35, 11, 5, 15, 37, 120, 67, 0, 12, 2, 5, 20, 4, 3, 18, 2, 2, 16, 21, 5, 2]. 51 percent of accesses are in the largest equivalence class. The 1901 initializations are split as follows [3, 3, 15, 1040, 480, 59, 32, 2, 1, 10, 25, 120, 67, 0, 6, 2, 4, 4, 4, 0, 18, 0, 0, 5, 0, 1, 0]. The 58 writes are split as follows [0, 0, 6, 0, 0, 0, 0, 5, 1, 2, 0, 0, 0, 0, 6, 0, 0, 4, 0, 0, 0, 2, 1, 8, 21, 2, 0]. [2025-01-09 22:38:24,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:23" (1/1) ... [2025-01-09 22:38:24,051 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:23" (1/1) ... [2025-01-09 22:38:24,126 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:23" (1/1) ... [2025-01-09 22:38:24,134 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:23" (1/1) ... [2025-01-09 22:38:24,147 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:23" (1/1) ... [2025-01-09 22:38:24,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:23" (1/1) ... [2025-01-09 22:38:24,170 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:23" (1/1) ... [2025-01-09 22:38:24,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:38:24,191 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:38:24,192 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:38:24,192 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:38:24,192 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:23" (1/1) ... [2025-01-09 22:38:24,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:38:24,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:38:24,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:38:24,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:38:24,237 INFO L130 BoogieDeclarations]: Found specification of procedure zf_timer_off [2025-01-09 22:38:24,237 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_timer_off [2025-01-09 22:38:24,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 22:38:24,237 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_begin [2025-01-09 22:38:24,237 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-01-09 22:38:24,237 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-01-09 22:38:24,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:38:24,237 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-01-09 22:38:24,237 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-01-09 22:38:24,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 22:38:24,238 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_end [2025-01-09 22:38:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure zf_get_control [2025-01-09 22:38:24,238 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_get_control [2025-01-09 22:38:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 22:38:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 22:38:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 22:38:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 22:38:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 22:38:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 22:38:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 22:38:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 22:38:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 22:38:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 22:38:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 22:38:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 22:38:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 22:38:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-09 22:38:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-09 22:38:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-01-09 22:38:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-01-09 22:38:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-01-09 22:38:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-01-09 22:38:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-01-09 22:38:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-01-09 22:38:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-01-09 22:38:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-01-09 22:38:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-01-09 22:38:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#24 [2025-01-09 22:38:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#25 [2025-01-09 22:38:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#26 [2025-01-09 22:38:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:38:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:38:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 22:38:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 22:38:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 22:38:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 22:38:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 22:38:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 22:38:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 22:38:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 22:38:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 22:38:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 22:38:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 22:38:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 22:38:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 22:38:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure request_region [2025-01-09 22:38:24,244 INFO L138 BoogieDeclarations]: Found implementation of procedure request_region [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-01-09 22:38:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-01-09 22:38:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#24 [2025-01-09 22:38:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#25 [2025-01-09 22:38:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#26 [2025-01-09 22:38:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 22:38:24,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 22:38:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irqsave [2025-01-09 22:38:24,245 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irqsave [2025-01-09 22:38:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-01-09 22:38:24,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-01-09 22:38:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure release_region [2025-01-09 22:38:24,245 INFO L138 BoogieDeclarations]: Found implementation of procedure release_region [2025-01-09 22:38:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:38:24,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:38:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_init [2025-01-09 22:38:24,245 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_init [2025-01-09 22:38:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 22:38:24,247 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 22:38:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-01-09 22:38:24,247 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-01-09 22:38:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:38:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:38:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:38:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#24 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#25 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#26 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-01-09 22:38:24,248 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_add [2025-01-09 22:38:24,248 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_add [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-01-09 22:38:24,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 22:38:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#24 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#25 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#26 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 22:38:24,249 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2025-01-09 22:38:24,249 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2025-01-09 22:38:24,249 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure misc_deregister [2025-01-09 22:38:24,249 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_deregister [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure assert_context_process [2025-01-09 22:38:24,249 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_context_process [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure zf_set_control [2025-01-09 22:38:24,249 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_set_control [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 22:38:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 22:38:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 22:38:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 22:38:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 22:38:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 22:38:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 22:38:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 22:38:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 22:38:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 22:38:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 22:38:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 22:38:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 22:38:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-09 22:38:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-01-09 22:38:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-01-09 22:38:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-01-09 22:38:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-01-09 22:38:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-01-09 22:38:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-01-09 22:38:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-01-09 22:38:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-01-09 22:38:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure zf_readw [2025-01-09 22:38:24,253 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_readw [2025-01-09 22:38:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure zf_ping [2025-01-09 22:38:24,253 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_ping [2025-01-09 22:38:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-01-09 22:38:24,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-01-09 22:38:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-01-09 22:38:24,253 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-01-09 22:38:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-01-09 22:38:24,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-01-09 22:38:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:38:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:38:24,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:38:24,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 22:38:24,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 22:38:24,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 22:38:24,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 22:38:24,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 22:38:24,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 22:38:24,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 22:38:24,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 22:38:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 22:38:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 22:38:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 22:38:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 22:38:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 22:38:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 22:38:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 22:38:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 22:38:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 22:38:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-01-09 22:38:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-01-09 22:38:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-01-09 22:38:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-01-09 22:38:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-01-09 22:38:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-01-09 22:38:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-01-09 22:38:24,655 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:38:24,657 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:38:28,427 INFO L? ?]: Removed 648 outVars from TransFormulas that were not future-live. [2025-01-09 22:38:28,427 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:38:28,464 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:38:28,464 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 22:38:28,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:38:28 BoogieIcfgContainer [2025-01-09 22:38:28,464 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:38:28,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:38:28,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:38:28,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:38:28,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:38:22" (1/3) ... [2025-01-09 22:38:28,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a57a2b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:38:28, skipping insertion in model container [2025-01-09 22:38:28,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:23" (2/3) ... [2025-01-09 22:38:28,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a57a2b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:38:28, skipping insertion in model container [2025-01-09 22:38:28,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:38:28" (3/3) ... [2025-01-09 22:38:28,478 INFO L128 eAbstractionObserver]: Analyzing ICFG ddv_machzwd_inl.i [2025-01-09 22:38:28,492 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:38:28,495 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ddv_machzwd_inl.i that has 29 procedures, 701 locations, 1 initial locations, 4 loop locations, and 205 error locations. [2025-01-09 22:38:28,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:38:28,562 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@4697025e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:38:28,565 INFO L334 AbstractCegarLoop]: Starting to check reachability of 205 error locations. [2025-01-09 22:38:28,569 INFO L276 IsEmpty]: Start isEmpty. Operand has 697 states, 387 states have (on average 1.7881136950904393) internal successors, (692), 598 states have internal predecessors, (692), 78 states have call successors, (78), 26 states have call predecessors, (78), 26 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 22:38:28,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:38:28,575 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:38:28,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:38:28,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:38:28,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:38:28,583 INFO L85 PathProgramCache]: Analyzing trace with hash 451259655, now seen corresponding path program 1 times [2025-01-09 22:38:28,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:38:28,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998089323] [2025-01-09 22:38:28,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:38:28,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:38:30,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:38:31,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:38:31,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:38:31,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:38:31,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:38:31,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:38:31,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998089323] [2025-01-09 22:38:31,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998089323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:38:31,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:38:31,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:38:31,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410839805] [2025-01-09 22:38:31,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:38:31,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:38:31,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:38:31,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:38:31,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:38:31,886 INFO L87 Difference]: Start difference. First operand has 697 states, 387 states have (on average 1.7881136950904393) internal successors, (692), 598 states have internal predecessors, (692), 78 states have call successors, (78), 26 states have call predecessors, (78), 26 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:38:34,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:38:35,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:38:35,475 INFO L93 Difference]: Finished difference Result 1261 states and 1525 transitions. [2025-01-09 22:38:35,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:38:35,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 22:38:35,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:38:35,487 INFO L225 Difference]: With dead ends: 1261 [2025-01-09 22:38:35,488 INFO L226 Difference]: Without dead ends: 1257 [2025-01-09 22:38:35,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:38:35,490 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 723 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 2543 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:38:35,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 2543 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-09 22:38:35,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2025-01-09 22:38:35,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1044. [2025-01-09 22:38:35,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 651 states have (on average 1.771121351766513) internal successors, (1153), 873 states have internal predecessors, (1153), 138 states have call successors, (138), 50 states have call predecessors, (138), 50 states have return successors, (138), 131 states have call predecessors, (138), 138 states have call successors, (138) [2025-01-09 22:38:35,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1429 transitions. [2025-01-09 22:38:35,569 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1429 transitions. Word has length 5 [2025-01-09 22:38:35,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:38:35,570 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1429 transitions. [2025-01-09 22:38:35,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:38:35,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1429 transitions. [2025-01-09 22:38:35,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:38:35,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:38:35,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:38:35,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:38:35,571 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:38:35,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:38:35,572 INFO L85 PathProgramCache]: Analyzing trace with hash 451259656, now seen corresponding path program 1 times [2025-01-09 22:38:35,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:38:35,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893617251] [2025-01-09 22:38:35,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:38:35,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:38:37,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:38:37,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:38:37,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:38:37,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:38:38,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:38:38,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:38:38,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893617251] [2025-01-09 22:38:38,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893617251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:38:38,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:38:38,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:38:38,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932451198] [2025-01-09 22:38:38,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:38:38,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:38:38,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:38:38,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:38:38,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:38:38,541 INFO L87 Difference]: Start difference. First operand 1044 states and 1429 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:38:39,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:38:41,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:38:42,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:38:42,383 INFO L93 Difference]: Finished difference Result 1183 states and 1531 transitions. [2025-01-09 22:38:42,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:38:42,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 22:38:42,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:38:42,392 INFO L225 Difference]: With dead ends: 1183 [2025-01-09 22:38:42,392 INFO L226 Difference]: Without dead ends: 1183 [2025-01-09 22:38:42,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:38:42,393 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 279 mSDsluCounter, 1924 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 2807 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-01-09 22:38:42,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 2807 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-01-09 22:38:42,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-01-09 22:38:42,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1124. [2025-01-09 22:38:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 699 states have (on average 1.7353361945636623) internal successors, (1213), 922 states have internal predecessors, (1213), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2025-01-09 22:38:42,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1527 transitions. [2025-01-09 22:38:42,432 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1527 transitions. Word has length 5 [2025-01-09 22:38:42,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:38:42,432 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1527 transitions. [2025-01-09 22:38:42,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:38:42,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1527 transitions. [2025-01-09 22:38:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:38:42,433 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:38:42,433 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:38:42,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:38:42,433 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:38:42,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:38:42,433 INFO L85 PathProgramCache]: Analyzing trace with hash 2014150784, now seen corresponding path program 1 times [2025-01-09 22:38:42,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:38:42,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732846869] [2025-01-09 22:38:42,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:38:42,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:38:44,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:38:44,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:38:44,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:38:44,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:38:44,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:38:44,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:38:44,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732846869] [2025-01-09 22:38:44,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732846869] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:38:44,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:38:44,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:38:44,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732322609] [2025-01-09 22:38:44,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:38:44,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:38:44,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:38:44,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:38:44,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:38:44,528 INFO L87 Difference]: Start difference. First operand 1124 states and 1527 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:38:44,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:38:44,960 INFO L93 Difference]: Finished difference Result 1330 states and 1614 transitions. [2025-01-09 22:38:44,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:38:44,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-01-09 22:38:44,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:38:44,965 INFO L225 Difference]: With dead ends: 1330 [2025-01-09 22:38:44,965 INFO L226 Difference]: Without dead ends: 1330 [2025-01-09 22:38:44,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:38:44,966 INFO L435 NwaCegarLoop]: 748 mSDtfsCounter, 705 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:38:44,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 1336 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:38:44,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-01-09 22:38:45,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1123. [2025-01-09 22:38:45,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 699 states have (on average 1.7281831187410586) internal successors, (1208), 921 states have internal predecessors, (1208), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2025-01-09 22:38:45,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1522 transitions. [2025-01-09 22:38:45,014 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1522 transitions. Word has length 11 [2025-01-09 22:38:45,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:38:45,014 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1522 transitions. [2025-01-09 22:38:45,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:38:45,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1522 transitions. [2025-01-09 22:38:45,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:38:45,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:38:45,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:38:45,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:38:45,015 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:38:45,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:38:45,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2014150785, now seen corresponding path program 1 times [2025-01-09 22:38:45,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:38:45,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616657245] [2025-01-09 22:38:45,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:38:45,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:38:46,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:38:46,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:38:46,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:38:46,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:38:47,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:38:47,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:38:47,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616657245] [2025-01-09 22:38:47,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616657245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:38:47,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:38:47,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:38:47,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103042785] [2025-01-09 22:38:47,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:38:47,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:38:47,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:38:47,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:38:47,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:38:47,250 INFO L87 Difference]: Start difference. First operand 1123 states and 1522 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:38:49,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:38:50,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:38:50,195 INFO L93 Difference]: Finished difference Result 1187 states and 1537 transitions. [2025-01-09 22:38:50,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:38:50,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-01-09 22:38:50,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:38:50,204 INFO L225 Difference]: With dead ends: 1187 [2025-01-09 22:38:50,205 INFO L226 Difference]: Without dead ends: 1187 [2025-01-09 22:38:50,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:38:50,210 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 277 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-09 22:38:50,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 2127 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-09 22:38:50,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2025-01-09 22:38:50,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1126. [2025-01-09 22:38:50,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 702 states have (on average 1.725071225071225) internal successors, (1211), 924 states have internal predecessors, (1211), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2025-01-09 22:38:50,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1525 transitions. [2025-01-09 22:38:50,262 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1525 transitions. Word has length 11 [2025-01-09 22:38:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:38:50,262 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1525 transitions. [2025-01-09 22:38:50,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:38:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1525 transitions. [2025-01-09 22:38:50,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:38:50,263 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:38:50,263 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:38:50,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:38:50,263 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:38:50,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:38:50,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1421665366, now seen corresponding path program 1 times [2025-01-09 22:38:50,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:38:50,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154577593] [2025-01-09 22:38:50,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:38:50,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:38:51,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:38:51,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:38:51,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:38:51,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:38:52,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:38:52,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:38:52,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154577593] [2025-01-09 22:38:52,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154577593] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:38:52,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175273005] [2025-01-09 22:38:52,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:38:52,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:38:52,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:38:52,522 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:38:52,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 22:38:54,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:38:54,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:38:54,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:38:54,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:38:54,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 5614 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:38:54,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:38:55,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:38:55,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:38:55,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:38:55,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175273005] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:38:55,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:38:55,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 11 [2025-01-09 22:38:55,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157797780] [2025-01-09 22:38:55,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:38:55,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:38:55,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:38:55,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:38:55,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:38:55,112 INFO L87 Difference]: Start difference. First operand 1126 states and 1525 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:38:57,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:00,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:01,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:04,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:04,128 INFO L93 Difference]: Finished difference Result 1402 states and 1775 transitions. [2025-01-09 22:39:04,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:39:04,129 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 14 [2025-01-09 22:39:04,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:04,133 INFO L225 Difference]: With dead ends: 1402 [2025-01-09 22:39:04,133 INFO L226 Difference]: Without dead ends: 1402 [2025-01-09 22:39:04,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:39:04,134 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 745 mSDsluCounter, 4326 mSDsCounter, 0 mSdLazyCounter, 2475 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 5213 SdHoareTripleChecker+Invalid, 2622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 2475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:04,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 5213 Invalid, 2622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 2475 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2025-01-09 22:39:04,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2025-01-09 22:39:04,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1278. [2025-01-09 22:39:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 812 states have (on average 1.7105911330049262) internal successors, (1389), 1035 states have internal predecessors, (1389), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-01-09 22:39:04,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1757 transitions. [2025-01-09 22:39:04,154 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1757 transitions. Word has length 14 [2025-01-09 22:39:04,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:04,154 INFO L471 AbstractCegarLoop]: Abstraction has 1278 states and 1757 transitions. [2025-01-09 22:39:04,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:39:04,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1757 transitions. [2025-01-09 22:39:04,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:39:04,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:04,155 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:39:04,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 22:39:04,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:39:04,356 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:04,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:04,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1317601804, now seen corresponding path program 1 times [2025-01-09 22:39:04,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:04,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032449720] [2025-01-09 22:39:04,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:04,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:06,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:39:06,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:39:06,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:06,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:06,438 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:39:06,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:06,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032449720] [2025-01-09 22:39:06,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032449720] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:39:06,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:39:06,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:39:06,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646009095] [2025-01-09 22:39:06,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:39:06,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:39:06,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:06,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:39:06,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:39:06,439 INFO L87 Difference]: Start difference. First operand 1278 states and 1757 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:39:06,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:06,840 INFO L93 Difference]: Finished difference Result 1486 states and 1850 transitions. [2025-01-09 22:39:06,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:39:06,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-01-09 22:39:06,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:06,844 INFO L225 Difference]: With dead ends: 1486 [2025-01-09 22:39:06,844 INFO L226 Difference]: Without dead ends: 1486 [2025-01-09 22:39:06,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:39:06,846 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 691 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:06,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1340 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:39:06,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2025-01-09 22:39:06,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1276. [2025-01-09 22:39:06,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 812 states have (on average 1.6995073891625616) internal successors, (1380), 1033 states have internal predecessors, (1380), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-01-09 22:39:06,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1748 transitions. [2025-01-09 22:39:06,869 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1748 transitions. Word has length 24 [2025-01-09 22:39:06,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:06,869 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1748 transitions. [2025-01-09 22:39:06,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:39:06,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1748 transitions. [2025-01-09 22:39:06,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:39:06,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:06,870 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:39:06,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:39:06,870 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:06,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:06,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1317601805, now seen corresponding path program 1 times [2025-01-09 22:39:06,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:06,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22156415] [2025-01-09 22:39:06,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:06,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:08,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:39:08,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:39:08,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:08,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:39:08,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:08,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22156415] [2025-01-09 22:39:08,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22156415] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:39:08,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966897288] [2025-01-09 22:39:08,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:08,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:39:08,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:39:08,874 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:39:08,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 22:39:10,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:39:11,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:39:11,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:11,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:11,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 5674 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 22:39:11,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:39:11,427 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:39:11,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:39:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:39:11,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966897288] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:39:11,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:39:11,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-09 22:39:11,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339520540] [2025-01-09 22:39:11,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:39:11,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:39:11,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:11,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:39:11,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:39:11,488 INFO L87 Difference]: Start difference. First operand 1276 states and 1748 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:39:11,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:11,580 INFO L93 Difference]: Finished difference Result 1294 states and 1766 transitions. [2025-01-09 22:39:11,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:39:11,581 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-01-09 22:39:11,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:11,584 INFO L225 Difference]: With dead ends: 1294 [2025-01-09 22:39:11,584 INFO L226 Difference]: Without dead ends: 1294 [2025-01-09 22:39:11,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:39:11,586 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 13 mSDsluCounter, 3272 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4094 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:11,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4094 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:39:11,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2025-01-09 22:39:11,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1294. [2025-01-09 22:39:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 830 states have (on average 1.6843373493975904) internal successors, (1398), 1051 states have internal predecessors, (1398), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-01-09 22:39:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1766 transitions. [2025-01-09 22:39:11,606 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1766 transitions. Word has length 24 [2025-01-09 22:39:11,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:11,606 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 1766 transitions. [2025-01-09 22:39:11,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:39:11,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1766 transitions. [2025-01-09 22:39:11,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:39:11,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:11,607 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:39:11,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 22:39:11,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:39:11,808 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:11,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:11,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1524319213, now seen corresponding path program 2 times [2025-01-09 22:39:11,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:11,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336740151] [2025-01-09 22:39:11,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:39:11,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:13,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-09 22:39:13,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-01-09 22:39:13,570 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:39:13,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:13,975 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:39:13,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:13,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336740151] [2025-01-09 22:39:13,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336740151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:39:13,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:39:13,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:39:13,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257845242] [2025-01-09 22:39:13,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:39:13,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:39:13,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:13,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:39:13,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:39:13,978 INFO L87 Difference]: Start difference. First operand 1294 states and 1766 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:39:15,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:15,231 INFO L93 Difference]: Finished difference Result 1350 states and 1778 transitions. [2025-01-09 22:39:15,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:39:15,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2025-01-09 22:39:15,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:15,235 INFO L225 Difference]: With dead ends: 1350 [2025-01-09 22:39:15,235 INFO L226 Difference]: Without dead ends: 1350 [2025-01-09 22:39:15,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:39:15,235 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 255 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:15,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1593 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 22:39:15,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2025-01-09 22:39:15,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1292. [2025-01-09 22:39:15,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 830 states have (on average 1.6819277108433734) internal successors, (1396), 1049 states have internal predecessors, (1396), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-01-09 22:39:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1764 transitions. [2025-01-09 22:39:15,254 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1764 transitions. Word has length 42 [2025-01-09 22:39:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:15,255 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 1764 transitions. [2025-01-09 22:39:15,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:39:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1764 transitions. [2025-01-09 22:39:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 22:39:15,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:15,257 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:39:15,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:39:15,257 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:15,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:15,257 INFO L85 PathProgramCache]: Analyzing trace with hash 79929795, now seen corresponding path program 1 times [2025-01-09 22:39:15,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:15,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539805236] [2025-01-09 22:39:15,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:15,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:16,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 22:39:16,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 22:39:16,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:16,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-09 22:39:17,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:17,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539805236] [2025-01-09 22:39:17,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539805236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:39:17,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:39:17,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:39:17,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212910851] [2025-01-09 22:39:17,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:39:17,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:39:17,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:17,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:39:17,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:39:17,274 INFO L87 Difference]: Start difference. First operand 1292 states and 1764 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:39:17,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:17,291 INFO L93 Difference]: Finished difference Result 1291 states and 1761 transitions. [2025-01-09 22:39:17,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:39:17,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 66 [2025-01-09 22:39:17,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:17,294 INFO L225 Difference]: With dead ends: 1291 [2025-01-09 22:39:17,294 INFO L226 Difference]: Without dead ends: 1291 [2025-01-09 22:39:17,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:39:17,296 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 814 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:17,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 824 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:39:17,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2025-01-09 22:39:17,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2025-01-09 22:39:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 829 states have (on average 1.6803377563329311) internal successors, (1393), 1048 states have internal predecessors, (1393), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-01-09 22:39:17,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1761 transitions. [2025-01-09 22:39:17,313 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1761 transitions. Word has length 66 [2025-01-09 22:39:17,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:17,314 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1761 transitions. [2025-01-09 22:39:17,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:39:17,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1761 transitions. [2025-01-09 22:39:17,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 22:39:17,315 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:17,315 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:39:17,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:39:17,316 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:17,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:17,316 INFO L85 PathProgramCache]: Analyzing trace with hash -506371522, now seen corresponding path program 1 times [2025-01-09 22:39:17,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:17,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487314387] [2025-01-09 22:39:17,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:17,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:19,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 22:39:19,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 22:39:19,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:19,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:19,310 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-09 22:39:19,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:19,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487314387] [2025-01-09 22:39:19,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487314387] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:39:19,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:39:19,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:39:19,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935030324] [2025-01-09 22:39:19,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:39:19,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:39:19,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:19,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:39:19,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:39:19,312 INFO L87 Difference]: Start difference. First operand 1291 states and 1761 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:39:20,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:20,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:20,798 INFO L93 Difference]: Finished difference Result 1290 states and 1760 transitions. [2025-01-09 22:39:20,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:39:20,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2025-01-09 22:39:20,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:20,802 INFO L225 Difference]: With dead ends: 1290 [2025-01-09 22:39:20,803 INFO L226 Difference]: Without dead ends: 1290 [2025-01-09 22:39:20,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:39:20,804 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 1 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:20,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1438 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 22:39:20,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-01-09 22:39:20,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2025-01-09 22:39:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 829 states have (on average 1.6791314837153197) internal successors, (1392), 1047 states have internal predecessors, (1392), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-01-09 22:39:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1760 transitions. [2025-01-09 22:39:20,819 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1760 transitions. Word has length 68 [2025-01-09 22:39:20,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:20,819 INFO L471 AbstractCegarLoop]: Abstraction has 1290 states and 1760 transitions. [2025-01-09 22:39:20,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:39:20,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1760 transitions. [2025-01-09 22:39:20,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 22:39:20,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:20,821 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:39:20,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:39:20,825 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:20,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:20,826 INFO L85 PathProgramCache]: Analyzing trace with hash -506371521, now seen corresponding path program 1 times [2025-01-09 22:39:20,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:20,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781054184] [2025-01-09 22:39:20,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:20,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:22,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 22:39:22,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 22:39:22,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:22,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:23,520 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-09 22:39:23,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:23,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781054184] [2025-01-09 22:39:23,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781054184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:39:23,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:39:23,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:39:23,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875405195] [2025-01-09 22:39:23,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:39:23,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:39:23,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:23,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:39:23,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:39:23,522 INFO L87 Difference]: Start difference. First operand 1290 states and 1760 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:39:25,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:25,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:25,661 INFO L93 Difference]: Finished difference Result 1289 states and 1759 transitions. [2025-01-09 22:39:25,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:39:25,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 68 [2025-01-09 22:39:25,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:25,665 INFO L225 Difference]: With dead ends: 1289 [2025-01-09 22:39:25,665 INFO L226 Difference]: Without dead ends: 1289 [2025-01-09 22:39:25,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:39:25,666 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 809 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:25,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1441 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 22:39:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2025-01-09 22:39:25,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1289. [2025-01-09 22:39:25,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 829 states have (on average 1.677925211097708) internal successors, (1391), 1046 states have internal predecessors, (1391), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-01-09 22:39:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1759 transitions. [2025-01-09 22:39:25,683 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1759 transitions. Word has length 68 [2025-01-09 22:39:25,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:25,683 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1759 transitions. [2025-01-09 22:39:25,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:39:25,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1759 transitions. [2025-01-09 22:39:25,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 22:39:25,684 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:25,684 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:39:25,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:39:25,684 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr164ASSERT_VIOLATIONMEMORY_LEAK === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:25,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:25,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1842524180, now seen corresponding path program 1 times [2025-01-09 22:39:25,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:25,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219622831] [2025-01-09 22:39:25,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:25,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:27,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 22:39:27,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 22:39:27,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:27,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:27,773 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-01-09 22:39:27,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:27,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219622831] [2025-01-09 22:39:27,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219622831] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:39:27,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:39:27,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:39:27,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038619756] [2025-01-09 22:39:27,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:39:27,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:39:27,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:27,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:39:27,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:39:27,775 INFO L87 Difference]: Start difference. First operand 1289 states and 1759 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:39:29,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:29,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:29,703 INFO L93 Difference]: Finished difference Result 1330 states and 1768 transitions. [2025-01-09 22:39:29,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:39:29,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 73 [2025-01-09 22:39:29,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:29,707 INFO L225 Difference]: With dead ends: 1330 [2025-01-09 22:39:29,708 INFO L226 Difference]: Without dead ends: 1318 [2025-01-09 22:39:29,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:39:29,708 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 95 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:29,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1396 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 22:39:29,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2025-01-09 22:39:29,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1285. [2025-01-09 22:39:29,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 827 states have (on average 1.6783555018137848) internal successors, (1388), 1044 states have internal predecessors, (1388), 183 states have call successors, (183), 79 states have call predecessors, (183), 78 states have return successors, (181), 174 states have call predecessors, (181), 181 states have call successors, (181) [2025-01-09 22:39:29,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1752 transitions. [2025-01-09 22:39:29,725 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1752 transitions. Word has length 73 [2025-01-09 22:39:29,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:29,726 INFO L471 AbstractCegarLoop]: Abstraction has 1285 states and 1752 transitions. [2025-01-09 22:39:29,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:39:29,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1752 transitions. [2025-01-09 22:39:29,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 22:39:29,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:29,727 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:39:29,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:39:29,727 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:29,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:29,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1000086965, now seen corresponding path program 1 times [2025-01-09 22:39:29,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:29,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673901166] [2025-01-09 22:39:29,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:29,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:31,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 22:39:31,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 22:39:31,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:31,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-01-09 22:39:32,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:32,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673901166] [2025-01-09 22:39:32,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673901166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:39:32,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:39:32,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:39:32,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093713663] [2025-01-09 22:39:32,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:39:32,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:39:32,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:32,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:39:32,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:39:32,362 INFO L87 Difference]: Start difference. First operand 1285 states and 1752 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:39:34,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:36,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:37,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:37,135 INFO L93 Difference]: Finished difference Result 1843 states and 2426 transitions. [2025-01-09 22:39:37,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:39:37,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 77 [2025-01-09 22:39:37,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:37,140 INFO L225 Difference]: With dead ends: 1843 [2025-01-09 22:39:37,140 INFO L226 Difference]: Without dead ends: 1843 [2025-01-09 22:39:37,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:39:37,140 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 802 mSDsluCounter, 2502 mSDsCounter, 0 mSdLazyCounter, 1722 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 3195 SdHoareTripleChecker+Invalid, 1730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:37,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 3195 Invalid, 1730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1722 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-01-09 22:39:37,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2025-01-09 22:39:37,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1620. [2025-01-09 22:39:37,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1083 states have (on average 1.7026777469990766) internal successors, (1844), 1311 states have internal predecessors, (1844), 241 states have call successors, (241), 101 states have call predecessors, (241), 100 states have return successors, (239), 225 states have call predecessors, (239), 239 states have call successors, (239) [2025-01-09 22:39:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2324 transitions. [2025-01-09 22:39:37,160 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2324 transitions. Word has length 77 [2025-01-09 22:39:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:37,161 INFO L471 AbstractCegarLoop]: Abstraction has 1620 states and 2324 transitions. [2025-01-09 22:39:37,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:39:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2324 transitions. [2025-01-09 22:39:37,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 22:39:37,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:37,161 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:39:37,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:39:37,162 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:37,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:37,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1000086966, now seen corresponding path program 1 times [2025-01-09 22:39:37,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:37,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13784705] [2025-01-09 22:39:37,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:37,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:38,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 22:39:39,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 22:39:39,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:39,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:39,882 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-01-09 22:39:39,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:39,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13784705] [2025-01-09 22:39:39,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13784705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:39:39,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:39:39,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:39:39,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716151126] [2025-01-09 22:39:39,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:39:39,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:39:39,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:39,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:39:39,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:39:39,883 INFO L87 Difference]: Start difference. First operand 1620 states and 2324 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:39:41,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:43,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:45,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:45,748 INFO L93 Difference]: Finished difference Result 2050 states and 2659 transitions. [2025-01-09 22:39:45,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:39:45,749 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 77 [2025-01-09 22:39:45,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:45,754 INFO L225 Difference]: With dead ends: 2050 [2025-01-09 22:39:45,754 INFO L226 Difference]: Without dead ends: 2050 [2025-01-09 22:39:45,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:39:45,755 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 1037 mSDsluCounter, 2094 mSDsCounter, 0 mSdLazyCounter, 2403 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 2677 SdHoareTripleChecker+Invalid, 2410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:45,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 2677 Invalid, 2410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2403 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-01-09 22:39:45,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2025-01-09 22:39:45,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 1804. [2025-01-09 22:39:45,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1225 states have (on average 1.7118367346938776) internal successors, (2097), 1449 states have internal predecessors, (2097), 268 states have call successors, (268), 116 states have call predecessors, (268), 115 states have return successors, (266), 257 states have call predecessors, (266), 266 states have call successors, (266) [2025-01-09 22:39:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2631 transitions. [2025-01-09 22:39:45,778 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2631 transitions. Word has length 77 [2025-01-09 22:39:45,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:45,779 INFO L471 AbstractCegarLoop]: Abstraction has 1804 states and 2631 transitions. [2025-01-09 22:39:45,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:39:45,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2631 transitions. [2025-01-09 22:39:45,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 22:39:45,779 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:45,780 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:39:45,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:39:45,780 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:45,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:45,780 INFO L85 PathProgramCache]: Analyzing trace with hash -836499705, now seen corresponding path program 1 times [2025-01-09 22:39:45,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:45,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037497071] [2025-01-09 22:39:45,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:45,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:47,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 22:39:47,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 22:39:47,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:47,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-01-09 22:39:47,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:47,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037497071] [2025-01-09 22:39:47,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037497071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:39:47,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:39:47,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:39:47,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287211169] [2025-01-09 22:39:47,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:39:47,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:39:47,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:47,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:39:47,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:39:47,849 INFO L87 Difference]: Start difference. First operand 1804 states and 2631 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:39:48,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:48,228 INFO L93 Difference]: Finished difference Result 1996 states and 2716 transitions. [2025-01-09 22:39:48,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:39:48,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 80 [2025-01-09 22:39:48,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:48,234 INFO L225 Difference]: With dead ends: 1996 [2025-01-09 22:39:48,234 INFO L226 Difference]: Without dead ends: 1996 [2025-01-09 22:39:48,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:39:48,236 INFO L435 NwaCegarLoop]: 1223 mSDtfsCounter, 646 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:48,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 1811 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:39:48,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2025-01-09 22:39:48,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1804. [2025-01-09 22:39:48,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1225 states have (on average 1.7093877551020409) internal successors, (2094), 1449 states have internal predecessors, (2094), 268 states have call successors, (268), 116 states have call predecessors, (268), 115 states have return successors, (266), 257 states have call predecessors, (266), 266 states have call successors, (266) [2025-01-09 22:39:48,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2628 transitions. [2025-01-09 22:39:48,266 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2628 transitions. Word has length 80 [2025-01-09 22:39:48,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:48,266 INFO L471 AbstractCegarLoop]: Abstraction has 1804 states and 2628 transitions. [2025-01-09 22:39:48,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:39:48,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2628 transitions. [2025-01-09 22:39:48,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 22:39:48,267 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:48,267 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:39:48,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:39:48,267 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:48,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:48,267 INFO L85 PathProgramCache]: Analyzing trace with hash -836499704, now seen corresponding path program 1 times [2025-01-09 22:39:48,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:48,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892918623] [2025-01-09 22:39:48,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:48,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:50,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 22:39:50,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 22:39:50,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:50,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:50,425 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-01-09 22:39:50,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:50,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892918623] [2025-01-09 22:39:50,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892918623] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:39:50,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:39:50,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:39:50,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846443945] [2025-01-09 22:39:50,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:39:50,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:39:50,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:50,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:39:50,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:39:50,427 INFO L87 Difference]: Start difference. First operand 1804 states and 2628 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:39:50,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:50,464 INFO L93 Difference]: Finished difference Result 1409 states and 1990 transitions. [2025-01-09 22:39:50,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:39:50,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 80 [2025-01-09 22:39:50,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:50,470 INFO L225 Difference]: With dead ends: 1409 [2025-01-09 22:39:50,470 INFO L226 Difference]: Without dead ends: 1404 [2025-01-09 22:39:50,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:39:50,471 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 0 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3283 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:50,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3283 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:39:50,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2025-01-09 22:39:50,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1404. [2025-01-09 22:39:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 931 states have (on average 1.7185821697099892) internal successors, (1600), 1142 states have internal predecessors, (1600), 192 states have call successors, (192), 85 states have call predecessors, (192), 85 states have return successors, (192), 189 states have call predecessors, (192), 192 states have call successors, (192) [2025-01-09 22:39:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1984 transitions. [2025-01-09 22:39:50,489 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1984 transitions. Word has length 80 [2025-01-09 22:39:50,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:50,491 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 1984 transitions. [2025-01-09 22:39:50,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:39:50,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1984 transitions. [2025-01-09 22:39:50,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 22:39:50,492 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:50,492 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:39:50,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:39:50,492 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:50,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:50,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1723635674, now seen corresponding path program 1 times [2025-01-09 22:39:50,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:50,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444531276] [2025-01-09 22:39:50,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:50,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:52,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 22:39:52,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 22:39:52,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:52,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:53,095 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-01-09 22:39:53,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:53,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444531276] [2025-01-09 22:39:53,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444531276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:39:53,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:39:53,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:39:53,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21311348] [2025-01-09 22:39:53,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:39:53,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:39:53,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:53,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:39:53,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:39:53,098 INFO L87 Difference]: Start difference. First operand 1404 states and 1984 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)