/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/goblint-regression/13-privatized_04-priv_multi_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:12:59,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:12:59,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:12:59,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:12:59,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:12:59,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:12:59,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:12:59,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:12:59,852 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:12:59,852 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:12:59,853 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:12:59,853 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:12:59,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:12:59,853 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:12:59,854 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:12:59,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:12:59,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:12:59,854 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:12:59,854 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:12:59,854 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:12:59,854 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:12:59,854 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:12:59,854 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:12:59,854 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:12:59,854 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:12:59,854 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:12:59,855 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:12:59,855 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:12:59,855 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:12:59,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:12:59,855 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:12:59,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:12:59,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:12:59,855 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:12:59,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:12:59,855 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:12:59,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:12:59,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:12:59,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:12:59,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:12:59,856 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:12:59,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:12:59,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:12:59,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:12:59,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:12:59,856 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:12:59,856 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:12:59,856 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:13:00,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:13:00,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:13:00,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:13:00,090 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:13:00,092 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:13:00,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_04-priv_multi_true.i [2025-04-14 00:13:01,418 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dcaa3a76/3a03c15c89b646e5a14487aace907a24/FLAGb738545de [2025-04-14 00:13:01,656 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:13:01,656 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_04-priv_multi_true.i [2025-04-14 00:13:01,668 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dcaa3a76/3a03c15c89b646e5a14487aace907a24/FLAGb738545de [2025-04-14 00:13:02,468 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dcaa3a76/3a03c15c89b646e5a14487aace907a24 [2025-04-14 00:13:02,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:13:02,471 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:13:02,472 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:13:02,472 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:13:02,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:13:02,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:13:02" (1/1) ... [2025-04-14 00:13:02,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d902b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:02, skipping insertion in model container [2025-04-14 00:13:02,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:13:02" (1/1) ... [2025-04-14 00:13:02,498 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:13:02,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_04-priv_multi_true.i[1087,1100] [2025-04-14 00:13:02,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:13:02,889 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:13:02,903 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_04-priv_multi_true.i[1087,1100] [2025-04-14 00:13:02,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:13:02,978 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:13:02,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:02 WrapperNode [2025-04-14 00:13:02,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:13:02,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:13:02,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:13:02,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:13:02,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:02" (1/1) ... [2025-04-14 00:13:03,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:02" (1/1) ... [2025-04-14 00:13:03,019 INFO L138 Inliner]: procedures = 271, calls = 37, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 94 [2025-04-14 00:13:03,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:13:03,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:13:03,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:13:03,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:13:03,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:02" (1/1) ... [2025-04-14 00:13:03,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:02" (1/1) ... [2025-04-14 00:13:03,032 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:02" (1/1) ... [2025-04-14 00:13:03,046 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2025-04-14 00:13:03,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:02" (1/1) ... [2025-04-14 00:13:03,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:02" (1/1) ... [2025-04-14 00:13:03,055 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:02" (1/1) ... [2025-04-14 00:13:03,056 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:02" (1/1) ... [2025-04-14 00:13:03,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:02" (1/1) ... [2025-04-14 00:13:03,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:02" (1/1) ... [2025-04-14 00:13:03,064 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:13:03,064 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:13:03,064 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:13:03,064 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:13:03,065 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:02" (1/1) ... [2025-04-14 00:13:03,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:13:03,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:13:03,094 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 00:13:03,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 00:13:03,111 INFO L130 BoogieDeclarations]: Found specification of procedure generate [2025-04-14 00:13:03,111 INFO L138 BoogieDeclarations]: Found implementation of procedure generate [2025-04-14 00:13:03,111 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 00:13:03,111 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 00:13:03,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:13:03,111 INFO L130 BoogieDeclarations]: Found specification of procedure dispose [2025-04-14 00:13:03,111 INFO L138 BoogieDeclarations]: Found implementation of procedure dispose [2025-04-14 00:13:03,111 INFO L130 BoogieDeclarations]: Found specification of procedure process [2025-04-14 00:13:03,111 INFO L138 BoogieDeclarations]: Found implementation of procedure process [2025-04-14 00:13:03,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:13:03,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:13:03,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-14 00:13:03,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:13:03,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:13:03,112 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:13:03,292 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:13:03,294 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:13:03,468 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:13:03,468 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:13:03,469 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:13:03,636 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:13:03,638 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:13:03,641 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:13:03,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:13:03 BoogieIcfgContainer [2025-04-14 00:13:03,641 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:13:03,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:13:03,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:13:03,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:13:03,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:13:02" (1/3) ... [2025-04-14 00:13:03,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26fe6061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:13:03, skipping insertion in model container [2025-04-14 00:13:03,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:02" (2/3) ... [2025-04-14 00:13:03,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26fe6061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:13:03, skipping insertion in model container [2025-04-14 00:13:03,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:13:03" (3/3) ... [2025-04-14 00:13:03,649 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_04-priv_multi_true.i [2025-04-14 00:13:03,658 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:13:03,659 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_04-priv_multi_true.i that has 4 procedures, 44 locations, 48 edges, 1 initial locations, 4 loop locations, and 2 error locations. [2025-04-14 00:13:03,659 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:13:03,699 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 00:13:03,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions, 114 flow [2025-04-14 00:13:03,749 INFO L116 PetriNetUnfolderBase]: 8/48 cut-off events. [2025-04-14 00:13:03,750 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:13:03,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 48 events. 8/48 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 107 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2025-04-14 00:13:03,753 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 51 transitions, 114 flow [2025-04-14 00:13:03,755 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 48 transitions, 105 flow [2025-04-14 00:13:03,759 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:13:03,768 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;@ee7fdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:13:03,768 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-14 00:13:03,779 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:13:03,780 INFO L116 PetriNetUnfolderBase]: 5/38 cut-off events. [2025-04-14 00:13:03,780 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:13:03,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:03,781 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:03,781 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:13:03,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:03,786 INFO L85 PathProgramCache]: Analyzing trace with hash -161190655, now seen corresponding path program 1 times [2025-04-14 00:13:03,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:03,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965008444] [2025-04-14 00:13:03,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:03,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:03,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 00:13:03,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 00:13:03,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:03,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:04,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:13:04,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:04,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965008444] [2025-04-14 00:13:04,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965008444] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:04,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:04,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:13:04,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316544116] [2025-04-14 00:13:04,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:04,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:13:04,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:04,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:13:04,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:13:04,339 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 51 [2025-04-14 00:13:04,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:13:04,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:04,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 51 [2025-04-14 00:13:04,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:06,167 INFO L116 PetriNetUnfolderBase]: 23790/32633 cut-off events. [2025-04-14 00:13:06,168 INFO L117 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-04-14 00:13:06,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63954 conditions, 32633 events. 23790/32633 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 186071 event pairs, 6719 based on Foata normal form. 0/27160 useless extension candidates. Maximal degree in co-relation 63943. Up to 18342 conditions per place. [2025-04-14 00:13:06,422 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 67 selfloop transitions, 6 changer transitions 0/79 dead transitions. [2025-04-14 00:13:06,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 79 transitions, 319 flow [2025-04-14 00:13:06,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:13:06,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:13:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-04-14 00:13:06,433 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7124183006535948 [2025-04-14 00:13:06,434 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 105 flow. Second operand 3 states and 109 transitions. [2025-04-14 00:13:06,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 79 transitions, 319 flow [2025-04-14 00:13:06,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 79 transitions, 314 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:13:06,443 INFO L231 Difference]: Finished difference. Result has 49 places, 49 transitions, 140 flow [2025-04-14 00:13:06,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=49, PETRI_TRANSITIONS=49} [2025-04-14 00:13:06,448 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2025-04-14 00:13:06,449 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 49 transitions, 140 flow [2025-04-14 00:13:06,449 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:13:06,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:06,449 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:06,449 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:13:06,449 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting disposeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:13:06,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:06,451 INFO L85 PathProgramCache]: Analyzing trace with hash -108786241, now seen corresponding path program 1 times [2025-04-14 00:13:06,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:06,452 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960495195] [2025-04-14 00:13:06,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:06,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:06,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 00:13:06,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 00:13:06,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:06,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:06,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:13:06,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:06,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960495195] [2025-04-14 00:13:06,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960495195] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:06,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:06,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:13:06,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615553787] [2025-04-14 00:13:06,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:06,647 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:13:06,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:06,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:13:06,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:13:06,648 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 51 [2025-04-14 00:13:06,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 49 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:13:06,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:06,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 51 [2025-04-14 00:13:06,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:09,583 INFO L116 PetriNetUnfolderBase]: 47849/66654 cut-off events. [2025-04-14 00:13:09,583 INFO L117 PetriNetUnfolderBase]: For 15383/15383 co-relation queries the response was YES. [2025-04-14 00:13:09,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144188 conditions, 66654 events. 47849/66654 cut-off events. For 15383/15383 co-relation queries the response was YES. Maximal size of possible extension queue 1489. Compared 416140 event pairs, 10014 based on Foata normal form. 0/59528 useless extension candidates. Maximal degree in co-relation 144176. Up to 28315 conditions per place. [2025-04-14 00:13:09,876 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 129 selfloop transitions, 8 changer transitions 0/143 dead transitions. [2025-04-14 00:13:09,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 143 transitions, 688 flow [2025-04-14 00:13:09,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:13:09,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:13:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2025-04-14 00:13:09,878 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6588235294117647 [2025-04-14 00:13:09,878 INFO L175 Difference]: Start difference. First operand has 49 places, 49 transitions, 140 flow. Second operand 5 states and 168 transitions. [2025-04-14 00:13:09,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 143 transitions, 688 flow [2025-04-14 00:13:09,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 143 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:13:09,934 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 204 flow [2025-04-14 00:13:09,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2025-04-14 00:13:09,934 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2025-04-14 00:13:09,934 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 204 flow [2025-04-14 00:13:09,935 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:13:09,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:09,935 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:09,935 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:13:09,935 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:13:09,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:09,935 INFO L85 PathProgramCache]: Analyzing trace with hash 538448995, now seen corresponding path program 1 times [2025-04-14 00:13:09,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:09,937 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185690075] [2025-04-14 00:13:09,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:09,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:09,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:13:09,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:13:09,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:09,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:10,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:13:10,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:10,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185690075] [2025-04-14 00:13:10,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185690075] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:10,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:10,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:13:10,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717926822] [2025-04-14 00:13:10,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:10,071 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:13:10,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:10,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:13:10,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:13:10,072 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 51 [2025-04-14 00:13:10,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:13:10,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:10,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 51 [2025-04-14 00:13:10,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:13,079 INFO L116 PetriNetUnfolderBase]: 44793/62599 cut-off events. [2025-04-14 00:13:13,079 INFO L117 PetriNetUnfolderBase]: For 31508/31508 co-relation queries the response was YES. [2025-04-14 00:13:13,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149465 conditions, 62599 events. 44793/62599 cut-off events. For 31508/31508 co-relation queries the response was YES. Maximal size of possible extension queue 1438. Compared 389757 event pairs, 7468 based on Foata normal form. 611/58065 useless extension candidates. Maximal degree in co-relation 149449. Up to 28157 conditions per place. [2025-04-14 00:13:13,339 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 114 selfloop transitions, 16 changer transitions 0/136 dead transitions. [2025-04-14 00:13:13,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 136 transitions, 696 flow [2025-04-14 00:13:13,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:13:13,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:13:13,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2025-04-14 00:13:13,341 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6431372549019608 [2025-04-14 00:13:13,341 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 204 flow. Second operand 5 states and 164 transitions. [2025-04-14 00:13:13,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 136 transitions, 696 flow [2025-04-14 00:13:13,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 136 transitions, 696 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:13:13,353 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 308 flow [2025-04-14 00:13:13,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=308, PETRI_PLACES=62, PETRI_TRANSITIONS=64} [2025-04-14 00:13:13,354 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2025-04-14 00:13:13,354 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 64 transitions, 308 flow [2025-04-14 00:13:13,354 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:13:13,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:13,354 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:13,354 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:13:13,354 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:13:13,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:13,355 INFO L85 PathProgramCache]: Analyzing trace with hash 182899084, now seen corresponding path program 1 times [2025-04-14 00:13:13,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:13,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363802859] [2025-04-14 00:13:13,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:13,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:13,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:13:13,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:13:13,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:13,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:13:13,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:13,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363802859] [2025-04-14 00:13:13,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363802859] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:13,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:13,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:13:13,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864255539] [2025-04-14 00:13:13,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:13,436 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:13:13,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:13,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:13:13,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:13:13,437 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 51 [2025-04-14 00:13:13,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 64 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:13:13,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:13,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 51 [2025-04-14 00:13:13,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:18,243 INFO L116 PetriNetUnfolderBase]: 70515/98959 cut-off events. [2025-04-14 00:13:18,244 INFO L117 PetriNetUnfolderBase]: For 87049/87049 co-relation queries the response was YES. [2025-04-14 00:13:18,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264802 conditions, 98959 events. 70515/98959 cut-off events. For 87049/87049 co-relation queries the response was YES. Maximal size of possible extension queue 2474. Compared 671353 event pairs, 15993 based on Foata normal form. 3914/95868 useless extension candidates. Maximal degree in co-relation 264781. Up to 57751 conditions per place. [2025-04-14 00:13:18,786 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 100 selfloop transitions, 11 changer transitions 0/117 dead transitions. [2025-04-14 00:13:18,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 117 transitions, 805 flow [2025-04-14 00:13:18,787 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:13:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:13:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2025-04-14 00:13:18,788 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6601307189542484 [2025-04-14 00:13:18,788 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 308 flow. Second operand 3 states and 101 transitions. [2025-04-14 00:13:18,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 117 transitions, 805 flow [2025-04-14 00:13:19,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 117 transitions, 805 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:13:19,123 INFO L231 Difference]: Finished difference. Result has 65 places, 72 transitions, 373 flow [2025-04-14 00:13:19,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=373, PETRI_PLACES=65, PETRI_TRANSITIONS=72} [2025-04-14 00:13:19,123 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2025-04-14 00:13:19,123 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 72 transitions, 373 flow [2025-04-14 00:13:19,124 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:13:19,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:19,124 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:19,124 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:13:19,125 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting disposeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:13:19,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:19,125 INFO L85 PathProgramCache]: Analyzing trace with hash 658400452, now seen corresponding path program 1 times [2025-04-14 00:13:19,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:19,125 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169446380] [2025-04-14 00:13:19,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:19,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:19,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:13:19,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:13:19,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:19,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:19,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:13:19,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:19,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169446380] [2025-04-14 00:13:19,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169446380] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:19,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:19,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:13:19,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820793666] [2025-04-14 00:13:19,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:19,247 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:13:19,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:19,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:13:19,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:13:19,247 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 51 [2025-04-14 00:13:19,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 72 transitions, 373 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:13:19,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:19,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 51 [2025-04-14 00:13:19,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:34,485 INFO L116 PetriNetUnfolderBase]: 191407/269099 cut-off events. [2025-04-14 00:13:34,486 INFO L117 PetriNetUnfolderBase]: For 330434/331764 co-relation queries the response was YES. [2025-04-14 00:13:35,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832529 conditions, 269099 events. 191407/269099 cut-off events. For 330434/331764 co-relation queries the response was YES. Maximal size of possible extension queue 5448. Compared 1980150 event pairs, 29612 based on Foata normal form. 14360/263309 useless extension candidates. Maximal degree in co-relation 832506. Up to 68392 conditions per place. [2025-04-14 00:13:36,125 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 409 selfloop transitions, 65 changer transitions 0/480 dead transitions. [2025-04-14 00:13:36,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 480 transitions, 3129 flow [2025-04-14 00:13:36,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 00:13:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 00:13:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 475 transitions. [2025-04-14 00:13:36,126 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7164404223227753 [2025-04-14 00:13:36,127 INFO L175 Difference]: Start difference. First operand has 65 places, 72 transitions, 373 flow. Second operand 13 states and 475 transitions. [2025-04-14 00:13:36,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 480 transitions, 3129 flow [2025-04-14 00:13:42,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 480 transitions, 3013 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:13:42,700 INFO L231 Difference]: Finished difference. Result has 88 places, 133 transitions, 1148 flow [2025-04-14 00:13:42,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1148, PETRI_PLACES=88, PETRI_TRANSITIONS=133} [2025-04-14 00:13:42,701 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 38 predicate places. [2025-04-14 00:13:42,701 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 133 transitions, 1148 flow [2025-04-14 00:13:42,701 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:13:42,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:42,701 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:42,701 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:13:42,701 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:13:42,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:42,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1815215005, now seen corresponding path program 1 times [2025-04-14 00:13:42,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:42,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010264475] [2025-04-14 00:13:42,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:42,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:42,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:13:42,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:13:42,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:42,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:42,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-14 00:13:42,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:42,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010264475] [2025-04-14 00:13:42,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010264475] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:42,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:42,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:13:42,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708439257] [2025-04-14 00:13:42,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:42,856 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:13:42,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:42,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:13:42,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:13:42,857 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 51 [2025-04-14 00:13:42,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 133 transitions, 1148 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:13:42,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:42,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 51 [2025-04-14 00:13:42,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:43,443 INFO L116 PetriNetUnfolderBase]: 7912/11842 cut-off events. [2025-04-14 00:13:43,443 INFO L117 PetriNetUnfolderBase]: For 38157/38349 co-relation queries the response was YES. [2025-04-14 00:13:43,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39526 conditions, 11842 events. 7912/11842 cut-off events. For 38157/38349 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 64989 event pairs, 1054 based on Foata normal form. 911/11174 useless extension candidates. Maximal degree in co-relation 39490. Up to 9867 conditions per place. [2025-04-14 00:13:43,474 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 0 selfloop transitions, 0 changer transitions 83/83 dead transitions. [2025-04-14 00:13:43,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 83 transitions, 670 flow [2025-04-14 00:13:43,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:13:43,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:13:43,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-04-14 00:13:43,475 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4215686274509804 [2025-04-14 00:13:43,475 INFO L175 Difference]: Start difference. First operand has 88 places, 133 transitions, 1148 flow. Second operand 4 states and 86 transitions. [2025-04-14 00:13:43,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 83 transitions, 670 flow [2025-04-14 00:13:43,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 598 flow, removed 24 selfloop flow, removed 9 redundant places. [2025-04-14 00:13:43,623 INFO L231 Difference]: Finished difference. Result has 71 places, 0 transitions, 0 flow [2025-04-14 00:13:43,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=71, PETRI_TRANSITIONS=0} [2025-04-14 00:13:43,624 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2025-04-14 00:13:43,624 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 0 transitions, 0 flow [2025-04-14 00:13:43,624 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:13:43,626 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-14 00:13:43,626 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-04-14 00:13:43,626 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-14 00:13:43,626 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-04-14 00:13:43,626 INFO L790 garLoopResultBuilder]: Registering result SAFE for location disposeErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-14 00:13:43,626 INFO L790 garLoopResultBuilder]: Registering result SAFE for location disposeErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-14 00:13:43,626 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:13:43,627 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-14 00:13:43,630 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:13:43,630 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:13:43,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:13:43 BasicIcfg [2025-04-14 00:13:43,633 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:13:43,633 INFO L158 Benchmark]: Toolchain (without parser) took 41162.73ms. Allocated memory was 142.6MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 100.2MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 4.1GB. Max. memory is 8.0GB. [2025-04-14 00:13:43,633 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:13:43,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.92ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 67.3MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-14 00:13:43,634 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.76ms. Allocated memory is still 142.6MB. Free memory was 67.3MB in the beginning and 64.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:13:43,634 INFO L158 Benchmark]: Boogie Preprocessor took 43.60ms. Allocated memory is still 142.6MB. Free memory was 64.5MB in the beginning and 61.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:13:43,634 INFO L158 Benchmark]: IcfgBuilder took 577.13ms. Allocated memory is still 142.6MB. Free memory was 61.5MB in the beginning and 86.3MB in the end (delta: -24.8MB). Peak memory consumption was 45.8MB. Max. memory is 8.0GB. [2025-04-14 00:13:43,634 INFO L158 Benchmark]: TraceAbstraction took 39990.22ms. Allocated memory was 142.6MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 85.6MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 4.1GB. Max. memory is 8.0GB. [2025-04-14 00:13:43,635 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 506.92ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 67.3MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.76ms. Allocated memory is still 142.6MB. Free memory was 67.3MB in the beginning and 64.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 43.60ms. Allocated memory is still 142.6MB. Free memory was 64.5MB in the beginning and 61.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 577.13ms. Allocated memory is still 142.6MB. Free memory was 61.5MB in the beginning and 86.3MB in the end (delta: -24.8MB). Peak memory consumption was 45.8MB. Max. memory is 8.0GB. * TraceAbstraction took 39990.22ms. Allocated memory was 142.6MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 85.6MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 4.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 74 locations, 84 edges, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 39.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 38.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 577 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 577 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 947 IncrementalHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 0 mSDtfsCounter, 947 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1148occurred in iteration=5, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 357 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-14 00:13:43,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...