/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/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:40:23,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:40:23,742 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:40:23,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:40:23,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:40:23,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:40:23,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:40:23,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:40:23,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:40:23,773 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:40:23,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:40:23,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:40:23,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:40:23,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:40:23,774 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:40:23,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:40:23,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:40:23,775 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:40:23,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:40:23,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:40:23,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:40:23,775 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:40:23,775 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:40:23,775 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:40:23,775 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:40:23,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:40:23,775 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:40:23,775 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:40:23,775 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:40:23,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:40:23,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:40:23,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:40:23,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:40:23,776 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:40:23,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:40:23,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:40:23,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:40:23,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:40:23,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:40:23,776 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:40:23,776 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:40:23,776 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:40:23,776 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:40:23,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:40:23,776 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:40:23,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:40:23,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:40:23,776 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:40:24,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:40:24,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:40:24,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:40:24,025 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:40:24,025 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:40:24,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-04-13 19:40:25,386 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9712b12f/4747172e80ac4848973be820a15b5be6/FLAG0484bd9d1 [2025-04-13 19:40:25,608 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:40:25,608 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-04-13 19:40:25,619 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9712b12f/4747172e80ac4848973be820a15b5be6/FLAG0484bd9d1 [2025-04-13 19:40:26,437 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9712b12f/4747172e80ac4848973be820a15b5be6 [2025-04-13 19:40:26,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:40:26,440 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:40:26,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:40:26,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:40:26,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:40:26,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:40:26" (1/1) ... [2025-04-13 19:40:26,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20450ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:26, skipping insertion in model container [2025-04-13 19:40:26,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:40:26" (1/1) ... [2025-04-13 19:40:26,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:40:26,629 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_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2025-04-13 19:40:26,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:40:26,782 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:40:26,802 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2025-04-13 19:40:26,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:40:26,846 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:40:26,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:26 WrapperNode [2025-04-13 19:40:26,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:40:26,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:40:26,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:40:26,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:40:26,852 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:40:26" (1/1) ... [2025-04-13 19:40:26,871 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:40:26" (1/1) ... [2025-04-13 19:40:26,891 INFO L138 Inliner]: procedures = 165, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 112 [2025-04-13 19:40:26,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:40:26,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:40:26,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:40:26,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:40:26,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:26" (1/1) ... [2025-04-13 19:40:26,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:26" (1/1) ... [2025-04-13 19:40:26,903 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:26" (1/1) ... [2025-04-13 19:40:26,916 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6]. The 3 writes are split as follows [0, 3]. [2025-04-13 19:40:26,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:26" (1/1) ... [2025-04-13 19:40:26,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:26" (1/1) ... [2025-04-13 19:40:26,921 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:26" (1/1) ... [2025-04-13 19:40:26,921 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:26" (1/1) ... [2025-04-13 19:40:26,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:26" (1/1) ... [2025-04-13 19:40:26,924 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:26" (1/1) ... [2025-04-13 19:40:26,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:26" (1/1) ... [2025-04-13 19:40:26,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:40:26,930 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:40:26,930 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:40:26,930 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:40:26,931 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:26" (1/1) ... [2025-04-13 19:40:26,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:40:26,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:40:26,958 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:40:26,963 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:40:26,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 19:40:26,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 19:40:26,981 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-04-13 19:40:26,981 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-04-13 19:40:26,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 19:40:26,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 19:40:26,982 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:40:26,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:40:26,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:40:26,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:40:26,982 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:40:26,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:40:26,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:40:26,983 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:40:27,082 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:40:27,083 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:40:27,251 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:40:27,252 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:40:27,252 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:40:27,440 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:40:27,446 WARN L179 LargeBlockEncoding]: Complex 3:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:40:27,452 INFO L313 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-13 19:40:27,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:40:27 BoogieIcfgContainer [2025-04-13 19:40:27,452 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:40:27,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:40:27,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:40:27,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:40:27,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:40:26" (1/3) ... [2025-04-13 19:40:27,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c790fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:40:27, skipping insertion in model container [2025-04-13 19:40:27,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:26" (2/3) ... [2025-04-13 19:40:27,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c790fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:40:27, skipping insertion in model container [2025-04-13 19:40:27,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:40:27" (3/3) ... [2025-04-13 19:40:27,460 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-04-13 19:40:27,471 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:40:27,472 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i that has 2 procedures, 19 locations, 24 edges, 1 initial locations, 3 loop locations, and 2 error locations. [2025-04-13 19:40:27,472 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:40:27,507 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:40:27,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 25 transitions, 54 flow [2025-04-13 19:40:27,554 INFO L116 PetriNetUnfolderBase]: 7/24 cut-off events. [2025-04-13 19:40:27,557 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:40:27,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 24 events. 7/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 32 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 22. Up to 3 conditions per place. [2025-04-13 19:40:27,560 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 25 transitions, 54 flow [2025-04-13 19:40:27,562 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 24 transitions, 51 flow [2025-04-13 19:40:27,569 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:40:27,580 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;@796f4b5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:40:27,580 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 19:40:27,586 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:40:27,586 INFO L116 PetriNetUnfolderBase]: 3/14 cut-off events. [2025-04-13 19:40:27,586 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:40:27,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:27,587 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:40:27,587 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 19:40:27,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:27,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1858367974, now seen corresponding path program 1 times [2025-04-13 19:40:27,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:27,597 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627313107] [2025-04-13 19:40:27,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:27,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:27,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:40:27,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:40:27,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:27,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:28,009 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:40:28,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:28,010 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627313107] [2025-04-13 19:40:28,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627313107] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:28,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:28,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:40:28,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21290324] [2025-04-13 19:40:28,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:28,017 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:40:28,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:28,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:40:28,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:40:28,038 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 19:40:28,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 24 transitions, 51 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:40:28,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:28,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 19:40:28,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:28,165 INFO L116 PetriNetUnfolderBase]: 68/125 cut-off events. [2025-04-13 19:40:28,165 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:40:28,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 125 events. 68/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 298 event pairs, 12 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 242. Up to 80 conditions per place. [2025-04-13 19:40:28,169 INFO L140 encePairwiseOnDemand]: 15/25 looper letters, 22 selfloop transitions, 6 changer transitions 3/32 dead transitions. [2025-04-13 19:40:28,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 32 transitions, 129 flow [2025-04-13 19:40:28,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:40:28,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:40:28,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2025-04-13 19:40:28,178 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.432 [2025-04-13 19:40:28,179 INFO L175 Difference]: Start difference. First operand has 21 places, 24 transitions, 51 flow. Second operand 5 states and 54 transitions. [2025-04-13 19:40:28,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 32 transitions, 129 flow [2025-04-13 19:40:28,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:40:28,183 INFO L231 Difference]: Finished difference. Result has 24 places, 21 transitions, 82 flow [2025-04-13 19:40:28,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=24, PETRI_TRANSITIONS=21} [2025-04-13 19:40:28,186 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2025-04-13 19:40:28,187 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 21 transitions, 82 flow [2025-04-13 19:40:28,187 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:40:28,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:28,187 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:28,187 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:40:28,187 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 19:40:28,187 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:28,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1464356273, now seen corresponding path program 1 times [2025-04-13 19:40:28,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:28,188 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770500739] [2025-04-13 19:40:28,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:28,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:28,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:40:28,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:40:28,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:28,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:28,498 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:40:28,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:28,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770500739] [2025-04-13 19:40:28,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770500739] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:28,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:28,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:40:28,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460819662] [2025-04-13 19:40:28,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:28,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:40:28,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:28,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:40:28,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:40:28,500 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 19:40:28,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 21 transitions, 82 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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:40:28,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:28,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 19:40:28,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:28,644 INFO L116 PetriNetUnfolderBase]: 81/150 cut-off events. [2025-04-13 19:40:28,644 INFO L117 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2025-04-13 19:40:28,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 150 events. 81/150 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 444 event pairs, 17 based on Foata normal form. 5/135 useless extension candidates. Maximal degree in co-relation 409. Up to 105 conditions per place. [2025-04-13 19:40:28,645 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 30 selfloop transitions, 7 changer transitions 0/38 dead transitions. [2025-04-13 19:40:28,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 38 transitions, 210 flow [2025-04-13 19:40:28,646 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:40:28,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:40:28,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2025-04-13 19:40:28,646 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32 [2025-04-13 19:40:28,646 INFO L175 Difference]: Start difference. First operand has 24 places, 21 transitions, 82 flow. Second operand 6 states and 48 transitions. [2025-04-13 19:40:28,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 38 transitions, 210 flow [2025-04-13 19:40:28,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 38 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:40:28,648 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 128 flow [2025-04-13 19:40:28,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2025-04-13 19:40:28,649 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 10 predicate places. [2025-04-13 19:40:28,649 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 128 flow [2025-04-13 19:40:28,649 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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:40:28,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:28,649 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:28,649 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:40:28,649 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 19:40:28,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:28,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1304179607, now seen corresponding path program 1 times [2025-04-13 19:40:28,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:28,650 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61464534] [2025-04-13 19:40:28,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:28,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:28,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:40:28,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:40:28,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:28,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:28,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:40:28,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:28,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61464534] [2025-04-13 19:40:28,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61464534] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:28,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:28,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:40:28,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856596153] [2025-04-13 19:40:28,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:28,856 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:40:28,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:28,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:40:28,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:40:28,857 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 19:40:28,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 128 flow. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:40:28,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:28,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 19:40:28,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:28,976 INFO L116 PetriNetUnfolderBase]: 81/162 cut-off events. [2025-04-13 19:40:28,976 INFO L117 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2025-04-13 19:40:28,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 162 events. 81/162 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 545 event pairs, 25 based on Foata normal form. 10/155 useless extension candidates. Maximal degree in co-relation 476. Up to 109 conditions per place. [2025-04-13 19:40:28,980 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 30 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2025-04-13 19:40:28,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 249 flow [2025-04-13 19:40:28,981 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:40:28,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:40:28,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2025-04-13 19:40:28,982 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32 [2025-04-13 19:40:28,982 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 128 flow. Second operand 6 states and 48 transitions. [2025-04-13 19:40:28,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 249 flow [2025-04-13 19:40:28,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 238 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 19:40:28,984 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 160 flow [2025-04-13 19:40:28,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2025-04-13 19:40:28,985 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2025-04-13 19:40:28,985 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 160 flow [2025-04-13 19:40:28,985 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:40:28,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:28,985 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:28,985 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:40:28,985 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 19:40:28,988 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:28,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1457869523, now seen corresponding path program 2 times [2025-04-13 19:40:28,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:28,988 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182486591] [2025-04-13 19:40:28,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:40:28,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:28,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:40:29,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:40:29,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:40:29,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:40:29,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:29,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182486591] [2025-04-13 19:40:29,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182486591] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:29,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:29,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:40:29,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789080575] [2025-04-13 19:40:29,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:29,178 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:40:29,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:29,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:40:29,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:40:29,178 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 19:40:29,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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:40:29,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:29,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 19:40:29,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:29,293 INFO L116 PetriNetUnfolderBase]: 91/190 cut-off events. [2025-04-13 19:40:29,293 INFO L117 PetriNetUnfolderBase]: For 402/402 co-relation queries the response was YES. [2025-04-13 19:40:29,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 190 events. 91/190 cut-off events. For 402/402 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 592 event pairs, 3 based on Foata normal form. 5/176 useless extension candidates. Maximal degree in co-relation 578. Up to 86 conditions per place. [2025-04-13 19:40:29,296 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 33 selfloop transitions, 10 changer transitions 0/44 dead transitions. [2025-04-13 19:40:29,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 298 flow [2025-04-13 19:40:29,296 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:40:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:40:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2025-04-13 19:40:29,297 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34 [2025-04-13 19:40:29,297 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 160 flow. Second operand 6 states and 51 transitions. [2025-04-13 19:40:29,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 298 flow [2025-04-13 19:40:29,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 280 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-04-13 19:40:29,300 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 180 flow [2025-04-13 19:40:29,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2025-04-13 19:40:29,303 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 18 predicate places. [2025-04-13 19:40:29,303 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 180 flow [2025-04-13 19:40:29,303 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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:40:29,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:29,303 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:29,303 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:40:29,303 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 19:40:29,304 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:29,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1179074983, now seen corresponding path program 1 times [2025-04-13 19:40:29,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:29,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054680778] [2025-04-13 19:40:29,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:29,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:29,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:40:29,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:40:29,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:29,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:40:29,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:29,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054680778] [2025-04-13 19:40:29,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054680778] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:29,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:29,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:40:29,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793355400] [2025-04-13 19:40:29,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:29,680 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:40:29,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:29,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:40:29,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:40:29,680 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 19:40:29,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 180 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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:40:29,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:29,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 19:40:29,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:29,771 INFO L116 PetriNetUnfolderBase]: 84/177 cut-off events. [2025-04-13 19:40:29,771 INFO L117 PetriNetUnfolderBase]: For 365/365 co-relation queries the response was YES. [2025-04-13 19:40:29,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 177 events. 84/177 cut-off events. For 365/365 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 547 event pairs, 32 based on Foata normal form. 2/161 useless extension candidates. Maximal degree in co-relation 545. Up to 141 conditions per place. [2025-04-13 19:40:29,773 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 24 selfloop transitions, 9 changer transitions 2/36 dead transitions. [2025-04-13 19:40:29,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 299 flow [2025-04-13 19:40:29,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:40:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:40:29,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2025-04-13 19:40:29,774 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.26666666666666666 [2025-04-13 19:40:29,774 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 180 flow. Second operand 6 states and 40 transitions. [2025-04-13 19:40:29,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 299 flow [2025-04-13 19:40:29,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 269 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-13 19:40:29,777 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 210 flow [2025-04-13 19:40:29,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2025-04-13 19:40:29,780 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2025-04-13 19:40:29,781 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 210 flow [2025-04-13 19:40:29,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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:40:29,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:29,781 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:29,781 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:40:29,782 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 19:40:29,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:29,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1540733529, now seen corresponding path program 2 times [2025-04-13 19:40:29,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:29,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458440726] [2025-04-13 19:40:29,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:40:29,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:29,792 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 19:40:29,798 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 14 statements. [2025-04-13 19:40:29,798 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:40:29,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:29,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 19:40:29,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:29,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458440726] [2025-04-13 19:40:29,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458440726] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:29,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:29,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:40:29,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343968792] [2025-04-13 19:40:29,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:29,950 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:40:29,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:29,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:40:29,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:40:29,950 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 19:40:29,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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:40:29,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:29,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 19:40:29,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:30,029 INFO L116 PetriNetUnfolderBase]: 95/197 cut-off events. [2025-04-13 19:40:30,029 INFO L117 PetriNetUnfolderBase]: For 370/370 co-relation queries the response was YES. [2025-04-13 19:40:30,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 197 events. 95/197 cut-off events. For 370/370 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 626 event pairs, 32 based on Foata normal form. 1/178 useless extension candidates. Maximal degree in co-relation 633. Up to 164 conditions per place. [2025-04-13 19:40:30,031 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 24 selfloop transitions, 11 changer transitions 2/38 dead transitions. [2025-04-13 19:40:30,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 38 transitions, 338 flow [2025-04-13 19:40:30,031 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:40:30,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:40:30,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2025-04-13 19:40:30,031 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.26666666666666666 [2025-04-13 19:40:30,031 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 210 flow. Second operand 6 states and 40 transitions. [2025-04-13 19:40:30,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 38 transitions, 338 flow [2025-04-13 19:40:30,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 322 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-13 19:40:30,036 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 264 flow [2025-04-13 19:40:30,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=264, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2025-04-13 19:40:30,037 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 26 predicate places. [2025-04-13 19:40:30,037 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 264 flow [2025-04-13 19:40:30,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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:40:30,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:30,038 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:30,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:40:30,038 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 19:40:30,038 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:30,038 INFO L85 PathProgramCache]: Analyzing trace with hash 101716741, now seen corresponding path program 3 times [2025-04-13 19:40:30,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:30,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843519789] [2025-04-13 19:40:30,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:40:30,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:30,052 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-13 19:40:30,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 9 of 14 statements. [2025-04-13 19:40:30,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:40:30,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:30,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 19:40:30,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:30,185 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843519789] [2025-04-13 19:40:30,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843519789] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:30,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:30,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:40:30,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590757757] [2025-04-13 19:40:30,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:30,185 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:40:30,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:30,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:40:30,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:40:30,186 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 19:40:30,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 264 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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:40:30,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:30,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 19:40:30,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:30,305 INFO L116 PetriNetUnfolderBase]: 86/183 cut-off events. [2025-04-13 19:40:30,305 INFO L117 PetriNetUnfolderBase]: For 360/360 co-relation queries the response was YES. [2025-04-13 19:40:30,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 183 events. 86/183 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 581 event pairs, 36 based on Foata normal form. 2/166 useless extension candidates. Maximal degree in co-relation 596. Up to 152 conditions per place. [2025-04-13 19:40:30,307 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 23 selfloop transitions, 12 changer transitions 4/40 dead transitions. [2025-04-13 19:40:30,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 40 transitions, 372 flow [2025-04-13 19:40:30,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:40:30,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:40:30,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2025-04-13 19:40:30,309 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.26285714285714284 [2025-04-13 19:40:30,309 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 264 flow. Second operand 7 states and 46 transitions. [2025-04-13 19:40:30,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 40 transitions, 372 flow [2025-04-13 19:40:30,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 40 transitions, 363 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:40:30,311 INFO L231 Difference]: Finished difference. Result has 53 places, 33 transitions, 279 flow [2025-04-13 19:40:30,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=279, PETRI_PLACES=53, PETRI_TRANSITIONS=33} [2025-04-13 19:40:30,313 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2025-04-13 19:40:30,313 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 33 transitions, 279 flow [2025-04-13 19:40:30,313 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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:40:30,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:30,313 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:30,313 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:40:30,313 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 19:40:30,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:30,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1091581079, now seen corresponding path program 4 times [2025-04-13 19:40:30,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:30,314 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275854461] [2025-04-13 19:40:30,314 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:40:30,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:30,322 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 19:40:30,325 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 11 of 14 statements. [2025-04-13 19:40:30,325 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 19:40:30,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:30,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 19:40:30,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:30,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275854461] [2025-04-13 19:40:30,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275854461] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:30,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:30,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:40:30,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813921083] [2025-04-13 19:40:30,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:30,433 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:40:30,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:30,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:40:30,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:40:30,434 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 19:40:30,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 33 transitions, 279 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:40:30,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:30,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 19:40:30,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:30,574 INFO L116 PetriNetUnfolderBase]: 148/308 cut-off events. [2025-04-13 19:40:30,574 INFO L117 PetriNetUnfolderBase]: For 772/772 co-relation queries the response was YES. [2025-04-13 19:40:30,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1087 conditions, 308 events. 148/308 cut-off events. For 772/772 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1142 event pairs, 2 based on Foata normal form. 5/275 useless extension candidates. Maximal degree in co-relation 1060. Up to 85 conditions per place. [2025-04-13 19:40:30,577 INFO L140 encePairwiseOnDemand]: 17/25 looper letters, 63 selfloop transitions, 24 changer transitions 5/93 dead transitions. [2025-04-13 19:40:30,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 93 transitions, 835 flow [2025-04-13 19:40:30,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:40:30,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:40:30,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2025-04-13 19:40:30,578 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2025-04-13 19:40:30,578 INFO L175 Difference]: Start difference. First operand has 53 places, 33 transitions, 279 flow. Second operand 7 states and 65 transitions. [2025-04-13 19:40:30,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 93 transitions, 835 flow [2025-04-13 19:40:30,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 93 transitions, 792 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-04-13 19:40:30,583 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 363 flow [2025-04-13 19:40:30,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=363, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2025-04-13 19:40:30,585 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2025-04-13 19:40:30,585 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 363 flow [2025-04-13 19:40:30,585 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:40:30,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:30,585 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:30,585 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:40:30,585 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 19:40:30,586 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:30,586 INFO L85 PathProgramCache]: Analyzing trace with hash 585234813, now seen corresponding path program 5 times [2025-04-13 19:40:30,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:30,586 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298077730] [2025-04-13 19:40:30,586 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:40:30,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:30,598 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 19:40:30,604 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:40:30,604 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:40:30,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:30,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:40:30,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:30,848 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298077730] [2025-04-13 19:40:30,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298077730] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:30,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:30,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:40:30,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540384051] [2025-04-13 19:40:30,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:30,848 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:40:30,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:30,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:40:30,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:40:30,849 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 19:40:30,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 363 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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:40:30,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:30,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 19:40:30,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:31,014 INFO L116 PetriNetUnfolderBase]: 312/631 cut-off events. [2025-04-13 19:40:31,014 INFO L117 PetriNetUnfolderBase]: For 1904/1904 co-relation queries the response was YES. [2025-04-13 19:40:31,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2465 conditions, 631 events. 312/631 cut-off events. For 1904/1904 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2875 event pairs, 30 based on Foata normal form. 13/611 useless extension candidates. Maximal degree in co-relation 2440. Up to 236 conditions per place. [2025-04-13 19:40:31,021 INFO L140 encePairwiseOnDemand]: 16/25 looper letters, 86 selfloop transitions, 26 changer transitions 7/120 dead transitions. [2025-04-13 19:40:31,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 120 transitions, 978 flow [2025-04-13 19:40:31,022 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:40:31,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:40:31,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2025-04-13 19:40:31,023 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36 [2025-04-13 19:40:31,023 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 363 flow. Second operand 8 states and 72 transitions. [2025-04-13 19:40:31,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 120 transitions, 978 flow [2025-04-13 19:40:31,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 120 transitions, 969 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 19:40:31,031 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 569 flow [2025-04-13 19:40:31,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=569, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2025-04-13 19:40:31,031 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 42 predicate places. [2025-04-13 19:40:31,032 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 569 flow [2025-04-13 19:40:31,032 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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:40:31,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:31,032 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:31,032 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:40:31,033 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 19:40:31,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:31,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1948037333, now seen corresponding path program 1 times [2025-04-13 19:40:31,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:31,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758003107] [2025-04-13 19:40:31,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:31,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:31,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:40:31,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:40:31,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:31,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:40:31,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:31,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758003107] [2025-04-13 19:40:31,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758003107] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:40:31,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833673461] [2025-04-13 19:40:31,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:31,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:40:31,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:40:31,175 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:40:31,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 19:40:31,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:40:31,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:40:31,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:31,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:31,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 19:40:31,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:40:31,295 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-13 19:40:31,363 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-13 19:40:31,436 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-13 19:40:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:40:31,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:40:31,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:40:31,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833673461] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:40:31,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:40:31,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-04-13 19:40:31,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688610393] [2025-04-13 19:40:31,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:40:31,615 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 19:40:31,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:31,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 19:40:31,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-04-13 19:40:31,616 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 19:40:31,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 569 flow. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 16 states have internal predecessors, (71), 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:40:31,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:31,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 19:40:31,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:32,049 INFO L116 PetriNetUnfolderBase]: 653/1401 cut-off events. [2025-04-13 19:40:32,049 INFO L117 PetriNetUnfolderBase]: For 13143/13143 co-relation queries the response was YES. [2025-04-13 19:40:32,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6253 conditions, 1401 events. 653/1401 cut-off events. For 13143/13143 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 7067 event pairs, 35 based on Foata normal form. 226/1627 useless extension candidates. Maximal degree in co-relation 6223. Up to 432 conditions per place. [2025-04-13 19:40:32,055 INFO L140 encePairwiseOnDemand]: 17/25 looper letters, 0 selfloop transitions, 0 changer transitions 210/210 dead transitions. [2025-04-13 19:40:32,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 210 transitions, 1916 flow [2025-04-13 19:40:32,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 19:40:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 19:40:32,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 117 transitions. [2025-04-13 19:40:32,058 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36 [2025-04-13 19:40:32,058 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 569 flow. Second operand 13 states and 117 transitions. [2025-04-13 19:40:32,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 210 transitions, 1916 flow [2025-04-13 19:40:32,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 210 transitions, 1850 flow, removed 24 selfloop flow, removed 3 redundant places. [2025-04-13 19:40:32,072 INFO L231 Difference]: Finished difference. Result has 71 places, 0 transitions, 0 flow [2025-04-13 19:40:32,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=71, PETRI_TRANSITIONS=0} [2025-04-13 19:40:32,073 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 50 predicate places. [2025-04-13 19:40:32,073 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 0 transitions, 0 flow [2025-04-13 19:40:32,073 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 16 states have internal predecessors, (71), 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:40:32,075 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 19:40:32,076 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 19:40:32,076 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 19:40:32,076 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 19:40:32,076 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 19:40:32,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 19:40:32,280 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 19:40:32,280 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1] [2025-04-13 19:40:32,284 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:40:32,284 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:40:32,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:40:32 BasicIcfg [2025-04-13 19:40:32,287 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:40:32,287 INFO L158 Benchmark]: Toolchain (without parser) took 5846.99ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 98.6MB in the beginning and 177.7MB in the end (delta: -79.1MB). Peak memory consumption was 99.0MB. Max. memory is 8.0GB. [2025-04-13 19:40:32,287 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:40:32,288 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.04ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 75.1MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 19:40:32,288 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.64ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 73.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:40:32,288 INFO L158 Benchmark]: Boogie Preprocessor took 37.45ms. Allocated memory is still 142.6MB. Free memory was 73.2MB in the beginning and 70.9MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:40:32,288 INFO L158 Benchmark]: RCFGBuilder took 522.04ms. Allocated memory is still 142.6MB. Free memory was 70.9MB in the beginning and 95.7MB in the end (delta: -24.9MB). Peak memory consumption was 53.0MB. Max. memory is 8.0GB. [2025-04-13 19:40:32,288 INFO L158 Benchmark]: TraceAbstraction took 4832.63ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 94.6MB in the beginning and 177.7MB in the end (delta: -83.0MB). Peak memory consumption was 92.1MB. Max. memory is 8.0GB. [2025-04-13 19:40:32,289 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.31ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 406.04ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 75.1MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.64ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 73.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 37.45ms. Allocated memory is still 142.6MB. Free memory was 73.2MB in the beginning and 70.9MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 522.04ms. Allocated memory is still 142.6MB. Free memory was 70.9MB in the beginning and 95.7MB in the end (delta: -24.9MB). Peak memory consumption was 53.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4832.63ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 94.6MB in the beginning and 177.7MB in the end (delta: -83.0MB). Peak memory consumption was 92.1MB. 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 3 procedures, 31 locations, 41 edges, 5 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: 4.8s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 261 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 261 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1125 IncrementalHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 0 mSDtfsCounter, 1125 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=569occurred in iteration=9, InterpolantAutomatonStates: 70, 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, 2.4s InterpolantComputationTime, 134 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 1274 SizeOfPredicates, 16 NumberOfNonLiveVariables, 171 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 12/21 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-13 19:40:32,299 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...