/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -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 19:16:06,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:16:06,256 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 19:16:06,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:16:06,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:16:06,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:16:06,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:16:06,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:16:06,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:16:06,274 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:16:06,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:16:06,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:16:06,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:16:06,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:16:06,275 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:16:06,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:16:06,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:16:06,275 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:16:06,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:16:06,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:16:06,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:16:06,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:16:06,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:16:06,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:16:06,275 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:16:06,275 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:16:06,275 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:16:06,276 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:16:06,276 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:16:06,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:16:06,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:16:06,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:16:06,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:16:06,276 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:16:06,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:16:06,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:16:06,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:16:06,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:16:06,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:16:06,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:16:06,276 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:16:06,276 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:16:06,276 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:16:06,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:16:06,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:16:06,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:16:06,277 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:16:06,277 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 [2025-04-13 19:16:06,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:16:06,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:16:06,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:16:06,539 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:16:06,540 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:16:06,542 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 19:16:07,880 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2893d6984/929733d56ad34454b9ba9d438e3fba8e/FLAGde65ff616 [2025-04-13 19:16:08,135 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:16:08,136 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2025-04-13 19:16:08,149 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2893d6984/929733d56ad34454b9ba9d438e3fba8e/FLAGde65ff616 [2025-04-13 19:16:08,882 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2893d6984/929733d56ad34454b9ba9d438e3fba8e [2025-04-13 19:16:08,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:16:08,885 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:16:08,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:16:08,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:16:08,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:16:08,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:16:08" (1/1) ... [2025-04-13 19:16:08,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e7b93a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:08, skipping insertion in model container [2025-04-13 19:16:08,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:16:08" (1/1) ... [2025-04-13 19:16:08,913 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:16:09,192 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 19:16:09,203 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 19:16:09,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:16:09,216 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:16:09,266 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 19:16:09,269 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 19:16:09,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:16:09,293 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:16:09,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:09 WrapperNode [2025-04-13 19:16:09,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:16:09,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:16:09,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:16:09,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:16:09,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:09" (1/1) ... [2025-04-13 19:16:09,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:09" (1/1) ... [2025-04-13 19:16:09,332 INFO L138 Inliner]: procedures = 174, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2025-04-13 19:16:09,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:16:09,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:16:09,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:16:09,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:16:09,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:09" (1/1) ... [2025-04-13 19:16:09,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:09" (1/1) ... [2025-04-13 19:16:09,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:09" (1/1) ... [2025-04-13 19:16:09,353 INFO L175 MemorySlicer]: Split 23 memory accesses to 4 slices as follows [2, 6, 9, 6]. 39 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 0, 1, 2]. The 8 writes are split as follows [0, 4, 2, 2]. [2025-04-13 19:16:09,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:09" (1/1) ... [2025-04-13 19:16:09,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:09" (1/1) ... [2025-04-13 19:16:09,357 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:09" (1/1) ... [2025-04-13 19:16:09,357 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:09" (1/1) ... [2025-04-13 19:16:09,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:09" (1/1) ... [2025-04-13 19:16:09,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:09" (1/1) ... [2025-04-13 19:16:09,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:09" (1/1) ... [2025-04-13 19:16:09,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:16:09,364 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:16:09,364 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:16:09,364 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:16:09,365 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:09" (1/1) ... [2025-04-13 19:16:09,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:16:09,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:16:09,387 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 19:16:09,392 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 19:16:09,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 19:16:09,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 19:16:09,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 19:16:09,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 19:16:09,404 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 19:16:09,404 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 19:16:09,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 19:16:09,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 19:16:09,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 19:16:09,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 19:16:09,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:16:09,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:16:09,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-13 19:16:09,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-13 19:16:09,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:16:09,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:16:09,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 19:16:09,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 19:16:09,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:16:09,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:16:09,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:16:09,406 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:16:09,497 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:16:09,498 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:16:09,682 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:16:09,683 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:16:09,683 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:16:09,869 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:16:09,876 INFO L313 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-13 19:16:09,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:16:09 BoogieIcfgContainer [2025-04-13 19:16:09,877 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:16:09,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:16:09,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:16:09,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:16:09,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:16:08" (1/3) ... [2025-04-13 19:16:09,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d35f7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:16:09, skipping insertion in model container [2025-04-13 19:16:09,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:09" (2/3) ... [2025-04-13 19:16:09,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d35f7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:16:09, skipping insertion in model container [2025-04-13 19:16:09,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:16:09" (3/3) ... [2025-04-13 19:16:09,883 INFO L128 eAbstractionObserver]: Analyzing ICFG 04_incdec_cas.i [2025-04-13 19:16:09,892 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:16:09,893 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 19:16:09,894 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:16:09,966 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:16:09,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 28 transitions, 60 flow [2025-04-13 19:16:10,015 INFO L116 PetriNetUnfolderBase]: 7/28 cut-off events. [2025-04-13 19:16:10,016 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:16:10,017 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 80 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 19:16:10,018 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 28 transitions, 60 flow [2025-04-13 19:16:10,020 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 27 transitions, 58 flow [2025-04-13 19:16:10,027 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:16:10,035 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;@6c496c01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:16:10,036 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 19:16:10,042 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:16:10,042 INFO L116 PetriNetUnfolderBase]: 1/11 cut-off events. [2025-04-13 19:16:10,042 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:16:10,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:10,043 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 19:16:10,043 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 19:16:10,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:10,047 INFO L85 PathProgramCache]: Analyzing trace with hash 13574720, now seen corresponding path program 1 times [2025-04-13 19:16:10,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:10,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510581331] [2025-04-13 19:16:10,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:10,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:10,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:16:10,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:16:10,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:10,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:10,124 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:16:10,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:16:10,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:16:10,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:10,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:10,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:16:10,161 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:16:10,163 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 19:16:10,164 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 19:16:10,165 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 19:16:10,166 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 19:16:10,166 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 19:16:10,166 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:16:10,166 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 19:16:10,170 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:16:10,170 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 19:16:10,223 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:16:10,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 51 transitions, 112 flow [2025-04-13 19:16:10,241 INFO L116 PetriNetUnfolderBase]: 14/53 cut-off events. [2025-04-13 19:16:10,241 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:16:10,243 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 12. Compared 184 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 19:16:10,243 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 51 transitions, 112 flow [2025-04-13 19:16:10,244 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 50 transitions, 110 flow [2025-04-13 19:16:10,246 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:16:10,246 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;@6c496c01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:16:10,246 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 19:16:10,251 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:16:10,251 INFO L116 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-04-13 19:16:10,251 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:16:10,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:10,251 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:16:10,251 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 19:16:10,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:10,252 INFO L85 PathProgramCache]: Analyzing trace with hash 470172537, now seen corresponding path program 1 times [2025-04-13 19:16:10,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:10,252 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441897749] [2025-04-13 19:16:10,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:10,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:10,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:16:10,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:16:10,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:10,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:10,330 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 19:16:10,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:10,331 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441897749] [2025-04-13 19:16:10,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441897749] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:10,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:10,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:16:10,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350320702] [2025-04-13 19:16:10,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:10,336 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:16:10,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:10,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:16:10,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:16:10,355 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 51 [2025-04-13 19:16:10,356 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 19:16:10,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:10,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 51 [2025-04-13 19:16:10,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:10,631 INFO L116 PetriNetUnfolderBase]: 1065/1613 cut-off events. [2025-04-13 19:16:10,631 INFO L117 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-04-13 19:16:10,634 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 6574 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 19:16:10,644 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 44 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2025-04-13 19:16:10,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 188 flow [2025-04-13 19:16:10,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 19:16:10,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 19:16:10,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2025-04-13 19:16:10,654 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 19:16:10,655 INFO L175 Difference]: Start difference. First operand has 41 places, 50 transitions, 110 flow. Second operand 2 states and 51 transitions. [2025-04-13 19:16:10,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 188 flow [2025-04-13 19:16:10,659 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 19:16:10,660 INFO L231 Difference]: Finished difference. Result has 41 places, 45 transitions, 100 flow [2025-04-13 19:16:10,662 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 19:16:10,665 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2025-04-13 19:16:10,665 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 45 transitions, 100 flow [2025-04-13 19:16:10,665 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 19:16:10,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:10,666 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-04-13 19:16:10,668 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:16:10,668 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 19:16:10,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:10,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1689513924, now seen corresponding path program 1 times [2025-04-13 19:16:10,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:10,669 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621306663] [2025-04-13 19:16:10,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:10,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:10,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:16:10,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:16:10,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:10,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:10,692 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:16:10,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:16:10,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:16:10,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:10,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:10,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:16:10,712 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:16:10,712 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-13 19:16:10,712 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 19:16:10,712 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-04-13 19:16:10,712 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-04-13 19:16:10,712 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-13 19:16:10,712 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-13 19:16:10,712 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 19:16:10,713 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:16:10,713 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:16:10,713 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:16:10,713 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 19:16:10,780 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:16:10,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 74 transitions, 166 flow [2025-04-13 19:16:10,802 INFO L116 PetriNetUnfolderBase]: 21/78 cut-off events. [2025-04-13 19:16:10,802 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 19:16:10,804 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 278 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 19:16:10,805 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 74 transitions, 166 flow [2025-04-13 19:16:10,806 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 73 transitions, 164 flow [2025-04-13 19:16:10,807 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:16:10,808 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;@6c496c01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:16:10,808 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-13 19:16:10,810 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:16:10,810 INFO L116 PetriNetUnfolderBase]: 1/16 cut-off events. [2025-04-13 19:16:10,810 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 19:16:10,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:10,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:16:10,810 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 19:16:10,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:10,812 INFO L85 PathProgramCache]: Analyzing trace with hash 541446509, now seen corresponding path program 1 times [2025-04-13 19:16:10,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:10,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047852256] [2025-04-13 19:16:10,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:10,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:10,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:16:10,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:16:10,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:10,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:10,855 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 19:16:10,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:10,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047852256] [2025-04-13 19:16:10,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047852256] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:10,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:10,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:16:10,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014266032] [2025-04-13 19:16:10,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:10,856 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:16:10,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:10,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:16:10,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:16:10,856 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 74 [2025-04-13 19:16:10,856 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 19:16:10,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:10,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 74 [2025-04-13 19:16:10,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:13,267 INFO L116 PetriNetUnfolderBase]: 27945/36706 cut-off events. [2025-04-13 19:16:13,267 INFO L117 PetriNetUnfolderBase]: For 1645/1645 co-relation queries the response was YES. [2025-04-13 19:16:13,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74467 conditions, 36706 events. 27945/36706 cut-off events. For 1645/1645 co-relation queries the response was YES. Maximal size of possible extension queue 956. Compared 181034 event pairs, 19935 based on Foata normal form. 0/25492 useless extension candidates. Maximal degree in co-relation 10432. Up to 36683 conditions per place. [2025-04-13 19:16:13,443 INFO L140 encePairwiseOnDemand]: 67/74 looper letters, 65 selfloop transitions, 0 changer transitions 0/66 dead transitions. [2025-04-13 19:16:13,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 280 flow [2025-04-13 19:16:13,444 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 19:16:13,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 19:16:13,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2025-04-13 19:16:13,444 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 19:16:13,444 INFO L175 Difference]: Start difference. First operand has 59 places, 73 transitions, 164 flow. Second operand 2 states and 74 transitions. [2025-04-13 19:16:13,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 280 flow [2025-04-13 19:16:13,447 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 19:16:13,448 INFO L231 Difference]: Finished difference. Result has 59 places, 66 transitions, 148 flow [2025-04-13 19:16:13,448 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 19:16:13,448 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2025-04-13 19:16:13,449 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 66 transitions, 148 flow [2025-04-13 19:16:13,449 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 19:16:13,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:13,449 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1] [2025-04-13 19:16:13,449 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:16:13,449 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 19:16:13,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:13,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1754728437, now seen corresponding path program 1 times [2025-04-13 19:16:13,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:13,449 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603307450] [2025-04-13 19:16:13,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:13,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:13,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:16:13,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:16:13,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:13,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:13,466 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:16:13,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:16:13,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:16:13,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:13,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:13,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:16:13,476 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:16:13,476 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-04-13 19:16:13,481 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2025-04-13 19:16:13,481 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2025-04-13 19:16:13,481 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2025-04-13 19:16:13,481 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (4 of 9 remaining) [2025-04-13 19:16:13,481 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 9 remaining) [2025-04-13 19:16:13,481 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 9 remaining) [2025-04-13 19:16:13,481 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2025-04-13 19:16:13,481 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2025-04-13 19:16:13,481 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:16:13,481 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:16:13,482 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:16:13,482 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 19:16:13,554 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:16:13,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 97 transitions, 222 flow [2025-04-13 19:16:13,566 INFO L116 PetriNetUnfolderBase]: 28/103 cut-off events. [2025-04-13 19:16:13,567 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 19:16:13,569 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 13. Compared 370 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 19:16:13,569 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 97 transitions, 222 flow [2025-04-13 19:16:13,572 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 96 transitions, 220 flow [2025-04-13 19:16:13,572 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:16:13,573 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;@6c496c01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:16:13,573 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-04-13 19:16:13,574 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:16:13,574 INFO L116 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-04-13 19:16:13,574 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:16:13,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:13,575 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:16:13,575 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 19:16:13,575 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:13,575 INFO L85 PathProgramCache]: Analyzing trace with hash 634691342, now seen corresponding path program 1 times [2025-04-13 19:16:13,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:13,575 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589459223] [2025-04-13 19:16:13,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:13,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:13,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:16:13,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:16:13,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:13,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:13,602 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 19:16:13,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:13,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589459223] [2025-04-13 19:16:13,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589459223] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:13,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:13,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:16:13,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481856548] [2025-04-13 19:16:13,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:13,602 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:16:13,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:13,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:16:13,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:16:13,603 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 97 [2025-04-13 19:16:13,603 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 19:16:13,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:13,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 97 [2025-04-13 19:16:13,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:52,801 INFO L116 PetriNetUnfolderBase]: 621865/761962 cut-off events. [2025-04-13 19:16:52,802 INFO L117 PetriNetUnfolderBase]: For 44165/44165 co-relation queries the response was YES. [2025-04-13 19:16:53,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1545196 conditions, 761962 events. 621865/761962 cut-off events. For 44165/44165 co-relation queries the response was YES. Maximal size of possible extension queue 13476. Compared 4138646 event pairs, 450015 based on Foata normal form. 0/521372 useless extension candidates. Maximal degree in co-relation 74735. Up to 761675 conditions per place. [2025-04-13 19:16:56,689 INFO L140 encePairwiseOnDemand]: 88/97 looper letters, 86 selfloop transitions, 0 changer transitions 0/87 dead transitions. [2025-04-13 19:16:56,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 87 transitions, 374 flow [2025-04-13 19:16:56,693 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 19:16:56,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 19:16:56,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2025-04-13 19:16:56,694 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 19:16:56,694 INFO L175 Difference]: Start difference. First operand has 77 places, 96 transitions, 220 flow. Second operand 2 states and 97 transitions. [2025-04-13 19:16:56,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 87 transitions, 374 flow [2025-04-13 19:16:56,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 87 transitions, 368 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-04-13 19:16:56,722 INFO L231 Difference]: Finished difference. Result has 77 places, 87 transitions, 196 flow [2025-04-13 19:16:56,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=196, PETRI_PLACES=77, PETRI_TRANSITIONS=87} [2025-04-13 19:16:56,723 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 0 predicate places. [2025-04-13 19:16:56,723 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 87 transitions, 196 flow [2025-04-13 19:16:56,723 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 19:16:56,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:56,723 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:56,723 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:16:56,723 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-13 19:16:56,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:56,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1645409855, now seen corresponding path program 1 times [2025-04-13 19:16:56,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:56,724 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729443109] [2025-04-13 19:16:56,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:56,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:56,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:16:56,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:16:56,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:56,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:57,138 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 19:16:57,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:57,138 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729443109] [2025-04-13 19:16:57,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729443109] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:57,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:57,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:16:57,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479414943] [2025-04-13 19:16:57,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:57,139 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:16:57,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:57,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:16:57,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:16:57,139 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 97 [2025-04-13 19:16:57,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 87 transitions, 196 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 19:16:57,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:57,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 97 [2025-04-13 19:16:57,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand