/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:11:36,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:11:36,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:11:36,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:11:36,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:11:36,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:11:36,569 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:11:36,569 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:11:36,569 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:11:36,569 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:11:36,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:11:36,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:11:36,573 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:11:36,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:11:36,574 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:11:36,574 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:11:36,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:11:36,574 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:11:36,574 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:11:36,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:11:36,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:11:36,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:11:36,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:11:36,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:11:36,574 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:11:36,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:11:36,574 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:11:36,575 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:11:36,575 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:11:36,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:11:36,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:11:36,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:11:36,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:11:36,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:11:36,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:11:36,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:11:36,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:11:36,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:11:36,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:11:36,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:11:36,575 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:11:36,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:11:36,576 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:11:36,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:11:36,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:11:36,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:11:36,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:11:36,576 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:11:36,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:11:36,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:11:36,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:11:36,837 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:11:36,839 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:11:36,840 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2025-04-14 00:11:38,235 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddd7be8f8/6b1ac389d6cb46cf8d7689fae158ef3d/FLAG2b9001a99 [2025-04-14 00:11:38,559 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:11:38,559 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2025-04-14 00:11:38,584 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddd7be8f8/6b1ac389d6cb46cf8d7689fae158ef3d/FLAG2b9001a99 [2025-04-14 00:11:39,235 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddd7be8f8/6b1ac389d6cb46cf8d7689fae158ef3d [2025-04-14 00:11:39,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:11:39,239 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:11:39,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:11:39,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:11:39,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:11:39,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:11:39" (1/1) ... [2025-04-14 00:11:39,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e6678f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:39, skipping insertion in model container [2025-04-14 00:11:39,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:11:39" (1/1) ... [2025-04-14 00:11:39,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:11:39,802 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[76469,76482] [2025-04-14 00:11:39,832 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[79042,79055] [2025-04-14 00:11:39,836 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[79451,79464] [2025-04-14 00:11:39,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:11:39,878 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:11:39,961 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[76469,76482] [2025-04-14 00:11:39,979 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[79042,79055] [2025-04-14 00:11:39,983 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[79451,79464] [2025-04-14 00:11:39,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:11:40,066 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:11:40,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:40 WrapperNode [2025-04-14 00:11:40,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:11:40,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:11:40,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:11:40,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:11:40,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:40" (1/1) ... [2025-04-14 00:11:40,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:40" (1/1) ... [2025-04-14 00:11:40,198 INFO L138 Inliner]: procedures = 491, calls = 156, calls flagged for inlining = 45, calls inlined = 117, statements flattened = 1847 [2025-04-14 00:11:40,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:11:40,199 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:11:40,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:11:40,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:11:40,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:40" (1/1) ... [2025-04-14 00:11:40,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:40" (1/1) ... [2025-04-14 00:11:40,229 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:40" (1/1) ... [2025-04-14 00:11:40,292 INFO L175 MemorySlicer]: Split 311 memory accesses to 9 slices as follows [2, 2, 2, 195, 4, 12, 80, 6, 8]. 63 percent of accesses are in the largest equivalence class. The 54 initializations are split as follows [2, 0, 0, 26, 0, 4, 20, 0, 2]. The 95 writes are split as follows [0, 1, 1, 61, 2, 4, 20, 4, 2]. [2025-04-14 00:11:40,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:40" (1/1) ... [2025-04-14 00:11:40,292 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:40" (1/1) ... [2025-04-14 00:11:40,329 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:40" (1/1) ... [2025-04-14 00:11:40,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:40" (1/1) ... [2025-04-14 00:11:40,343 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:40" (1/1) ... [2025-04-14 00:11:40,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:40" (1/1) ... [2025-04-14 00:11:40,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:11:40,368 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:11:40,368 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:11:40,368 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:11:40,369 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:40" (1/1) ... [2025-04-14 00:11:40,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:11:40,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:11:40,398 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 00:11:40,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 00:11:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure Stealer [2025-04-14 00:11:40,417 INFO L138 BoogieDeclarations]: Found implementation of procedure Stealer [2025-04-14 00:11:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:11:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-14 00:11:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:11:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:11:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:11:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-14 00:11:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-14 00:11:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-04-14 00:11:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-04-14 00:11:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-04-14 00:11:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-04-14 00:11:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-04-14 00:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 00:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-14 00:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-14 00:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-14 00:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-04-14 00:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-04-14 00:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-04-14 00:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-04-14 00:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-04-14 00:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-04-14 00:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:11:40,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-14 00:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-14 00:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-14 00:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-14 00:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-04-14 00:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-04-14 00:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:11:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-14 00:11:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-14 00:11:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-04-14 00:11:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-04-14 00:11:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-04-14 00:11:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-04-14 00:11:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-04-14 00:11:40,421 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:11:40,665 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:11:40,667 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:11:40,884 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1935: havoc ~#r~0#1.base, ~#r~0#1.offset; [2025-04-14 00:11:40,885 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1935-1: SUMMARY for call ULTIMATE.dealloc(~#r~0#1.base, ~#r~0#1.offset); srcloc: null [2025-04-14 00:11:40,885 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-14 00:11:40,885 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-1: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-14 00:11:40,885 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-7: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-14 00:11:40,885 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-8: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-14 00:11:40,885 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828: havoc readV_#t~mem39#1; [2025-04-14 00:11:40,885 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-5: havoc readV_#t~mem39#1; [2025-04-14 00:11:42,203 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-14 00:11:42,203 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-1: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-14 00:11:42,203 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-7: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-14 00:11:42,203 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-8: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-14 00:11:42,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-14: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-14 00:11:42,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-15: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-14 00:11:42,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-21: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-14 00:11:42,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-22: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-14 00:11:42,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-28: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-14 00:11:42,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-29: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-14 00:11:42,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-35: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-14 00:11:42,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-36: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-14 00:11:42,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-42: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-14 00:11:42,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-43: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-14 00:11:42,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-49: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-14 00:11:42,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-50: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-14 00:11:42,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-56: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-14 00:11:42,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-57: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-14 00:11:42,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828: havoc readV_#t~mem39#1; [2025-04-14 00:11:42,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-63: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-14 00:11:42,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-64: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-14 00:11:42,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-5: havoc readV_#t~mem39#1; [2025-04-14 00:11:42,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-70: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-14 00:11:42,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-71: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-14 00:11:42,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-10: havoc readV_#t~mem39#1; [2025-04-14 00:11:42,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-15: havoc readV_#t~mem39#1; [2025-04-14 00:11:42,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-77: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-14 00:11:42,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-78: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-14 00:11:42,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-20: havoc readV_#t~mem39#1; [2025-04-14 00:11:42,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-84: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-14 00:11:42,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-85: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-14 00:11:42,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-25: havoc readV_#t~mem39#1; [2025-04-14 00:11:42,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-91: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-14 00:11:42,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-30: havoc readV_#t~mem39#1; [2025-04-14 00:11:42,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-92: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-14 00:11:42,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-35: havoc readV_#t~mem39#1; [2025-04-14 00:11:42,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-98: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-14 00:11:42,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-99: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-14 00:11:42,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-40: havoc readV_#t~mem39#1; [2025-04-14 00:11:42,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-105: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-14 00:11:42,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-106: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-14 00:11:42,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-45: havoc readV_#t~mem39#1; [2025-04-14 00:11:42,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-50: havoc readV_#t~mem39#1; [2025-04-14 00:11:42,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-112: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-14 00:11:42,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-113: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-14 00:11:42,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-55: havoc readV_#t~mem39#1; [2025-04-14 00:11:42,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-119: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-14 00:11:42,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-120: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-14 00:11:42,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-60: havoc readV_#t~mem39#1; [2025-04-14 00:11:42,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-126: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-14 00:11:42,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-65: havoc readV_#t~mem39#1; [2025-04-14 00:11:42,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-127: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-14 00:11:42,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-70: havoc readV_#t~mem39#1; [2025-04-14 00:11:42,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-133: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-14 00:11:42,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-134: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-14 00:11:42,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-75: havoc readV_#t~mem39#1; [2025-04-14 00:11:42,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-80: havoc readV_#t~mem39#1; [2025-04-14 00:11:42,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-85: havoc readV_#t~mem39#1; [2025-04-14 00:11:42,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-90: havoc readV_#t~mem39#1; [2025-04-14 00:11:42,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-95: havoc readV_#t~mem39#1; [2025-04-14 00:11:42,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882: havoc Pop_~temp~2#1; [2025-04-14 00:11:42,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-9: havoc Pop_~temp~2#1; [2025-04-14 00:11:42,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888: havoc Pop_#t~ret61#1; [2025-04-14 00:11:42,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888-9: havoc Pop_#t~ret61#1; [2025-04-14 00:11:42,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1946: havoc main_~#handles~0#1.base, main_~#handles~0#1.offset; [2025-04-14 00:11:42,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1946-1: SUMMARY for call ULTIMATE.dealloc(main_~#handles~0#1.base, main_~#handles~0#1.offset); srcloc: null [2025-04-14 00:11:42,209 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:11:42,210 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:11:42,210 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:11:43,630 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:11:43,679 WARN L179 LargeBlockEncoding]: Complex 2:4 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:11:43,686 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:11:43,687 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:11:43,690 WARN L179 LargeBlockEncoding]: Complex 4:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:11:43,698 WARN L179 LargeBlockEncoding]: Complex 2:4 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:11:43,705 WARN L179 LargeBlockEncoding]: Complex 6:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:11:43,718 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:11:43,722 WARN L179 LargeBlockEncoding]: Complex 7:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:11:43,730 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:11:43,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:11:43 BoogieIcfgContainer [2025-04-14 00:11:43,731 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:11:43,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:11:43,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:11:43,736 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:11:43,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:11:39" (1/3) ... [2025-04-14 00:11:43,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45277ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:11:43, skipping insertion in model container [2025-04-14 00:11:43,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:40" (2/3) ... [2025-04-14 00:11:43,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45277ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:11:43, skipping insertion in model container [2025-04-14 00:11:43,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:11:43" (3/3) ... [2025-04-14 00:11:43,737 INFO L128 eAbstractionObserver]: Analyzing ICFG workstealqueue_mutex-2.i [2025-04-14 00:11:43,749 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:11:43,750 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG workstealqueue_mutex-2.i that has 2 procedures, 163 locations, 233 edges, 1 initial locations, 11 loop locations, and 5 error locations. [2025-04-14 00:11:43,750 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:11:43,860 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-14 00:11:43,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 234 transitions, 475 flow [2025-04-14 00:11:44,052 INFO L116 PetriNetUnfolderBase]: 126/427 cut-off events. [2025-04-14 00:11:44,054 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 00:11:44,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 427 events. 126/427 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1669 event pairs, 0 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 218. Up to 13 conditions per place. [2025-04-14 00:11:44,061 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 234 transitions, 475 flow [2025-04-14 00:11:44,067 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 232 transitions, 471 flow [2025-04-14 00:11:44,076 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:11:44,087 INFO L340 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=LoopHeads, 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;@29d71774, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:11:44,087 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-14 00:11:44,095 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:11:44,095 INFO L116 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-04-14 00:11:44,095 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:11:44,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:44,096 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:44,096 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-14 00:11:44,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:44,100 INFO L85 PathProgramCache]: Analyzing trace with hash 940275696, now seen corresponding path program 1 times [2025-04-14 00:11:44,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:44,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813713199] [2025-04-14 00:11:44,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:44,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:44,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 00:11:44,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 00:11:44,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:44,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:44,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:44,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:44,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813713199] [2025-04-14 00:11:44,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813713199] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:44,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:44,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:11:44,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512506478] [2025-04-14 00:11:44,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:44,445 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 00:11:44,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:44,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 00:11:44,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 00:11:44,467 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 234 [2025-04-14 00:11:44,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 232 transitions, 471 flow. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:44,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:44,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 234 [2025-04-14 00:11:44,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:45,814 INFO L116 PetriNetUnfolderBase]: 3358/5562 cut-off events. [2025-04-14 00:11:45,815 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 00:11:45,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11128 conditions, 5562 events. 3358/5562 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 26107 event pairs, 2040 based on Foata normal form. 0/4163 useless extension candidates. Maximal degree in co-relation 11094. Up to 5561 conditions per place. [2025-04-14 00:11:45,845 INFO L140 encePairwiseOnDemand]: 219/234 looper letters, 215 selfloop transitions, 0 changer transitions 1/217 dead transitions. [2025-04-14 00:11:45,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 217 transitions, 873 flow [2025-04-14 00:11:45,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 00:11:45,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-14 00:11:45,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 233 transitions. [2025-04-14 00:11:45,855 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49786324786324787 [2025-04-14 00:11:45,856 INFO L175 Difference]: Start difference. First operand has 166 places, 232 transitions, 471 flow. Second operand 2 states and 233 transitions. [2025-04-14 00:11:45,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 217 transitions, 873 flow [2025-04-14 00:11:45,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 217 transitions, 873 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:11:45,863 INFO L231 Difference]: Finished difference. Result has 167 places, 216 transitions, 439 flow [2025-04-14 00:11:45,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=439, PETRI_PLACES=167, PETRI_TRANSITIONS=216} [2025-04-14 00:11:45,867 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, 1 predicate places. [2025-04-14 00:11:45,867 INFO L485 AbstractCegarLoop]: Abstraction has has 167 places, 216 transitions, 439 flow [2025-04-14 00:11:45,867 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:45,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:45,867 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:45,867 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:11:45,868 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-14 00:11:45,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:45,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1662063343, now seen corresponding path program 1 times [2025-04-14 00:11:45,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:45,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136256933] [2025-04-14 00:11:45,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:45,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:45,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-14 00:11:45,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-14 00:11:45,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:45,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:46,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:46,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:46,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136256933] [2025-04-14 00:11:46,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136256933] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:46,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:46,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:11:46,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326076072] [2025-04-14 00:11:46,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:46,023 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:11:46,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:46,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:11:46,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:11:46,024 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 234 [2025-04-14 00:11:46,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 216 transitions, 439 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:46,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:46,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 234 [2025-04-14 00:11:46,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:46,118 INFO L116 PetriNetUnfolderBase]: 24/79 cut-off events. [2025-04-14 00:11:46,118 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:11:46,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 79 events. 24/79 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 169 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 144. Up to 42 conditions per place. [2025-04-14 00:11:46,119 INFO L140 encePairwiseOnDemand]: 229/234 looper letters, 44 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2025-04-14 00:11:46,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 49 transitions, 198 flow [2025-04-14 00:11:46,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:11:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:11:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-04-14 00:11:46,120 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.0754985754985755 [2025-04-14 00:11:46,120 INFO L175 Difference]: Start difference. First operand has 167 places, 216 transitions, 439 flow. Second operand 3 states and 53 transitions. [2025-04-14 00:11:46,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 49 transitions, 198 flow [2025-04-14 00:11:46,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 49 transitions, 198 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:11:46,123 INFO L231 Difference]: Finished difference. Result has 31 places, 30 transitions, 78 flow [2025-04-14 00:11:46,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=31, PETRI_TRANSITIONS=30} [2025-04-14 00:11:46,123 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, -135 predicate places. [2025-04-14 00:11:46,123 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 30 transitions, 78 flow [2025-04-14 00:11:46,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:46,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:46,124 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:46,124 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:11:46,124 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-14 00:11:46,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:46,124 INFO L85 PathProgramCache]: Analyzing trace with hash -17343722, now seen corresponding path program 1 times [2025-04-14 00:11:46,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:46,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780416312] [2025-04-14 00:11:46,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:46,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:46,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 00:11:46,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 00:11:46,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:46,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:46,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:46,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:46,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780416312] [2025-04-14 00:11:46,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780416312] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:11:46,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698330862] [2025-04-14 00:11:46,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:46,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:11:46,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:11:46,306 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:11:46,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 00:11:46,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 00:11:46,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 00:11:46,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:46,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:46,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 00:11:46,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:11:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:46,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:11:46,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:46,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698330862] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:11:46,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:11:46,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-14 00:11:46,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505000722] [2025-04-14 00:11:46,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:11:46,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:11:46,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:46,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:11:46,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:11:46,531 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 234 [2025-04-14 00:11:46,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 78 flow. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:46,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:46,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 234 [2025-04-14 00:11:46,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:46,699 INFO L116 PetriNetUnfolderBase]: 24/82 cut-off events. [2025-04-14 00:11:46,699 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-14 00:11:46,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 82 events. 24/82 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 166 event pairs, 0 based on Foata normal form. 3/77 useless extension candidates. Maximal degree in co-relation 190. Up to 36 conditions per place. [2025-04-14 00:11:46,700 INFO L140 encePairwiseOnDemand]: 230/234 looper letters, 44 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2025-04-14 00:11:46,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 52 transitions, 230 flow [2025-04-14 00:11:46,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:11:46,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:11:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2025-04-14 00:11:46,703 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.042735042735042736 [2025-04-14 00:11:46,703 INFO L175 Difference]: Start difference. First operand has 31 places, 30 transitions, 78 flow. Second operand 6 states and 60 transitions. [2025-04-14 00:11:46,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 52 transitions, 230 flow [2025-04-14 00:11:46,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 52 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:11:46,704 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 102 flow [2025-04-14 00:11:46,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=102, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2025-04-14 00:11:46,707 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, -131 predicate places. [2025-04-14 00:11:46,707 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 102 flow [2025-04-14 00:11:46,707 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:46,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:46,707 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:46,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 00:11:46,907 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:11:46,908 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-14 00:11:46,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:46,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1316316335, now seen corresponding path program 2 times [2025-04-14 00:11:46,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:46,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696901780] [2025-04-14 00:11:46,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:11:46,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:46,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-14 00:11:47,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 00:11:47,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:11:47,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:11:47,006 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:11:47,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-14 00:11:47,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 00:11:47,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:47,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:11:47,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:11:47,066 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:11:47,066 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-14 00:11:47,067 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-14 00:11:47,068 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-14 00:11:47,068 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-14 00:11:47,068 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-14 00:11:47,068 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-14 00:11:47,068 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:11:47,069 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-14 00:11:47,070 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 00:11:47,070 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-14 00:11:47,176 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 00:11:47,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 256 transitions, 528 flow [2025-04-14 00:11:47,260 INFO L116 PetriNetUnfolderBase]: 194/656 cut-off events. [2025-04-14 00:11:47,261 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-14 00:11:47,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 656 events. 194/656 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3142 event pairs, 0 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 429. Up to 22 conditions per place. [2025-04-14 00:11:47,264 INFO L82 GeneralOperation]: Start removeDead. Operand has 184 places, 256 transitions, 528 flow [2025-04-14 00:11:47,270 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 255 transitions, 526 flow [2025-04-14 00:11:47,271 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:11:47,271 INFO L340 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=LoopHeads, 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;@29d71774, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:11:47,271 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-14 00:11:47,278 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:11:47,278 INFO L116 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-04-14 00:11:47,278 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:11:47,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:47,279 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:47,279 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-14 00:11:47,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:47,279 INFO L85 PathProgramCache]: Analyzing trace with hash -508618512, now seen corresponding path program 1 times [2025-04-14 00:11:47,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:47,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712323661] [2025-04-14 00:11:47,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:47,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:47,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 00:11:47,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 00:11:47,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:47,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:47,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:47,386 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712323661] [2025-04-14 00:11:47,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712323661] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:47,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:47,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:11:47,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945978109] [2025-04-14 00:11:47,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:47,387 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 00:11:47,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:47,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 00:11:47,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 00:11:47,391 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-14 00:11:47,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 255 transitions, 526 flow. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:47,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:47,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-14 00:11:47,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:12:02,624 INFO L116 PetriNetUnfolderBase]: 98922/136344 cut-off events. [2025-04-14 00:12:02,624 INFO L117 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-04-14 00:12:02,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272773 conditions, 136344 events. 98922/136344 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 784228 event pairs, 67695 based on Foata normal form. 0/103708 useless extension candidates. Maximal degree in co-relation 230242. Up to 136342 conditions per place. [2025-04-14 00:12:03,197 INFO L140 encePairwiseOnDemand]: 240/256 looper letters, 237 selfloop transitions, 0 changer transitions 1/239 dead transitions. [2025-04-14 00:12:03,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 239 transitions, 970 flow [2025-04-14 00:12:03,198 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 00:12:03,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-14 00:12:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 256 transitions. [2025-04-14 00:12:03,199 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 00:12:03,199 INFO L175 Difference]: Start difference. First operand has 184 places, 255 transitions, 526 flow. Second operand 2 states and 256 transitions. [2025-04-14 00:12:03,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 239 transitions, 970 flow [2025-04-14 00:12:03,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 239 transitions, 970 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:12:03,203 INFO L231 Difference]: Finished difference. Result has 185 places, 238 transitions, 492 flow [2025-04-14 00:12:03,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=492, PETRI_PLACES=185, PETRI_TRANSITIONS=238} [2025-04-14 00:12:03,208 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 1 predicate places. [2025-04-14 00:12:03,209 INFO L485 AbstractCegarLoop]: Abstraction has has 185 places, 238 transitions, 492 flow [2025-04-14 00:12:03,209 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:12:03,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:12:03,209 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:12:03,209 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:12:03,209 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-14 00:12:03,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:12:03,209 INFO L85 PathProgramCache]: Analyzing trace with hash -510135995, now seen corresponding path program 1 times [2025-04-14 00:12:03,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:12:03,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636647497] [2025-04-14 00:12:03,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:12:03,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:12:03,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 00:12:03,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 00:12:03,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:12:03,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:12:03,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:12:03,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:12:03,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636647497] [2025-04-14 00:12:03,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636647497] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:12:03,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:12:03,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:12:03,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787506600] [2025-04-14 00:12:03,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:12:03,311 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:12:03,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:12:03,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:12:03,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:12:03,312 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-14 00:12:03,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 238 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:12:03,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:12:03,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-14 00:12:03,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:12:29,387 INFO L116 PetriNetUnfolderBase]: 188182/257683 cut-off events. [2025-04-14 00:12:29,387 INFO L117 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-04-14 00:12:29,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515439 conditions, 257683 events. 188182/257683 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 1288. Compared 1506968 event pairs, 64830 based on Foata normal form. 0/197111 useless extension candidates. Maximal degree in co-relation 515434. Up to 129670 conditions per place. [2025-04-14 00:12:30,282 INFO L140 encePairwiseOnDemand]: 240/256 looper letters, 443 selfloop transitions, 16 changer transitions 1/461 dead transitions. [2025-04-14 00:12:30,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 461 transitions, 1864 flow [2025-04-14 00:12:30,282 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:12:30,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:12:30,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2025-04-14 00:12:30,283 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6119791666666666 [2025-04-14 00:12:30,284 INFO L175 Difference]: Start difference. First operand has 185 places, 238 transitions, 492 flow. Second operand 3 states and 470 transitions. [2025-04-14 00:12:30,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 461 transitions, 1864 flow [2025-04-14 00:12:30,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 461 transitions, 1864 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:12:30,291 INFO L231 Difference]: Finished difference. Result has 187 places, 245 transitions, 568 flow [2025-04-14 00:12:30,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=187, PETRI_TRANSITIONS=245} [2025-04-14 00:12:30,292 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 3 predicate places. [2025-04-14 00:12:30,292 INFO L485 AbstractCegarLoop]: Abstraction has has 187 places, 245 transitions, 568 flow [2025-04-14 00:12:30,292 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:12:30,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:12:30,292 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:12:30,292 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:12:30,292 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-14 00:12:30,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:12:30,295 INFO L85 PathProgramCache]: Analyzing trace with hash -827184468, now seen corresponding path program 1 times [2025-04-14 00:12:30,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:12:30,295 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962455974] [2025-04-14 00:12:30,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:12:30,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:12:30,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:12:30,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:12:30,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:12:30,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:12:30,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:12:30,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:12:30,379 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962455974] [2025-04-14 00:12:30,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962455974] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:12:30,379 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337343459] [2025-04-14 00:12:30,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:12:30,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:12:30,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:12:30,381 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:12:30,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 00:12:30,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:12:30,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:12:30,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:12:30,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:12:30,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 00:12:30,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:12:30,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:12:30,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:12:30,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:12:30,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337343459] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:12:30,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:12:30,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-14 00:12:30,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896177094] [2025-04-14 00:12:30,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:12:30,576 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:12:30,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:12:30,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:12:30,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:12:30,576 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-14 00:12:30,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 245 transitions, 568 flow. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:12:30,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:12:30,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-14 00:12:30,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:12:56,657 INFO L116 PetriNetUnfolderBase]: 188183/257691 cut-off events. [2025-04-14 00:12:56,657 INFO L117 PetriNetUnfolderBase]: For 2083/2083 co-relation queries the response was YES. [2025-04-14 00:12:56,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520176 conditions, 257691 events. 188183/257691 cut-off events. For 2083/2083 co-relation queries the response was YES. Maximal size of possible extension queue 1288. Compared 1506079 event pairs, 64830 based on Foata normal form. 3/198406 useless extension candidates. Maximal degree in co-relation 520169. Up to 129662 conditions per place. [2025-04-14 00:12:57,551 INFO L140 encePairwiseOnDemand]: 239/256 looper letters, 445 selfloop transitions, 23 changer transitions 0/469 dead transitions. [2025-04-14 00:12:57,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 469 transitions, 1970 flow [2025-04-14 00:12:57,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:12:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:12:57,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 477 transitions. [2025-04-14 00:12:57,553 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.310546875 [2025-04-14 00:12:57,553 INFO L175 Difference]: Start difference. First operand has 187 places, 245 transitions, 568 flow. Second operand 6 states and 477 transitions. [2025-04-14 00:12:57,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 469 transitions, 1970 flow [2025-04-14 00:12:57,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 469 transitions, 1954 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:12:57,562 INFO L231 Difference]: Finished difference. Result has 192 places, 252 transitions, 635 flow [2025-04-14 00:12:57,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=635, PETRI_PLACES=192, PETRI_TRANSITIONS=252} [2025-04-14 00:12:57,563 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 8 predicate places. [2025-04-14 00:12:57,563 INFO L485 AbstractCegarLoop]: Abstraction has has 192 places, 252 transitions, 635 flow [2025-04-14 00:12:57,563 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:12:57,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:12:57,564 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:12:57,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 00:12:57,768 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-04-14 00:12:57,768 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-14 00:12:57,768 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:12:57,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1930334981, now seen corresponding path program 2 times [2025-04-14 00:12:57,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:12:57,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33729924] [2025-04-14 00:12:57,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:12:57,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:12:57,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:12:57,797 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 15 statements. [2025-04-14 00:12:57,797 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:12:57,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:12:57,862 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:12:57,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:12:57,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33729924] [2025-04-14 00:12:57,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33729924] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:12:57,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:12:57,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:12:57,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061551612] [2025-04-14 00:12:57,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:12:57,863 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:12:57,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:12:57,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:12:57,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:12:57,864 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-14 00:12:57,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 252 transitions, 635 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:12:57,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:12:57,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-14 00:12:57,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:25,296 INFO L116 PetriNetUnfolderBase]: 186551/255787 cut-off events. [2025-04-14 00:13:25,297 INFO L117 PetriNetUnfolderBase]: For 3154/3154 co-relation queries the response was YES. [2025-04-14 00:13:25,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516403 conditions, 255787 events. 186551/255787 cut-off events. For 3154/3154 co-relation queries the response was YES. Maximal size of possible extension queue 1306. Compared 1501462 event pairs, 64590 based on Foata normal form. 1280/197906 useless extension candidates. Maximal degree in co-relation 516396. Up to 127998 conditions per place. [2025-04-14 00:13:26,240 INFO L140 encePairwiseOnDemand]: 240/256 looper letters, 445 selfloop transitions, 16 changer transitions 0/461 dead transitions. [2025-04-14 00:13:26,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 461 transitions, 1971 flow [2025-04-14 00:13:26,241 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:13:26,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:13:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 463 transitions. [2025-04-14 00:13:26,242 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4521484375 [2025-04-14 00:13:26,242 INFO L175 Difference]: Start difference. First operand has 192 places, 252 transitions, 635 flow. Second operand 4 states and 463 transitions. [2025-04-14 00:13:26,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 461 transitions, 1971 flow [2025-04-14 00:13:26,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 461 transitions, 1917 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-04-14 00:13:26,257 INFO L231 Difference]: Finished difference. Result has 190 places, 246 transitions, 591 flow [2025-04-14 00:13:26,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=591, PETRI_PLACES=190, PETRI_TRANSITIONS=246} [2025-04-14 00:13:26,258 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 6 predicate places. [2025-04-14 00:13:26,258 INFO L485 AbstractCegarLoop]: Abstraction has has 190 places, 246 transitions, 591 flow [2025-04-14 00:13:26,258 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:13:26,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:26,258 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 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-04-14 00:13:26,258 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:13:26,258 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-14 00:13:26,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:26,259 INFO L85 PathProgramCache]: Analyzing trace with hash 324247217, now seen corresponding path program 1 times [2025-04-14 00:13:26,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:26,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075621403] [2025-04-14 00:13:26,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:26,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:26,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:13:26,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:13:26,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:26,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:29,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:13:29,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:29,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075621403] [2025-04-14 00:13:29,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075621403] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:29,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:29,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-14 00:13:29,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799103588] [2025-04-14 00:13:29,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:29,610 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 00:13:29,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:29,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 00:13:29,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-04-14 00:13:29,611 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-14 00:13:29,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 246 transitions, 591 flow. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:13:29,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:29,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-14 00:13:29,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:59,338 INFO L116 PetriNetUnfolderBase]: 189584/260122 cut-off events. [2025-04-14 00:13:59,338 INFO L117 PetriNetUnfolderBase]: For 2978/2978 co-relation queries the response was YES. [2025-04-14 00:13:59,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525073 conditions, 260122 events. 189584/260122 cut-off events. For 2978/2978 co-relation queries the response was YES. Maximal size of possible extension queue 1341. Compared 1532277 event pairs, 95707 based on Foata normal form. 0/200400 useless extension candidates. Maximal degree in co-relation 525067. Up to 255323 conditions per place. [2025-04-14 00:14:00,425 INFO L140 encePairwiseOnDemand]: 219/256 looper letters, 321 selfloop transitions, 46 changer transitions 0/367 dead transitions. [2025-04-14 00:14:00,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 367 transitions, 1578 flow [2025-04-14 00:14:00,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 00:14:00,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 00:14:00,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 377 transitions. [2025-04-14 00:14:00,428 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.11328125 [2025-04-14 00:14:00,428 INFO L175 Difference]: Start difference. First operand has 190 places, 246 transitions, 591 flow. Second operand 13 states and 377 transitions. [2025-04-14 00:14:00,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 367 transitions, 1578 flow [2025-04-14 00:14:00,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 367 transitions, 1559 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:14:00,444 INFO L231 Difference]: Finished difference. Result has 208 places, 284 transitions, 859 flow [2025-04-14 00:14:00,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=859, PETRI_PLACES=208, PETRI_TRANSITIONS=284} [2025-04-14 00:14:00,448 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 24 predicate places. [2025-04-14 00:14:00,448 INFO L485 AbstractCegarLoop]: Abstraction has has 208 places, 284 transitions, 859 flow [2025-04-14 00:14:00,448 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:14:00,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:14:00,449 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 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-04-14 00:14:00,449 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:14:00,449 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-14 00:14:00,450 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:14:00,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1430768537, now seen corresponding path program 1 times [2025-04-14 00:14:00,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:14:00,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437306685] [2025-04-14 00:14:00,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:14:00,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:14:00,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-14 00:14:00,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:14:00,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:14:00,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:14:00,851 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:14:00,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:14:00,851 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437306685] [2025-04-14 00:14:00,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437306685] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:14:00,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:14:00,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:14:00,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587659550] [2025-04-14 00:14:00,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:14:00,852 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:14:00,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:14:00,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:14:00,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:14:00,852 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-14 00:14:00,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 284 transitions, 859 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:14:00,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:14:00,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-14 00:14:00,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:14:07,596 INFO L116 PetriNetUnfolderBase]: 27596/40790 cut-off events. [2025-04-14 00:14:07,597 INFO L117 PetriNetUnfolderBase]: For 3553/3553 co-relation queries the response was YES. [2025-04-14 00:14:07,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88502 conditions, 40790 events. 27596/40790 cut-off events. For 3553/3553 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 225393 event pairs, 2804 based on Foata normal form. 4452/35006 useless extension candidates. Maximal degree in co-relation 88488. Up to 35985 conditions per place. [2025-04-14 00:14:07,753 INFO L140 encePairwiseOnDemand]: 244/256 looper letters, 328 selfloop transitions, 12 changer transitions 0/340 dead transitions. [2025-04-14 00:14:07,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 340 transitions, 1679 flow [2025-04-14 00:14:07,753 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:14:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:14:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2025-04-14 00:14:07,754 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4088541666666667 [2025-04-14 00:14:07,754 INFO L175 Difference]: Start difference. First operand has 208 places, 284 transitions, 859 flow. Second operand 3 states and 314 transitions. [2025-04-14 00:14:07,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 340 transitions, 1679 flow [2025-04-14 00:14:07,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 340 transitions, 1647 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-04-14 00:14:07,790 INFO L231 Difference]: Finished difference. Result has 205 places, 266 transitions, 763 flow [2025-04-14 00:14:07,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=763, PETRI_PLACES=205, PETRI_TRANSITIONS=266} [2025-04-14 00:14:07,791 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 21 predicate places. [2025-04-14 00:14:07,791 INFO L485 AbstractCegarLoop]: Abstraction has has 205 places, 266 transitions, 763 flow [2025-04-14 00:14:07,791 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:14:07,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:14:07,791 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-14 00:14:07,791 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:14:07,791 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-14 00:14:07,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:14:07,792 INFO L85 PathProgramCache]: Analyzing trace with hash -496866533, now seen corresponding path program 1 times [2025-04-14 00:14:07,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:14:07,792 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811905489] [2025-04-14 00:14:07,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:14:07,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:14:07,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 00:14:07,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 00:14:07,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:14:07,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:14:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:14:12,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:14:12,649 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811905489] [2025-04-14 00:14:12,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811905489] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:14:12,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:14:12,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-04-14 00:14:12,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908967306] [2025-04-14 00:14:12,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:14:12,649 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-14 00:14:12,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:14:12,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-14 00:14:12,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2025-04-14 00:14:12,650 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-14 00:14:12,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 266 transitions, 763 flow. Second operand has 22 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:14:12,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:14:12,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-14 00:14:12,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:14:22,898 INFO L116 PetriNetUnfolderBase]: 28536/42160 cut-off events. [2025-04-14 00:14:22,899 INFO L117 PetriNetUnfolderBase]: For 3987/3987 co-relation queries the response was YES. [2025-04-14 00:14:22,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90695 conditions, 42160 events. 28536/42160 cut-off events. For 3987/3987 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 223979 event pairs, 10497 based on Foata normal form. 0/31468 useless extension candidates. Maximal degree in co-relation 90681. Up to 40387 conditions per place. [2025-04-14 00:14:23,063 INFO L140 encePairwiseOnDemand]: 211/256 looper letters, 365 selfloop transitions, 77 changer transitions 0/442 dead transitions. [2025-04-14 00:14:23,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 442 transitions, 2107 flow [2025-04-14 00:14:23,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 00:14:23,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 00:14:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 448 transitions. [2025-04-14 00:14:23,066 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.07291666666666667 [2025-04-14 00:14:23,066 INFO L175 Difference]: Start difference. First operand has 205 places, 266 transitions, 763 flow. Second operand 24 states and 448 transitions. [2025-04-14 00:14:23,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 442 transitions, 2107 flow [2025-04-14 00:14:23,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 442 transitions, 2070 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:14:23,081 INFO L231 Difference]: Finished difference. Result has 240 places, 321 transitions, 1254 flow [2025-04-14 00:14:23,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1254, PETRI_PLACES=240, PETRI_TRANSITIONS=321} [2025-04-14 00:14:23,082 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 56 predicate places. [2025-04-14 00:14:23,082 INFO L485 AbstractCegarLoop]: Abstraction has has 240 places, 321 transitions, 1254 flow [2025-04-14 00:14:23,082 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:14:23,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:14:23,082 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-14 00:14:23,082 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 00:14:23,082 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-14 00:14:23,083 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:14:23,083 INFO L85 PathProgramCache]: Analyzing trace with hash -439608231, now seen corresponding path program 1 times [2025-04-14 00:14:23,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:14:23,083 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381271495] [2025-04-14 00:14:23,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:14:23,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:14:23,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 00:14:23,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 00:14:23,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:14:23,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:14:25,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:14:25,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:14:25,678 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381271495] [2025-04-14 00:14:25,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381271495] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:14:25,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:14:25,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-04-14 00:14:25,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188115757] [2025-04-14 00:14:25,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:14:25,679 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 00:14:25,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:14:25,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 00:14:25,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:14:25,680 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-14 00:14:25,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 321 transitions, 1254 flow. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:14:25,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:14:25,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-14 00:14:25,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:14:38,123 INFO L116 PetriNetUnfolderBase]: 36345/53256 cut-off events. [2025-04-14 00:14:38,123 INFO L117 PetriNetUnfolderBase]: For 8632/8632 co-relation queries the response was YES. [2025-04-14 00:14:38,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119564 conditions, 53256 events. 36345/53256 cut-off events. For 8632/8632 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 282703 event pairs, 8772 based on Foata normal form. 40/39425 useless extension candidates. Maximal degree in co-relation 119537. Up to 35575 conditions per place. [2025-04-14 00:14:38,565 INFO L140 encePairwiseOnDemand]: 156/256 looper letters, 496 selfloop transitions, 219 changer transitions 0/715 dead transitions. [2025-04-14 00:14:38,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 715 transitions, 3803 flow [2025-04-14 00:14:38,566 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-14 00:14:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-14 00:14:38,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 659 transitions. [2025-04-14 00:14:38,569 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.09193638392857142 [2025-04-14 00:14:38,569 INFO L175 Difference]: Start difference. First operand has 240 places, 321 transitions, 1254 flow. Second operand 28 states and 659 transitions. [2025-04-14 00:14:38,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 715 transitions, 3803 flow [2025-04-14 00:14:38,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 715 transitions, 3711 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-04-14 00:14:38,606 INFO L231 Difference]: Finished difference. Result has 272 places, 417 transitions, 2258 flow [2025-04-14 00:14:38,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=2258, PETRI_PLACES=272, PETRI_TRANSITIONS=417} [2025-04-14 00:14:38,608 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 88 predicate places. [2025-04-14 00:14:38,608 INFO L485 AbstractCegarLoop]: Abstraction has has 272 places, 417 transitions, 2258 flow [2025-04-14 00:14:38,608 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:14:38,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:14:38,608 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-14 00:14:38,608 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 00:14:38,608 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-14 00:14:38,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:14:38,609 INFO L85 PathProgramCache]: Analyzing trace with hash 943191822, now seen corresponding path program 1 times [2025-04-14 00:14:38,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:14:38,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114263104] [2025-04-14 00:14:38,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:14:38,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:14:38,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 00:14:38,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:14:38,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:14:38,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:14:41,034 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:14:41,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:14:41,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114263104] [2025-04-14 00:14:41,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114263104] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:14:41,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:14:41,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-14 00:14:41,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486773777] [2025-04-14 00:14:41,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:14:41,035 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 00:14:41,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:14:41,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 00:14:41,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-14 00:14:41,036 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-14 00:14:41,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 417 transitions, 2258 flow. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:14:41,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:14:41,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-14 00:14:41,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:14:53,213 INFO L116 PetriNetUnfolderBase]: 38164/56029 cut-off events. [2025-04-14 00:14:53,213 INFO L117 PetriNetUnfolderBase]: For 27480/27480 co-relation queries the response was YES. [2025-04-14 00:14:53,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151461 conditions, 56029 events. 38164/56029 cut-off events. For 27480/27480 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 301938 event pairs, 11613 based on Foata normal form. 0/42474 useless extension candidates. Maximal degree in co-relation 151423. Up to 52949 conditions per place. [2025-04-14 00:14:53,702 INFO L140 encePairwiseOnDemand]: 220/256 looper letters, 547 selfloop transitions, 114 changer transitions 0/661 dead transitions. [2025-04-14 00:14:53,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 661 transitions, 5054 flow [2025-04-14 00:14:53,702 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 00:14:53,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 00:14:53,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 408 transitions. [2025-04-14 00:14:53,704 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.10625 [2025-04-14 00:14:53,704 INFO L175 Difference]: Start difference. First operand has 272 places, 417 transitions, 2258 flow. Second operand 15 states and 408 transitions. [2025-04-14 00:14:53,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 661 transitions, 5054 flow [2025-04-14 00:14:54,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 661 transitions, 4810 flow, removed 109 selfloop flow, removed 4 redundant places. [2025-04-14 00:14:54,071 INFO L231 Difference]: Finished difference. Result has 289 places, 516 transitions, 3253 flow [2025-04-14 00:14:54,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=2132, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3253, PETRI_PLACES=289, PETRI_TRANSITIONS=516} [2025-04-14 00:14:54,072 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 105 predicate places. [2025-04-14 00:14:54,072 INFO L485 AbstractCegarLoop]: Abstraction has has 289 places, 516 transitions, 3253 flow [2025-04-14 00:14:54,072 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:14:54,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:14:54,073 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-14 00:14:54,073 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 00:14:54,073 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-14 00:14:54,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:14:54,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1570541878, now seen corresponding path program 1 times [2025-04-14 00:14:54,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:14:54,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920106923] [2025-04-14 00:14:54,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:14:54,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:14:54,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 00:14:54,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:14:54,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:14:54,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:14:57,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:14:57,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:14:57,851 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920106923] [2025-04-14 00:14:57,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920106923] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:14:57,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:14:57,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-04-14 00:14:57,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337357850] [2025-04-14 00:14:57,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:14:57,851 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-14 00:14:57,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:14:57,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-14 00:14:57,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2025-04-14 00:14:57,852 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-14 00:14:57,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 516 transitions, 3253 flow. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:14:57,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:14:57,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-14 00:14:57,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:15:15,848 INFO L116 PetriNetUnfolderBase]: 45445/66987 cut-off events. [2025-04-14 00:15:15,848 INFO L117 PetriNetUnfolderBase]: For 41354/41354 co-relation queries the response was YES. [2025-04-14 00:15:16,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193739 conditions, 66987 events. 45445/66987 cut-off events. For 41354/41354 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 376317 event pairs, 9160 based on Foata normal form. 78/51589 useless extension candidates. Maximal degree in co-relation 193693. Up to 49523 conditions per place. [2025-04-14 00:15:16,550 INFO L140 encePairwiseOnDemand]: 142/256 looper letters, 602 selfloop transitions, 335 changer transitions 0/937 dead transitions. [2025-04-14 00:15:16,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 937 transitions, 6871 flow [2025-04-14 00:15:16,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-14 00:15:16,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-04-14 00:15:16,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 634 transitions. [2025-04-14 00:15:16,553 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.08539870689655173 [2025-04-14 00:15:16,553 INFO L175 Difference]: Start difference. First operand has 289 places, 516 transitions, 3253 flow. Second operand 29 states and 634 transitions. [2025-04-14 00:15:16,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 937 transitions, 6871 flow [2025-04-14 00:15:16,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 937 transitions, 6849 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-04-14 00:15:16,757 INFO L231 Difference]: Finished difference. Result has 324 places, 664 transitions, 5338 flow [2025-04-14 00:15:16,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=3233, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=204, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=5338, PETRI_PLACES=324, PETRI_TRANSITIONS=664} [2025-04-14 00:15:16,758 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 140 predicate places. [2025-04-14 00:15:16,758 INFO L485 AbstractCegarLoop]: Abstraction has has 324 places, 664 transitions, 5338 flow [2025-04-14 00:15:16,758 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:15:16,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:15:16,758 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-14 00:15:16,758 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 00:15:16,758 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-14 00:15:16,759 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:15:16,759 INFO L85 PathProgramCache]: Analyzing trace with hash 170992698, now seen corresponding path program 1 times [2025-04-14 00:15:16,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:15:16,759 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480392919] [2025-04-14 00:15:16,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:15:16,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:15:16,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 00:15:16,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:15:16,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:15:16,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:15:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:15:18,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:15:18,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480392919] [2025-04-14 00:15:18,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480392919] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:15:18,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:15:18,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-14 00:15:18,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394578923] [2025-04-14 00:15:18,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:15:18,317 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 00:15:18,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:15:18,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 00:15:18,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-14 00:15:18,317 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-14 00:15:18,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 664 transitions, 5338 flow. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:15:18,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:15:18,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-14 00:15:18,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:15:42,955 INFO L116 PetriNetUnfolderBase]: 63487/91924 cut-off events. [2025-04-14 00:15:42,955 INFO L117 PetriNetUnfolderBase]: For 119882/119882 co-relation queries the response was YES. [2025-04-14 00:15:43,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302757 conditions, 91924 events. 63487/91924 cut-off events. For 119882/119882 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 523524 event pairs, 11442 based on Foata normal form. 42/69957 useless extension candidates. Maximal degree in co-relation 302699. Up to 60535 conditions per place. [2025-04-14 00:15:44,076 INFO L140 encePairwiseOnDemand]: 198/256 looper letters, 1175 selfloop transitions, 367 changer transitions 0/1542 dead transitions. [2025-04-14 00:15:44,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 1542 transitions, 13766 flow [2025-04-14 00:15:44,077 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 00:15:44,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-14 00:15:44,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 919 transitions. [2025-04-14 00:15:44,079 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.11966145833333333 [2025-04-14 00:15:44,079 INFO L175 Difference]: Start difference. First operand has 324 places, 664 transitions, 5338 flow. Second operand 30 states and 919 transitions. [2025-04-14 00:15:44,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 1542 transitions, 13766 flow [2025-04-14 00:15:45,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 1542 transitions, 13404 flow, removed 120 selfloop flow, removed 7 redundant places. [2025-04-14 00:15:45,083 INFO L231 Difference]: Finished difference. Result has 360 places, 830 transitions, 7617 flow [2025-04-14 00:15:45,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=5112, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=7617, PETRI_PLACES=360, PETRI_TRANSITIONS=830} [2025-04-14 00:15:45,084 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 176 predicate places. [2025-04-14 00:15:45,084 INFO L485 AbstractCegarLoop]: Abstraction has has 360 places, 830 transitions, 7617 flow [2025-04-14 00:15:45,084 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:15:45,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:15:45,084 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-14 00:15:45,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 00:15:45,084 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-14 00:15:45,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:15:45,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1271965380, now seen corresponding path program 1 times [2025-04-14 00:15:45,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:15:45,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608455188] [2025-04-14 00:15:45,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:15:45,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:15:45,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 00:15:45,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:15:45,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:15:45,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:15:47,620 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:15:47,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:15:47,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608455188] [2025-04-14 00:15:47,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608455188] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:15:47,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124052680] [2025-04-14 00:15:47,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:15:47,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:15:47,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:15:47,623 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:15:47,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 00:15:47,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 00:15:48,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:15:48,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:15:48,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:15:48,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 198 conjuncts are in the unsatisfiable core [2025-04-14 00:15:48,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:15:48,098 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-14 00:15:48,150 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-14 00:15:48,202 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-14 00:15:48,389 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:15:48,392 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:15:48,395 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-14 00:15:48,635 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:15:48,637 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:15:48,639 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-04-14 00:15:48,736 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-14 00:15:48,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 00:15:48,817 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-14 00:15:48,989 INFO L325 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2025-04-14 00:15:48,989 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 45 [2025-04-14 00:15:49,008 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-14 00:15:49,034 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:15:49,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:15:49,427 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:15:49,427 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 118 [2025-04-14 00:15:49,768 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:15:49,768 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 112 [2025-04-14 00:15:49,778 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 72 [2025-04-14 00:15:49,914 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2025-04-14 00:15:49,948 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:15:49,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124052680] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:15:49,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:15:49,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 14] total 40 [2025-04-14 00:15:49,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746957521] [2025-04-14 00:15:49,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:15:49,949 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-14 00:15:49,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:15:49,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-14 00:15:49,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1464, Unknown=0, NotChecked=0, Total=1640 [2025-04-14 00:15:49,950 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-14 00:15:49,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 830 transitions, 7617 flow. Second operand has 41 states, 41 states have (on average 3.073170731707317) internal successors, (126), 41 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:15:49,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:15:49,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-14 00:15:49,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:16:22,147 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:16:28,542 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:16:32,576 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:16:39,898 INFO L116 PetriNetUnfolderBase]: 67461/98053 cut-off events. [2025-04-14 00:16:39,899 INFO L117 PetriNetUnfolderBase]: For 309341/309341 co-relation queries the response was YES. [2025-04-14 00:16:41,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410493 conditions, 98053 events. 67461/98053 cut-off events. For 309341/309341 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 564538 event pairs, 15964 based on Foata normal form. 442/75970 useless extension candidates. Maximal degree in co-relation 410420. Up to 83073 conditions per place. [2025-04-14 00:16:41,550 INFO L140 encePairwiseOnDemand]: 196/256 looper letters, 1058 selfloop transitions, 424 changer transitions 0/1482 dead transitions. [2025-04-14 00:16:41,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 1482 transitions, 14784 flow [2025-04-14 00:16:41,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-14 00:16:41,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-04-14 00:16:41,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 924 transitions. [2025-04-14 00:16:41,553 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.0721875 [2025-04-14 00:16:41,553 INFO L175 Difference]: Start difference. First operand has 360 places, 830 transitions, 7617 flow. Second operand 50 states and 924 transitions. [2025-04-14 00:16:41,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 1482 transitions, 14784 flow [2025-04-14 00:16:47,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 1482 transitions, 14535 flow, removed 92 selfloop flow, removed 5 redundant places. [2025-04-14 00:16:47,905 INFO L231 Difference]: Finished difference. Result has 418 places, 977 transitions, 10114 flow [2025-04-14 00:16:47,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=7304, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=817, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=303, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=10114, PETRI_PLACES=418, PETRI_TRANSITIONS=977} [2025-04-14 00:16:47,907 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 234 predicate places. [2025-04-14 00:16:47,907 INFO L485 AbstractCegarLoop]: Abstraction has has 418 places, 977 transitions, 10114 flow [2025-04-14 00:16:47,907 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.073170731707317) internal successors, (126), 41 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:16:47,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:16:47,907 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-14 00:16:47,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 00:16:48,108 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:16:48,108 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-14 00:16:48,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:16:48,109 INFO L85 PathProgramCache]: Analyzing trace with hash 166788762, now seen corresponding path program 2 times [2025-04-14 00:16:48,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:16:48,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021519867] [2025-04-14 00:16:48,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:16:48,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:16:48,137 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-14 00:16:48,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:16:48,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:16:48,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:16:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:16:50,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:16:50,511 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021519867] [2025-04-14 00:16:50,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021519867] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:16:50,511 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070177341] [2025-04-14 00:16:50,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:16:50,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:16:50,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:16:50,513 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:16:50,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 00:16:50,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-14 00:17:09,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:17:09,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:17:09,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:17:09,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 203 conjuncts are in the unsatisfiable core [2025-04-14 00:17:09,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:17:09,545 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-14 00:17:09,571 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-14 00:17:09,604 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-14 00:17:09,738 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:17:09,742 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:17:09,744 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-04-14 00:17:09,963 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:17:09,965 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-04-14 00:17:09,971 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:17:10,046 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-14 00:17:10,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 00:17:10,130 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-14 00:17:10,301 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:17:10,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:17:10,355 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_StealerThread1of2ForFork0_Steal_~h~0#1| 1)) (.cse0 (= (select (select |c_#memory_int#3| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base|) |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset|) (select (select |c_#memory_int#8| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.base|) |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.offset|)))) (and (or (not .cse0) (< (select (select |c_#memory_int#8| |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) .cse1)) (or (forall ((v_DerPreprocessor_3 (Array Int Int))) (< (select (select (store |c_#memory_int#8| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.base| v_DerPreprocessor_3) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) .cse1)) .cse0))) is different from false [2025-04-14 00:17:10,365 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-14 00:17:11,305 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:17:11,305 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 335 treesize of output 538 [2025-04-14 00:17:11,336 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 302 treesize of output 300 [2025-04-14 00:17:11,366 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:17:11,367 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 300 treesize of output 305 [2025-04-14 00:17:11,382 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 294 [2025-04-14 00:17:11,405 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:17:11,405 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 294 treesize of output 299 [2025-04-14 00:17:14,408 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:17:14,409 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 93 [2025-04-14 00:17:14,413 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2025-04-14 00:17:14,513 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2025-04-14 00:17:14,554 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:17:14,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070177341] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:17:14,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:17:14,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 40 [2025-04-14 00:17:14,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128814786] [2025-04-14 00:17:14,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:17:14,554 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-14 00:17:14,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:17:14,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-14 00:17:14,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1380, Unknown=4, NotChecked=76, Total=1640 [2025-04-14 00:17:14,555 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-14 00:17:14,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 977 transitions, 10114 flow. Second operand has 41 states, 41 states have (on average 2.8780487804878048) internal successors, (118), 41 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:17:14,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:17:14,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-14 00:17:14,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:17:58,940 INFO L116 PetriNetUnfolderBase]: 69847/101705 cut-off events. [2025-04-14 00:17:58,940 INFO L117 PetriNetUnfolderBase]: For 472631/472631 co-relation queries the response was YES. [2025-04-14 00:18:00,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477700 conditions, 101705 events. 69847/101705 cut-off events. For 472631/472631 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 590975 event pairs, 17601 based on Foata normal form. 256/79637 useless extension candidates. Maximal degree in co-relation 477614. Up to 93410 conditions per place. [2025-04-14 00:18:00,761 INFO L140 encePairwiseOnDemand]: 203/256 looper letters, 1059 selfloop transitions, 289 changer transitions 0/1348 dead transitions. [2025-04-14 00:18:00,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 1348 transitions, 15446 flow [2025-04-14 00:18:00,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 00:18:00,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-04-14 00:18:00,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 638 transitions. [2025-04-14 00:18:00,764 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.06735641891891891 [2025-04-14 00:18:00,764 INFO L175 Difference]: Start difference. First operand has 418 places, 977 transitions, 10114 flow. Second operand 37 states and 638 transitions. [2025-04-14 00:18:00,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 1348 transitions, 15446 flow [2025-04-14 00:18:16,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 1348 transitions, 14495 flow, removed 332 selfloop flow, removed 17 redundant places. [2025-04-14 00:18:16,063 INFO L231 Difference]: Finished difference. Result has 450 places, 1059 transitions, 10963 flow [2025-04-14 00:18:16,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=9307, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=977, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=10963, PETRI_PLACES=450, PETRI_TRANSITIONS=1059} [2025-04-14 00:18:16,064 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 266 predicate places. [2025-04-14 00:18:16,065 INFO L485 AbstractCegarLoop]: Abstraction has has 450 places, 1059 transitions, 10963 flow [2025-04-14 00:18:16,065 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.8780487804878048) internal successors, (118), 41 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:18:16,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:18:16,065 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-14 00:18:16,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 00:18:16,266 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-14 00:18:16,266 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-14 00:18:16,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:18:16,267 INFO L85 PathProgramCache]: Analyzing trace with hash 247713084, now seen corresponding path program 3 times [2025-04-14 00:18:16,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:18:16,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019600739] [2025-04-14 00:18:16,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:18:16,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:18:16,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-14 00:18:16,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 38 of 40 statements. [2025-04-14 00:18:16,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:18:16,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:18:18,342 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:18:18,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:18:18,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019600739] [2025-04-14 00:18:18,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019600739] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:18:18,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585197468] [2025-04-14 00:18:18,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:18:18,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:18:18,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:18:18,344 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:18:18,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 00:18:18,592 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-14 00:18:25,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 38 of 40 statements. [2025-04-14 00:18:25,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:18:25,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:18:25,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 218 conjuncts are in the unsatisfiable core [2025-04-14 00:18:25,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:18:25,073 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-14 00:18:25,101 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-14 00:18:25,134 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-14 00:18:25,282 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:18:25,285 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-04-14 00:18:25,292 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:18:25,508 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-14 00:18:25,647 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-14 00:18:25,886 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:18:25,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:18:25,980 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-14 00:18:26,519 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int#3| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base|))) (let ((.cse11 (= (select .cse12 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset|) (select (select |c_#memory_int#8| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.base|) |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.offset|))) (.cse0 (select (select |c_#memory_int#6| |c_ULTIMATE.start_atomic_compare_exchange_strong_~expected#1.base|) |c_ULTIMATE.start_atomic_compare_exchange_strong_~expected#1.offset|)) (.cse5 (+ 32 |c_~#q~0.offset|)) (.cse2 (+ |c_~#q~0.offset| 36))) (and (or (let ((.cse4 (select |c_#memory_int#3| |c_~#q~0.base|))) (let ((.cse6 (= (select .cse4 .cse2) 0))) (and (forall ((v_DerPreprocessor_10 (Array Int Int))) (let ((.cse3 (store |c_#memory_int#8| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.base| v_DerPreprocessor_10))) (let ((.cse1 (store |c_#memory_int#3| |c_~#q~0.base| (store .cse4 .cse5 (+ (select (select .cse3 |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 1))))) (or (not (= .cse0 (select (select .cse1 |c_ULTIMATE.start_atomic_compare_exchange_strong_~obj#1.base|) |c_ULTIMATE.start_atomic_compare_exchange_strong_~obj#1.offset|))) (forall ((v_DerPreprocessor_8 (Array Int Int))) (= (select (select (store .cse1 |c_ULTIMATE.start_atomic_compare_exchange_strong_~obj#1.base| v_DerPreprocessor_8) |c_~#q~0.base|) .cse2) 0)) (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_30| Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_30| Int)) (not (= (select (select .cse3 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_30|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_30|) 0))))))) (or (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_prenex_78 Int) (v_prenex_79 Int)) (not (= (select (select (store |c_#memory_int#8| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.base| v_DerPreprocessor_10) v_prenex_78) v_prenex_79) 0))) .cse6) (forall ((v_DerPreprocessor_10 (Array Int Int))) (let ((.cse9 (store |c_#memory_int#8| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.base| v_DerPreprocessor_10))) (let ((.cse8 (+ (select (select .cse9 |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 1))) (let ((.cse7 (store |c_#memory_int#3| |c_~#q~0.base| (store .cse4 .cse5 .cse8)))) (or (forall ((v_prenex_77 (Array Int Int))) (not (= (select (select (store .cse7 |c_ULTIMATE.start_atomic_compare_exchange_strong_~obj#1.base| v_prenex_77) |c_~#q~0.base|) .cse2) 0))) (not (= .cse0 (select (select .cse7 |c_ULTIMATE.start_atomic_compare_exchange_strong_~obj#1.base|) |c_ULTIMATE.start_atomic_compare_exchange_strong_~obj#1.offset|))) (< 0 .cse8) (forall ((v_prenex_51 Int) (v_prenex_50 Int)) (not (= (select (select .cse9 v_prenex_50) v_prenex_51) 0)))))))) (or (not .cse6) (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_prenex_81 Int) (v_prenex_80 Int)) (let ((.cse10 (store |c_#memory_int#8| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.base| v_DerPreprocessor_10))) (or (not (= (select (select .cse10 v_prenex_80) v_prenex_81) 0)) (< 0 (+ (select (select .cse10 |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 1))))))))) .cse11) (or (not .cse11) (let ((.cse16 (+ (select (select |c_#memory_int#8| |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 1))) (let ((.cse13 (< 0 .cse16))) (and (or (forall ((v_DerPreprocessor_9 Int)) (= (select (select (store |c_#memory_int#3| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse12 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_DerPreprocessor_9)) |c_~#q~0.base|) .cse2) 0)) (forall ((v_prenex_76 Int) (v_prenex_75 Int)) (not (= (select (select |c_#memory_int#8| v_prenex_75) v_prenex_76) 0)))) (or (forall ((v_prenex_51 Int) (v_prenex_50 Int)) (not (= (select (select |c_#memory_int#8| v_prenex_50) v_prenex_51) 0))) .cse13 (forall ((v_prenex_72 (Array Int Int)) (v_DerPreprocessor_9 Int)) (let ((.cse14 (let ((.cse15 (store |c_#memory_int#3| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse12 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_DerPreprocessor_9)))) (store .cse15 |c_~#q~0.base| (store (select .cse15 |c_~#q~0.base|) .cse5 .cse16))))) (or (not (= (select (select (store .cse14 |c_ULTIMATE.start_atomic_compare_exchange_strong_~obj#1.base| v_prenex_72) |c_~#q~0.base|) .cse2) 0)) (not (= .cse0 (select (select .cse14 |c_ULTIMATE.start_atomic_compare_exchange_strong_~obj#1.base|) |c_ULTIMATE.start_atomic_compare_exchange_strong_~obj#1.offset|))))))) (or (forall ((v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse17 (let ((.cse18 (store |c_#memory_int#3| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse12 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_DerPreprocessor_9)))) (store .cse18 |c_~#q~0.base| (store (select .cse18 |c_~#q~0.base|) .cse5 .cse16))))) (or (= (select (select (store .cse17 |c_ULTIMATE.start_atomic_compare_exchange_strong_~obj#1.base| v_DerPreprocessor_8) |c_~#q~0.base|) .cse2) 0) (not (= .cse0 (select (select .cse17 |c_ULTIMATE.start_atomic_compare_exchange_strong_~obj#1.base|) |c_ULTIMATE.start_atomic_compare_exchange_strong_~obj#1.offset|)))))) (forall ((v_prenex_74 Int) (v_prenex_73 Int)) (not (= (select (select |c_#memory_int#8| v_prenex_73) v_prenex_74) 0)))) (or (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_30| Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_30| Int)) (not (= (select (select |c_#memory_int#8| |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_30|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_30|) 0))) (forall ((v_DerPreprocessor_9 Int)) (not (= (select (select (store |c_#memory_int#3| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse12 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_DerPreprocessor_9)) |c_~#q~0.base|) .cse2) 0))) .cse13)))))))) is different from false [2025-04-14 00:18:26,756 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:18:26,756 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 342 treesize of output 545 [2025-04-14 00:18:26,791 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:18:26,792 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 309 treesize of output 310 [2025-04-14 00:18:26,816 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:18:26,817 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 301 treesize of output 306 [2025-04-14 00:18:26,830 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 297 treesize of output 295 [2025-04-14 00:18:26,855 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:18:26,856 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 295 treesize of output 298 [2025-04-14 00:19:03,096 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:19:03,097 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 93 [2025-04-14 00:19:03,100 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2025-04-14 00:19:03,192 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2025-04-14 00:19:03,227 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:19:03,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585197468] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:19:03,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:19:03,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 40 [2025-04-14 00:19:03,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469539322] [2025-04-14 00:19:03,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:19:03,228 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-14 00:19:03,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:03,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-14 00:19:03,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1389, Unknown=3, NotChecked=76, Total=1640 [2025-04-14 00:19:03,229 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-14 00:19:03,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 1059 transitions, 10963 flow. Second operand has 41 states, 41 states have (on average 2.8780487804878048) internal successors, (118), 41 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:03,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:03,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-14 00:19:03,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:41,993 INFO L116 PetriNetUnfolderBase]: 72549/105911 cut-off events. [2025-04-14 00:19:41,994 INFO L117 PetriNetUnfolderBase]: For 520274/520274 co-relation queries the response was YES. [2025-04-14 00:19:43,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509570 conditions, 105911 events. 72549/105911 cut-off events. For 520274/520274 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 622337 event pairs, 17851 based on Foata normal form. 354/83293 useless extension candidates. Maximal degree in co-relation 509473. Up to 97108 conditions per place. [2025-04-14 00:19:43,917 INFO L140 encePairwiseOnDemand]: 204/256 looper letters, 1140 selfloop transitions, 297 changer transitions 0/1437 dead transitions. [2025-04-14 00:19:43,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 1437 transitions, 16839 flow [2025-04-14 00:19:43,918 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-14 00:19:43,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-04-14 00:19:43,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 663 transitions. [2025-04-14 00:19:43,919 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.076171875 [2025-04-14 00:19:43,919 INFO L175 Difference]: Start difference. First operand has 450 places, 1059 transitions, 10963 flow. Second operand 34 states and 663 transitions. [2025-04-14 00:19:43,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 1437 transitions, 16839 flow [2025-04-14 00:19:56,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 1437 transitions, 16322 flow, removed 136 selfloop flow, removed 20 redundant places. [2025-04-14 00:19:56,225 INFO L231 Difference]: Finished difference. Result has 473 places, 1129 transitions, 12150 flow [2025-04-14 00:19:56,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=10546, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1059, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=251, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=790, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=12150, PETRI_PLACES=473, PETRI_TRANSITIONS=1129} [2025-04-14 00:19:56,226 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 289 predicate places. [2025-04-14 00:19:56,226 INFO L485 AbstractCegarLoop]: Abstraction has has 473 places, 1129 transitions, 12150 flow [2025-04-14 00:19:56,226 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.8780487804878048) internal successors, (118), 41 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:19:56,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:56,226 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-14 00:19:56,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 00:19:56,427 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-14 00:19:56,427 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-14 00:19:56,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:56,428 INFO L85 PathProgramCache]: Analyzing trace with hash -184033672, now seen corresponding path program 4 times [2025-04-14 00:19:56,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:56,428 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574548002] [2025-04-14 00:19:56,428 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:19:56,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:56,458 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-14 00:19:56,485 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:19:56,486 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:19:56,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:19:58,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:58,287 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574548002] [2025-04-14 00:19:58,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574548002] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:19:58,287 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138370982] [2025-04-14 00:19:58,287 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:19:58,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:19:58,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:19:58,290 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:19:58,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 00:19:58,542 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. Received shutdown request... [2025-04-14 00:24:21,326 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 00:24:21,326 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 00:24:22,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 [2025-04-14 00:24:22,527 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forcibly destroying the process [2025-04-14 00:24:22,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 137 [2025-04-14 00:24:22,543 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 00:24:22,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-04-14 00:24:22,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2025-04-14 00:24:22,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233702262] [2025-04-14 00:24:22,543 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-04-14 00:24:22,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 00:24:22,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:24:22,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 00:24:22,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-04-14 00:24:22,544 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-14 00:24:22,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 1129 transitions, 12150 flow. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:24:22,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:24:22,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-14 00:24:22,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:24:22,545 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-14 00:24:22,546 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-14 00:24:22,546 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-14 00:24:22,546 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-14 00:24:22,546 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-14 00:24:22,546 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-14 00:24:22,546 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-14 00:24:22,546 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-04-14 00:24:22,546 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:24:22,548 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-04-14 00:24:22,548 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:24:22,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:24:22 BasicIcfg [2025-04-14 00:24:22,551 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:24:22,551 INFO L158 Benchmark]: Toolchain (without parser) took 763312.63ms. Allocated memory was 142.6MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 96.4MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2025-04-14 00:24:22,551 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:24:22,551 INFO L158 Benchmark]: CACSL2BoogieTranslator took 827.34ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 33.7MB in the end (delta: 62.6MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. [2025-04-14 00:24:22,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 131.31ms. Allocated memory is still 142.6MB. Free memory was 33.7MB in the beginning and 92.5MB in the end (delta: -58.7MB). Peak memory consumption was 22.9MB. Max. memory is 8.0GB. [2025-04-14 00:24:22,552 INFO L158 Benchmark]: Boogie Preprocessor took 168.19ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 78.4MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 00:24:22,552 INFO L158 Benchmark]: IcfgBuilder took 3362.59ms. Allocated memory was 142.6MB in the beginning and 348.1MB in the end (delta: 205.5MB). Free memory was 78.4MB in the beginning and 175.3MB in the end (delta: -96.9MB). Peak memory consumption was 231.0MB. Max. memory is 8.0GB. [2025-04-14 00:24:22,552 INFO L158 Benchmark]: TraceAbstraction took 758818.50ms. Allocated memory was 348.1MB in the beginning and 4.9GB in the end (delta: 4.5GB). Free memory was 175.3MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2025-04-14 00:24:22,553 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 827.34ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 33.7MB in the end (delta: 62.6MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 131.31ms. Allocated memory is still 142.6MB. Free memory was 33.7MB in the beginning and 92.5MB in the end (delta: -58.7MB). Peak memory consumption was 22.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 168.19ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 78.4MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgBuilder took 3362.59ms. Allocated memory was 142.6MB in the beginning and 348.1MB in the end (delta: 205.5MB). Free memory was 78.4MB in the beginning and 175.3MB in the end (delta: -96.9MB). Peak memory consumption was 231.0MB. Max. memory is 8.0GB. * TraceAbstraction took 758818.50ms. Allocated memory was 348.1MB in the beginning and 4.9GB in the end (delta: 4.5GB). Free memory was 175.3MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1900]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1793]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1914]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1900]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1914]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1952]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 180 locations, 256 edges, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.2s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 358 IncrementalHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 0 mSDtfsCounter, 358 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=471occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 41 ConstructedInterpolants, 0 QuantifiedInterpolants, 55 SizeOfPredicates, 0 NumberOfNonLiveVariables, 324 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 196 locations, 278 edges, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 755.4s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 390.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 5628 SdHoareTripleChecker+Valid, 81.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5628 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 76.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1219 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 963 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54079 IncrementalHoareTripleChecker+Invalid, 56265 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 963 mSolverCounterUnsat, 0 mSDtfsCounter, 54079 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 614 GetRequests, 219 SyntacticMatches, 7 SemanticMatches, 388 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4883 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12150occurred in iteration=14, InterpolantAutomatonStates: 278, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 25.9s SatisfiabilityAnalysisTime, 72.4s InterpolantComputationTime, 591 NumberOfCodeBlocks, 583 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 700 ConstructedInterpolants, 50 QuantifiedInterpolants, 13113 SizeOfPredicates, 380 NumberOfNonLiveVariables, 3409 ConjunctsInSsa, 622 ConjunctsInUnsatCore, 23 InterpolantComputations, 10 PerfectInterpolantSequences, 180/193 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown