/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-ext/04_incdec_cas.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:49:31,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:49:31,088 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-13 23:49:31,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:49:31,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:49:31,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:49:31,121 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:49:31,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:49:31,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:49:31,122 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:49:31,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:49:31,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:49:31,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:49:31,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:49:31,123 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:49:31,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:49:31,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:49:31,123 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:49:31,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:49:31,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:49:31,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:49:31,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:49:31,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:49:31,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:49:31,123 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:49:31,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:49:31,124 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:49:31,124 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:49:31,124 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:49:31,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:49:31,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:49:31,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:49:31,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:49:31,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:49:31,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:49:31,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:49:31,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:49:31,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:49:31,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:49:31,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:49:31,124 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:49:31,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:49:31,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:49:31,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:49:31,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:49:31,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:49:31,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:49:31,125 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-13 23:49:31,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:49:31,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:49:31,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:49:31,361 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:49:31,362 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:49:31,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2025-04-13 23:49:32,675 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0ce0c9b1/ea41608173024950a76478e60ca7cfab/FLAG9e9156e34 [2025-04-13 23:49:32,934 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:49:32,934 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2025-04-13 23:49:32,947 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0ce0c9b1/ea41608173024950a76478e60ca7cfab/FLAG9e9156e34 [2025-04-13 23:49:33,829 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0ce0c9b1/ea41608173024950a76478e60ca7cfab [2025-04-13 23:49:33,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:49:33,832 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:49:33,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:49:33,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:49:33,837 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:49:33,838 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:49:33" (1/1) ... [2025-04-13 23:49:33,838 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160547ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:33, skipping insertion in model container [2025-04-13 23:49:33,839 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:49:33" (1/1) ... [2025-04-13 23:49:33,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:49:34,166 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-ext/04_incdec_cas.i[30369,30382] [2025-04-13 23:49:34,180 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-ext/04_incdec_cas.i[30869,30882] [2025-04-13 23:49:34,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:49:34,192 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:49:34,240 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-ext/04_incdec_cas.i[30369,30382] [2025-04-13 23:49:34,244 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-ext/04_incdec_cas.i[30869,30882] [2025-04-13 23:49:34,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:49:34,276 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:49:34,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:34 WrapperNode [2025-04-13 23:49:34,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:49:34,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:49:34,277 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:49:34,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:49:34,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:34" (1/1) ... [2025-04-13 23:49:34,293 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:34" (1/1) ... [2025-04-13 23:49:34,312 INFO L138 Inliner]: procedures = 174, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2025-04-13 23:49:34,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:49:34,313 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:49:34,313 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:49:34,313 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:49:34,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:34" (1/1) ... [2025-04-13 23:49:34,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:34" (1/1) ... [2025-04-13 23:49:34,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:34" (1/1) ... [2025-04-13 23:49:34,334 INFO L175 MemorySlicer]: Split 23 memory accesses to 4 slices as follows [2, 9, 6, 6]. 39 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 1, 2, 0]. The 8 writes are split as follows [0, 2, 2, 4]. [2025-04-13 23:49:34,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:34" (1/1) ... [2025-04-13 23:49:34,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:34" (1/1) ... [2025-04-13 23:49:34,338 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:34" (1/1) ... [2025-04-13 23:49:34,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:34" (1/1) ... [2025-04-13 23:49:34,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:34" (1/1) ... [2025-04-13 23:49:34,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:34" (1/1) ... [2025-04-13 23:49:34,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:49:34,344 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:49:34,344 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:49:34,344 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:49:34,345 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:34" (1/1) ... [2025-04-13 23:49:34,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:49:34,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:49:34,375 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-13 23:49:34,382 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-13 23:49:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 23:49:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 23:49:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 23:49:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 23:49:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 23:49:34,398 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 23:49:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 23:49:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 23:49:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 23:49:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 23:49:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 23:49:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:49:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-13 23:49:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-13 23:49:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:49:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:49:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 23:49:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 23:49:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 23:49:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:49:34,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:49:34,400 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:49:34,510 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:49:34,511 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:49:34,706 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: havoc dec_~#dec__casret~0#1.base, dec_~#dec__casret~0#1.offset; [2025-04-13 23:49:34,706 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-1: SUMMARY for call ULTIMATE.dealloc(dec_~#dec__casret~0#1.base, dec_~#dec__casret~0#1.offset); srcloc: null [2025-04-13 23:49:34,706 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711: havoc inc_~#inc__casret~0#1.base, inc_~#inc__casret~0#1.offset; [2025-04-13 23:49:34,706 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-1: SUMMARY for call ULTIMATE.dealloc(inc_~#inc__casret~0#1.base, inc_~#inc__casret~0#1.offset); srcloc: null [2025-04-13 23:49:34,738 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:49:34,738 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:49:34,739 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:49:34,930 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:49:34,935 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:49:34,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:49:34 BoogieIcfgContainer [2025-04-13 23:49:34,935 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:49:34,938 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:49:34,938 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:49:34,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:49:34,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:49:33" (1/3) ... [2025-04-13 23:49:34,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39239865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:49:34, skipping insertion in model container [2025-04-13 23:49:34,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:34" (2/3) ... [2025-04-13 23:49:34,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39239865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:49:34, skipping insertion in model container [2025-04-13 23:49:34,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:49:34" (3/3) ... [2025-04-13 23:49:34,944 INFO L128 eAbstractionObserver]: Analyzing ICFG 04_incdec_cas.i [2025-04-13 23:49:34,954 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:49:34,956 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04_incdec_cas.i that has 2 procedures, 20 locations, 27 edges, 1 initial locations, 3 loop locations, and 2 error locations. [2025-04-13 23:49:34,956 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:49:35,015 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:49:35,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 28 transitions, 60 flow [2025-04-13 23:49:35,064 INFO L116 PetriNetUnfolderBase]: 7/28 cut-off events. [2025-04-13 23:49:35,067 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:49:35,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 28 events. 7/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 70 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 24. Up to 4 conditions per place. [2025-04-13 23:49:35,070 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 28 transitions, 60 flow [2025-04-13 23:49:35,074 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 27 transitions, 58 flow [2025-04-13 23:49:35,082 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:49:35,090 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;@7fd4130a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:49:35,090 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 23:49:35,095 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:49:35,096 INFO L116 PetriNetUnfolderBase]: 1/11 cut-off events. [2025-04-13 23:49:35,096 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:49:35,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:35,096 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 23:49:35,097 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:49:35,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:35,101 INFO L85 PathProgramCache]: Analyzing trace with hash 11745802, now seen corresponding path program 1 times [2025-04-13 23:49:35,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:35,108 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223646788] [2025-04-13 23:49:35,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:35,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:35,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:49:35,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:49:35,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:35,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:49:35,181 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:49:35,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:49:35,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:49:35,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:35,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:49:35,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:49:35,215 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:49:35,216 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 23:49:35,217 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 23:49:35,218 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 23:49:35,218 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 23:49:35,218 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 23:49:35,218 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:49:35,218 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 23:49:35,220 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:49:35,220 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 23:49:35,273 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:49:35,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 51 transitions, 112 flow [2025-04-13 23:49:35,296 INFO L116 PetriNetUnfolderBase]: 14/53 cut-off events. [2025-04-13 23:49:35,296 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:49:35,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 53 events. 14/53 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 172 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 46. Up to 4 conditions per place. [2025-04-13 23:49:35,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 51 transitions, 112 flow [2025-04-13 23:49:35,299 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 50 transitions, 110 flow [2025-04-13 23:49:35,300 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:49:35,300 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;@7fd4130a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:49:35,300 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 23:49:35,307 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:49:35,308 INFO L116 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-04-13 23:49:35,308 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:49:35,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:35,308 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:49:35,308 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:49:35,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:35,309 INFO L85 PathProgramCache]: Analyzing trace with hash 413468349, now seen corresponding path program 1 times [2025-04-13 23:49:35,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:35,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130335629] [2025-04-13 23:49:35,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:35,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:35,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:49:35,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:49:35,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:35,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:35,392 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-13 23:49:35,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:35,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130335629] [2025-04-13 23:49:35,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130335629] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:49:35,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:49:35,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:49:35,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768885210] [2025-04-13 23:49:35,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:49:35,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:49:35,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:35,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:49:35,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:49:35,418 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 51 [2025-04-13 23:49:35,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 50 transitions, 110 flow. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-13 23:49:35,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:35,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 51 [2025-04-13 23:49:35,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:35,707 INFO L116 PetriNetUnfolderBase]: 1065/1613 cut-off events. [2025-04-13 23:49:35,707 INFO L117 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-04-13 23:49:35,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3277 conditions, 1613 events. 1065/1613 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6564 event pairs, 735 based on Foata normal form. 0/1151 useless extension candidates. Maximal degree in co-relation 1472. Up to 1611 conditions per place. [2025-04-13 23:49:35,734 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 44 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2025-04-13 23:49:35,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 188 flow [2025-04-13 23:49:35,737 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:49:35,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:49:35,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2025-04-13 23:49:35,746 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 23:49:35,747 INFO L175 Difference]: Start difference. First operand has 41 places, 50 transitions, 110 flow. Second operand 2 states and 51 transitions. [2025-04-13 23:49:35,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 188 flow [2025-04-13 23:49:35,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 23:49:35,754 INFO L231 Difference]: Finished difference. Result has 41 places, 45 transitions, 100 flow [2025-04-13 23:49:35,756 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=100, PETRI_PLACES=41, PETRI_TRANSITIONS=45} [2025-04-13 23:49:35,759 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2025-04-13 23:49:35,759 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 45 transitions, 100 flow [2025-04-13 23:49:35,759 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-13 23:49:35,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:35,759 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-04-13 23:49:35,759 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:49:35,759 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:49:35,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:35,762 INFO L85 PathProgramCache]: Analyzing trace with hash -68077370, now seen corresponding path program 1 times [2025-04-13 23:49:35,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:35,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698872533] [2025-04-13 23:49:35,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:35,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:35,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:49:35,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:49:35,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:35,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:49:35,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:49:35,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:49:35,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:49:35,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:35,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:49:35,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:49:35,787 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:49:35,787 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-13 23:49:35,787 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 23:49:35,787 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-04-13 23:49:35,787 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-04-13 23:49:35,787 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-13 23:49:35,787 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-13 23:49:35,787 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 23:49:35,788 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:49:35,788 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:49:35,788 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:49:35,788 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 23:49:35,851 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:49:35,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 74 transitions, 166 flow [2025-04-13 23:49:35,863 INFO L116 PetriNetUnfolderBase]: 21/78 cut-off events. [2025-04-13 23:49:35,863 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 23:49:35,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 78 events. 21/78 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 277 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 68. Up to 4 conditions per place. [2025-04-13 23:49:35,865 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 74 transitions, 166 flow [2025-04-13 23:49:35,866 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 73 transitions, 164 flow [2025-04-13 23:49:35,867 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:49:35,868 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;@7fd4130a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:49:35,868 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-13 23:49:35,870 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:49:35,870 INFO L116 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-04-13 23:49:35,870 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:49:35,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:35,870 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:49:35,870 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:49:35,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:35,870 INFO L85 PathProgramCache]: Analyzing trace with hash 484742321, now seen corresponding path program 1 times [2025-04-13 23:49:35,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:35,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229039107] [2025-04-13 23:49:35,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:35,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:35,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:49:35,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:49:35,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:35,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:35,911 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-13 23:49:35,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:35,912 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229039107] [2025-04-13 23:49:35,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229039107] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:49:35,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:49:35,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:49:35,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656336365] [2025-04-13 23:49:35,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:49:35,912 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:49:35,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:35,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:49:35,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:49:35,913 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 74 [2025-04-13 23:49:35,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 73 transitions, 164 flow. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-13 23:49:35,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:35,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 74 [2025-04-13 23:49:35,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:38,211 INFO L116 PetriNetUnfolderBase]: 27945/36712 cut-off events. [2025-04-13 23:49:38,211 INFO L117 PetriNetUnfolderBase]: For 1653/1653 co-relation queries the response was YES. [2025-04-13 23:49:38,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74473 conditions, 36712 events. 27945/36712 cut-off events. For 1653/1653 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 181071 event pairs, 19935 based on Foata normal form. 0/25498 useless extension candidates. Maximal degree in co-relation 8448. Up to 36683 conditions per place. [2025-04-13 23:49:38,373 INFO L140 encePairwiseOnDemand]: 67/74 looper letters, 65 selfloop transitions, 0 changer transitions 0/66 dead transitions. [2025-04-13 23:49:38,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 280 flow [2025-04-13 23:49:38,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:49:38,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:49:38,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2025-04-13 23:49:38,374 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 23:49:38,374 INFO L175 Difference]: Start difference. First operand has 59 places, 73 transitions, 164 flow. Second operand 2 states and 74 transitions. [2025-04-13 23:49:38,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 280 flow [2025-04-13 23:49:38,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 66 transitions, 278 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-04-13 23:49:38,380 INFO L231 Difference]: Finished difference. Result has 59 places, 66 transitions, 148 flow [2025-04-13 23:49:38,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=148, PETRI_PLACES=59, PETRI_TRANSITIONS=66} [2025-04-13 23:49:38,380 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2025-04-13 23:49:38,380 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 66 transitions, 148 flow [2025-04-13 23:49:38,381 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-13 23:49:38,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:38,381 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:49:38,381 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:49:38,381 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:49:38,381 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:38,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1279953211, now seen corresponding path program 1 times [2025-04-13 23:49:38,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:38,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205954469] [2025-04-13 23:49:38,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:38,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:38,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:49:38,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:49:38,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:38,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:38,834 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-13 23:49:38,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:38,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205954469] [2025-04-13 23:49:38,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205954469] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:49:38,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:49:38,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:49:38,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338533337] [2025-04-13 23:49:38,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:49:38,835 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:49:38,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:38,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:49:38,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:49:38,836 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 74 [2025-04-13 23:49:38,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 66 transitions, 148 flow. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-13 23:49:38,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:38,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 74 [2025-04-13 23:49:38,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:42,758 INFO L116 PetriNetUnfolderBase]: 51071/67232 cut-off events. [2025-04-13 23:49:42,758 INFO L117 PetriNetUnfolderBase]: For 1627/1627 co-relation queries the response was YES. [2025-04-13 23:49:42,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136041 conditions, 67232 events. 51071/67232 cut-off events. For 1627/1627 co-relation queries the response was YES. Maximal size of possible extension queue 2032. Compared 371819 event pairs, 8107 based on Foata normal form. 0/47924 useless extension candidates. Maximal degree in co-relation 136035. Up to 39518 conditions per place. [2025-04-13 23:49:43,077 INFO L140 encePairwiseOnDemand]: 61/74 looper letters, 295 selfloop transitions, 33 changer transitions 0/329 dead transitions. [2025-04-13 23:49:43,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 329 transitions, 1385 flow [2025-04-13 23:49:43,078 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:49:43,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 23:49:43,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 340 transitions. [2025-04-13 23:49:43,080 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5105105105105106 [2025-04-13 23:49:43,080 INFO L175 Difference]: Start difference. First operand has 59 places, 66 transitions, 148 flow. Second operand 9 states and 340 transitions. [2025-04-13 23:49:43,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 329 transitions, 1385 flow [2025-04-13 23:49:43,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 329 transitions, 1385 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 23:49:43,090 INFO L231 Difference]: Finished difference. Result has 72 places, 106 transitions, 369 flow [2025-04-13 23:49:43,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=369, PETRI_PLACES=72, PETRI_TRANSITIONS=106} [2025-04-13 23:49:43,092 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 13 predicate places. [2025-04-13 23:49:43,092 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 106 transitions, 369 flow [2025-04-13 23:49:43,092 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-13 23:49:43,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:43,092 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:49:43,092 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:49:43,092 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:49:43,093 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:43,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1310550556, now seen corresponding path program 1 times [2025-04-13 23:49:43,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:43,093 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504192002] [2025-04-13 23:49:43,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:43,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:43,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:49:43,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:49:43,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:43,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:43,176 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-13 23:49:43,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:43,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504192002] [2025-04-13 23:49:43,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504192002] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:49:43,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:49:43,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:49:43,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714371933] [2025-04-13 23:49:43,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:49:43,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:49:43,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:43,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:49:43,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:49:43,178 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 74 [2025-04-13 23:49:43,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 106 transitions, 369 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-13 23:49:43,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:43,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 74 [2025-04-13 23:49:43,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:47,290 INFO L116 PetriNetUnfolderBase]: 51965/68478 cut-off events. [2025-04-13 23:49:47,290 INFO L117 PetriNetUnfolderBase]: For 13147/13147 co-relation queries the response was YES. [2025-04-13 23:49:47,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157004 conditions, 68478 events. 51965/68478 cut-off events. For 13147/13147 co-relation queries the response was YES. Maximal size of possible extension queue 2137. Compared 380045 event pairs, 13191 based on Foata normal form. 0/52426 useless extension candidates. Maximal degree in co-relation 156992. Up to 63444 conditions per place. [2025-04-13 23:49:47,743 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 172 selfloop transitions, 21 changer transitions 0/194 dead transitions. [2025-04-13 23:49:47,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 194 transitions, 973 flow [2025-04-13 23:49:47,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:49:47,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 23:49:47,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2025-04-13 23:49:47,745 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4540540540540541 [2025-04-13 23:49:47,745 INFO L175 Difference]: Start difference. First operand has 72 places, 106 transitions, 369 flow. Second operand 5 states and 168 transitions. [2025-04-13 23:49:47,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 194 transitions, 973 flow [2025-04-13 23:49:47,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 194 transitions, 961 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 23:49:47,915 INFO L231 Difference]: Finished difference. Result has 78 places, 112 transitions, 455 flow [2025-04-13 23:49:47,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=455, PETRI_PLACES=78, PETRI_TRANSITIONS=112} [2025-04-13 23:49:47,915 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 19 predicate places. [2025-04-13 23:49:47,915 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 112 transitions, 455 flow [2025-04-13 23:49:47,915 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-13 23:49:47,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:47,915 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1] [2025-04-13 23:49:47,916 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:49:47,916 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:49:47,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:47,916 INFO L85 PathProgramCache]: Analyzing trace with hash 631641135, now seen corresponding path program 1 times [2025-04-13 23:49:47,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:47,916 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444470830] [2025-04-13 23:49:47,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:47,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:47,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:49:47,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:49:47,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:47,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:49:47,924 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:49:47,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:49:47,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:49:47,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:47,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:49:47,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:49:47,936 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:49:47,937 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-04-13 23:49:47,937 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2025-04-13 23:49:47,937 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2025-04-13 23:49:47,937 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2025-04-13 23:49:47,937 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (4 of 9 remaining) [2025-04-13 23:49:47,937 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 9 remaining) [2025-04-13 23:49:47,937 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 9 remaining) [2025-04-13 23:49:47,937 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2025-04-13 23:49:47,937 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2025-04-13 23:49:47,937 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:49:47,937 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-13 23:49:47,938 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:49:47,938 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 23:49:48,005 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:49:48,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 97 transitions, 222 flow [2025-04-13 23:49:48,023 INFO L116 PetriNetUnfolderBase]: 28/103 cut-off events. [2025-04-13 23:49:48,023 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 23:49:48,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 103 events. 28/103 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 363 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 90. Up to 5 conditions per place. [2025-04-13 23:49:48,024 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 97 transitions, 222 flow [2025-04-13 23:49:48,026 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 96 transitions, 220 flow [2025-04-13 23:49:48,026 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:49:48,028 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;@7fd4130a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:49:48,028 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-04-13 23:49:48,030 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:49:48,030 INFO L116 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-04-13 23:49:48,031 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:49:48,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:48,031 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:49:48,031 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-13 23:49:48,031 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:48,031 INFO L85 PathProgramCache]: Analyzing trace with hash 577987154, now seen corresponding path program 1 times [2025-04-13 23:49:48,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:48,031 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544760815] [2025-04-13 23:49:48,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:48,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:48,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:49:48,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:49:48,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:48,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:48,047 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-13 23:49:48,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:48,048 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544760815] [2025-04-13 23:49:48,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544760815] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:49:48,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:49:48,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:49:48,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856955495] [2025-04-13 23:49:48,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:49:48,048 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:49:48,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:48,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:49:48,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:49:48,049 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 97 [2025-04-13 23:49:48,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 96 transitions, 220 flow. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-13 23:49:48,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:48,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 97 [2025-04-13 23:49:48,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand