/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:02:19,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:02:19,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 01:02:19,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:02:19,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:02:19,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:02:19,576 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:02:19,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:02:19,577 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:02:19,577 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:02:19,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:02:19,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:02:19,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:02:19,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:02:19,577 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:02:19,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:02:19,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:02:19,577 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:02:19,577 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:02:19,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:02:19,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:02:19,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:02:19,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:02:19,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:02:19,578 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:02:19,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:02:19,578 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:02:19,578 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:02:19,578 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:02:19,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:02:19,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:02:19,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:02:19,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:02:19,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:02:19,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:02:19,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:02:19,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:02:19,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:02:19,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:02:19,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:02:19,579 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:02:19,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:02:19,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:02:19,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:02:19,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:02:19,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:02:19,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:02:19,579 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:02:19,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:02:19,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:02:19,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:02:19,829 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:02:19,830 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:02:19,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c [2025-04-14 01:02:21,124 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ed3c8ab/a4f21a59f51b4bee9bf114a3f9497748/FLAG83e7762da [2025-04-14 01:02:21,351 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:02:21,351 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c [2025-04-14 01:02:21,362 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ed3c8ab/a4f21a59f51b4bee9bf114a3f9497748/FLAG83e7762da [2025-04-14 01:02:22,124 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ed3c8ab/a4f21a59f51b4bee9bf114a3f9497748 [2025-04-14 01:02:22,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:02:22,127 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:02:22,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:02:22,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:02:22,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:02:22,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:02:22" (1/1) ... [2025-04-14 01:02:22,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f5fee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:02:22, skipping insertion in model container [2025-04-14 01:02:22,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:02:22" (1/1) ... [2025-04-14 01:02:22,146 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:02:22,336 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c[5898,5911] [2025-04-14 01:02:22,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:02:22,357 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:02:22,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c[5898,5911] [2025-04-14 01:02:22,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:02:22,424 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:02:22,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:02:22 WrapperNode [2025-04-14 01:02:22,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:02:22,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:02:22,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:02:22,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:02:22,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:02:22" (1/1) ... [2025-04-14 01:02:22,439 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:02:22" (1/1) ... [2025-04-14 01:02:22,469 INFO L138 Inliner]: procedures = 25, calls = 73, calls flagged for inlining = 27, calls inlined = 33, statements flattened = 445 [2025-04-14 01:02:22,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:02:22,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:02:22,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:02:22,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:02:22,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:02:22" (1/1) ... [2025-04-14 01:02:22,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:02:22" (1/1) ... [2025-04-14 01:02:22,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:02:22" (1/1) ... [2025-04-14 01:02:22,497 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 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-04-14 01:02:22,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:02:22" (1/1) ... [2025-04-14 01:02:22,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:02:22" (1/1) ... [2025-04-14 01:02:22,510 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:02:22" (1/1) ... [2025-04-14 01:02:22,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:02:22" (1/1) ... [2025-04-14 01:02:22,513 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:02:22" (1/1) ... [2025-04-14 01:02:22,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:02:22" (1/1) ... [2025-04-14 01:02:22,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:02:22,519 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:02:22,519 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:02:22,519 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:02:22,520 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:02:22" (1/1) ... [2025-04-14 01:02:22,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:02:22,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:02:22,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 01:02:22,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 01:02:22,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:02:22,567 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:02:22,567 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:02:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:02:22,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:02:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 01:02:22,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 01:02:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-14 01:02:22,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-14 01:02:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:02:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:02:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:02:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:02:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 01:02:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 01:02:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 01:02:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:02:22,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:02:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:02:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:02:22,569 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:02:22,669 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:02:22,670 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:02:23,218 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:02:23,219 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:02:23,219 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:02:23,670 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:02:23,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:02:23 BoogieIcfgContainer [2025-04-14 01:02:23,670 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:02:23,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:02:23,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:02:23,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:02:23,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:02:22" (1/3) ... [2025-04-14 01:02:23,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769b78d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:02:23, skipping insertion in model container [2025-04-14 01:02:23,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:02:22" (2/3) ... [2025-04-14 01:02:23,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769b78d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:02:23, skipping insertion in model container [2025-04-14 01:02:23,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:02:23" (3/3) ... [2025-04-14 01:02:23,677 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-commit-2.wvr.c [2025-04-14 01:02:23,689 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:02:23,690 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-commit-2.wvr.c that has 5 procedures, 44 locations, 47 edges, 1 initial locations, 8 loop locations, and 1 error locations. [2025-04-14 01:02:23,691 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:02:23,770 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-14 01:02:23,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 51 transitions, 130 flow [2025-04-14 01:02:23,835 INFO L116 PetriNetUnfolderBase]: 8/47 cut-off events. [2025-04-14 01:02:23,836 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 01:02:23,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 47 events. 8/47 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2025-04-14 01:02:23,840 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 51 transitions, 130 flow [2025-04-14 01:02:23,842 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 46 transitions, 116 flow [2025-04-14 01:02:23,847 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:02:23,854 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;@2bf943b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:02:23,854 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-14 01:02:23,867 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:02:23,867 INFO L116 PetriNetUnfolderBase]: 8/45 cut-off events. [2025-04-14 01:02:23,868 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 01:02:23,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:02:23,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:02:23,869 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:02:23,872 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:02:23,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1848617289, now seen corresponding path program 1 times [2025-04-14 01:02:23,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:02:23,879 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652307211] [2025-04-14 01:02:23,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:02:23,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:02:23,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:02:24,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:02:24,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:02:24,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:24,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:02:24,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:02:24,273 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652307211] [2025-04-14 01:02:24,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652307211] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:02:24,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:02:24,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:02:24,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011731507] [2025-04-14 01:02:24,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:02:24,281 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:02:24,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:02:24,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:02:24,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:02:24,303 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 51 [2025-04-14 01:02:24,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:24,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:02:24,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 51 [2025-04-14 01:02:24,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:02:25,739 INFO L116 PetriNetUnfolderBase]: 12861/16210 cut-off events. [2025-04-14 01:02:25,740 INFO L117 PetriNetUnfolderBase]: For 779/779 co-relation queries the response was YES. [2025-04-14 01:02:25,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33227 conditions, 16210 events. 12861/16210 cut-off events. For 779/779 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 75944 event pairs, 2421 based on Foata normal form. 1/11946 useless extension candidates. Maximal degree in co-relation 31266. Up to 15097 conditions per place. [2025-04-14 01:02:25,844 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 60 selfloop transitions, 5 changer transitions 1/70 dead transitions. [2025-04-14 01:02:25,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 317 flow [2025-04-14 01:02:25,846 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:02:25,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:02:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-04-14 01:02:25,855 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5947712418300654 [2025-04-14 01:02:25,856 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 116 flow. Second operand 3 states and 91 transitions. [2025-04-14 01:02:25,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 317 flow [2025-04-14 01:02:25,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 287 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-14 01:02:25,874 INFO L231 Difference]: Finished difference. Result has 46 places, 50 transitions, 133 flow [2025-04-14 01:02:25,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=46, PETRI_TRANSITIONS=50} [2025-04-14 01:02:25,880 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2025-04-14 01:02:25,880 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 50 transitions, 133 flow [2025-04-14 01:02:25,880 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:25,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:02:25,880 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:02:25,881 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:02:25,881 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:02:25,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:02:25,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1824642981, now seen corresponding path program 1 times [2025-04-14 01:02:25,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:02:25,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107431043] [2025-04-14 01:02:25,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:02:25,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:02:25,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 01:02:25,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:02:25,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:02:25,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:26,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:02:26,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:02:26,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107431043] [2025-04-14 01:02:26,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107431043] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:02:26,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:02:26,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:02:26,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605595244] [2025-04-14 01:02:26,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:02:26,066 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:02:26,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:02:26,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:02:26,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:02:26,066 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 51 [2025-04-14 01:02:26,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 50 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:26,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:02:26,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 51 [2025-04-14 01:02:26,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:02:27,191 INFO L116 PetriNetUnfolderBase]: 13823/17663 cut-off events. [2025-04-14 01:02:27,191 INFO L117 PetriNetUnfolderBase]: For 2000/2000 co-relation queries the response was YES. [2025-04-14 01:02:27,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38410 conditions, 17663 events. 13823/17663 cut-off events. For 2000/2000 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 85413 event pairs, 3604 based on Foata normal form. 358/13441 useless extension candidates. Maximal degree in co-relation 17455. Up to 13098 conditions per place. [2025-04-14 01:02:27,257 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 69 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-04-14 01:02:27,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 75 transitions, 337 flow [2025-04-14 01:02:27,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:02:27,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:02:27,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-04-14 01:02:27,258 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2025-04-14 01:02:27,258 INFO L175 Difference]: Start difference. First operand has 46 places, 50 transitions, 133 flow. Second operand 3 states and 93 transitions. [2025-04-14 01:02:27,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 75 transitions, 337 flow [2025-04-14 01:02:27,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 75 transitions, 333 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:02:27,259 INFO L231 Difference]: Finished difference. Result has 48 places, 50 transitions, 136 flow [2025-04-14 01:02:27,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=48, PETRI_TRANSITIONS=50} [2025-04-14 01:02:27,260 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2025-04-14 01:02:27,260 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 50 transitions, 136 flow [2025-04-14 01:02:27,260 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:27,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:02:27,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:02:27,261 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:02:27,263 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:02:27,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:02:27,263 INFO L85 PathProgramCache]: Analyzing trace with hash 490542776, now seen corresponding path program 1 times [2025-04-14 01:02:27,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:02:27,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397477879] [2025-04-14 01:02:27,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:02:27,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:02:27,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 01:02:27,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:02:27,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:02:27,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:02:27,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:02:27,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397477879] [2025-04-14 01:02:27,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397477879] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:02:27,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:02:27,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:02:27,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175012368] [2025-04-14 01:02:27,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:02:27,377 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:02:27,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:02:27,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:02:27,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:02:27,378 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 51 [2025-04-14 01:02:27,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 50 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:27,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:02:27,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 51 [2025-04-14 01:02:27,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:02:28,486 INFO L116 PetriNetUnfolderBase]: 12766/16392 cut-off events. [2025-04-14 01:02:28,487 INFO L117 PetriNetUnfolderBase]: For 2805/2805 co-relation queries the response was YES. [2025-04-14 01:02:28,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36297 conditions, 16392 events. 12766/16392 cut-off events. For 2805/2805 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 78694 event pairs, 3029 based on Foata normal form. 284/12466 useless extension candidates. Maximal degree in co-relation 11164. Up to 13105 conditions per place. [2025-04-14 01:02:28,571 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 69 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-04-14 01:02:28,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 343 flow [2025-04-14 01:02:28,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:02:28,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:02:28,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2025-04-14 01:02:28,573 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6143790849673203 [2025-04-14 01:02:28,573 INFO L175 Difference]: Start difference. First operand has 48 places, 50 transitions, 136 flow. Second operand 3 states and 94 transitions. [2025-04-14 01:02:28,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 343 flow [2025-04-14 01:02:28,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 75 transitions, 341 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:02:28,575 INFO L231 Difference]: Finished difference. Result has 50 places, 50 transitions, 142 flow [2025-04-14 01:02:28,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=50, PETRI_TRANSITIONS=50} [2025-04-14 01:02:28,580 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2025-04-14 01:02:28,580 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 50 transitions, 142 flow [2025-04-14 01:02:28,580 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:28,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:02:28,580 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:02:28,580 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:02:28,580 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:02:28,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:02:28,581 INFO L85 PathProgramCache]: Analyzing trace with hash -924338839, now seen corresponding path program 1 times [2025-04-14 01:02:28,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:02:28,581 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704515421] [2025-04-14 01:02:28,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:02:28,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:02:28,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 01:02:28,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:02:28,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:02:28,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:28,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:02:28,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:02:28,693 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704515421] [2025-04-14 01:02:28,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704515421] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:02:28,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:02:28,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:02:28,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523529364] [2025-04-14 01:02:28,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:02:28,694 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:02:28,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:02:28,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:02:28,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:02:28,695 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 51 [2025-04-14 01:02:28,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 50 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:28,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:02:28,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 51 [2025-04-14 01:02:28,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:02:29,668 INFO L116 PetriNetUnfolderBase]: 14584/18705 cut-off events. [2025-04-14 01:02:29,668 INFO L117 PetriNetUnfolderBase]: For 4148/4148 co-relation queries the response was YES. [2025-04-14 01:02:29,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42390 conditions, 18705 events. 14584/18705 cut-off events. For 4148/4148 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 88943 event pairs, 3755 based on Foata normal form. 265/14352 useless extension candidates. Maximal degree in co-relation 13204. Up to 13184 conditions per place. [2025-04-14 01:02:29,732 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 65 selfloop transitions, 2 changer transitions 5/76 dead transitions. [2025-04-14 01:02:29,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 351 flow [2025-04-14 01:02:29,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:02:29,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:02:29,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-04-14 01:02:29,733 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6339869281045751 [2025-04-14 01:02:29,733 INFO L175 Difference]: Start difference. First operand has 50 places, 50 transitions, 142 flow. Second operand 3 states and 97 transitions. [2025-04-14 01:02:29,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 76 transitions, 351 flow [2025-04-14 01:02:29,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 76 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:02:29,735 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 148 flow [2025-04-14 01:02:29,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2025-04-14 01:02:29,736 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2025-04-14 01:02:29,736 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 148 flow [2025-04-14 01:02:29,736 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:29,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:02:29,736 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:02:29,736 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:02:29,736 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:02:29,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:02:29,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1759183594, now seen corresponding path program 1 times [2025-04-14 01:02:29,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:02:29,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043270619] [2025-04-14 01:02:29,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:02:29,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:02:29,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-14 01:02:29,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 01:02:29,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:02:29,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:29,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:02:29,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:02:29,839 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043270619] [2025-04-14 01:02:29,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043270619] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:02:29,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:02:29,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:02:29,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316481575] [2025-04-14 01:02:29,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:02:29,840 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:02:29,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:02:29,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:02:29,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:02:29,841 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 51 [2025-04-14 01:02:29,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:29,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:02:29,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 51 [2025-04-14 01:02:29,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:02:30,395 INFO L116 PetriNetUnfolderBase]: 7907/10223 cut-off events. [2025-04-14 01:02:30,396 INFO L117 PetriNetUnfolderBase]: For 3394/3394 co-relation queries the response was YES. [2025-04-14 01:02:30,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23786 conditions, 10223 events. 7907/10223 cut-off events. For 3394/3394 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 44841 event pairs, 3167 based on Foata normal form. 80/7766 useless extension candidates. Maximal degree in co-relation 3834. Up to 9339 conditions per place. [2025-04-14 01:02:30,434 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 52 selfloop transitions, 2 changer transitions 6/64 dead transitions. [2025-04-14 01:02:30,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 64 transitions, 300 flow [2025-04-14 01:02:30,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:02:30,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:02:30,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-04-14 01:02:30,436 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2025-04-14 01:02:30,436 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 148 flow. Second operand 3 states and 81 transitions. [2025-04-14 01:02:30,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 64 transitions, 300 flow [2025-04-14 01:02:30,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:02:30,438 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 158 flow [2025-04-14 01:02:30,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2025-04-14 01:02:30,439 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2025-04-14 01:02:30,439 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 158 flow [2025-04-14 01:02:30,439 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:30,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:02:30,439 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:02:30,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:02:30,439 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:02:30,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:02:30,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1028526866, now seen corresponding path program 1 times [2025-04-14 01:02:30,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:02:30,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045520694] [2025-04-14 01:02:30,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:02:30,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:02:30,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 01:02:30,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 01:02:30,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:02:30,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:30,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:02:30,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:02:30,604 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045520694] [2025-04-14 01:02:30,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045520694] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:02:30,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:02:30,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:02:30,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999163590] [2025-04-14 01:02:30,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:02:30,605 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:02:30,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:02:30,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:02:30,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:02:30,605 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 51 [2025-04-14 01:02:30,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:30,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:02:30,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 51 [2025-04-14 01:02:30,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:02:31,229 INFO L116 PetriNetUnfolderBase]: 8469/11113 cut-off events. [2025-04-14 01:02:31,229 INFO L117 PetriNetUnfolderBase]: For 3461/3461 co-relation queries the response was YES. [2025-04-14 01:02:31,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26101 conditions, 11113 events. 8469/11113 cut-off events. For 3461/3461 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 52213 event pairs, 6328 based on Foata normal form. 67/8318 useless extension candidates. Maximal degree in co-relation 5766. Up to 10184 conditions per place. [2025-04-14 01:02:31,262 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 46 selfloop transitions, 2 changer transitions 33/85 dead transitions. [2025-04-14 01:02:31,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 85 transitions, 396 flow [2025-04-14 01:02:31,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:02:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:02:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2025-04-14 01:02:31,264 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4588235294117647 [2025-04-14 01:02:31,264 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 158 flow. Second operand 5 states and 117 transitions. [2025-04-14 01:02:31,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 85 transitions, 396 flow [2025-04-14 01:02:31,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 85 transitions, 394 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:02:31,266 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 182 flow [2025-04-14 01:02:31,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2025-04-14 01:02:31,267 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2025-04-14 01:02:31,267 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 182 flow [2025-04-14 01:02:31,267 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:31,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:02:31,267 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:02:31,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 01:02:31,270 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:02:31,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:02:31,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1294913337, now seen corresponding path program 1 times [2025-04-14 01:02:31,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:02:31,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9309718] [2025-04-14 01:02:31,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:02:31,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:02:31,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-14 01:02:31,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 01:02:31,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:02:31,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:31,486 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-14 01:02:31,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:02:31,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9309718] [2025-04-14 01:02:31,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9309718] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:02:31,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:02:31,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:02:31,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88254542] [2025-04-14 01:02:31,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:02:31,487 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:02:31,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:02:31,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:02:31,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:02:31,488 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 51 [2025-04-14 01:02:31,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:31,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:02:31,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 51 [2025-04-14 01:02:31,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:02:32,253 INFO L116 PetriNetUnfolderBase]: 9134/12040 cut-off events. [2025-04-14 01:02:32,254 INFO L117 PetriNetUnfolderBase]: For 3894/3894 co-relation queries the response was YES. [2025-04-14 01:02:32,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28325 conditions, 12040 events. 9134/12040 cut-off events. For 3894/3894 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 57557 event pairs, 6865 based on Foata normal form. 50/9021 useless extension candidates. Maximal degree in co-relation 28302. Up to 10182 conditions per place. [2025-04-14 01:02:32,292 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 46 selfloop transitions, 3 changer transitions 35/88 dead transitions. [2025-04-14 01:02:32,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 88 transitions, 462 flow [2025-04-14 01:02:32,296 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:02:32,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:02:32,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-04-14 01:02:32,296 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5441176470588235 [2025-04-14 01:02:32,296 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 182 flow. Second operand 4 states and 111 transitions. [2025-04-14 01:02:32,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 88 transitions, 462 flow [2025-04-14 01:02:32,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 88 transitions, 430 flow, removed 15 selfloop flow, removed 3 redundant places. [2025-04-14 01:02:32,300 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 182 flow [2025-04-14 01:02:32,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2025-04-14 01:02:32,300 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2025-04-14 01:02:32,300 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 182 flow [2025-04-14 01:02:32,300 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:32,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:02:32,301 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:02:32,301 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:02:32,301 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:02:32,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:02:32,301 INFO L85 PathProgramCache]: Analyzing trace with hash 624620063, now seen corresponding path program 1 times [2025-04-14 01:02:32,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:02:32,301 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437093935] [2025-04-14 01:02:32,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:02:32,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:02:32,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-14 01:02:32,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 01:02:32,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:02:32,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:32,511 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-14 01:02:32,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:02:32,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437093935] [2025-04-14 01:02:32,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437093935] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:02:32,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:02:32,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:02:32,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403611671] [2025-04-14 01:02:32,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:02:32,512 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:02:32,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:02:32,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:02:32,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:02:32,513 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 51 [2025-04-14 01:02:32,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:32,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:02:32,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 51 [2025-04-14 01:02:32,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:02:33,414 INFO L116 PetriNetUnfolderBase]: 8659/11385 cut-off events. [2025-04-14 01:02:33,414 INFO L117 PetriNetUnfolderBase]: For 3567/3567 co-relation queries the response was YES. [2025-04-14 01:02:33,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26744 conditions, 11385 events. 8659/11385 cut-off events. For 3567/3567 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 53854 event pairs, 6523 based on Foata normal form. 18/8474 useless extension candidates. Maximal degree in co-relation 26714. Up to 10180 conditions per place. [2025-04-14 01:02:33,465 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 47 selfloop transitions, 3 changer transitions 25/79 dead transitions. [2025-04-14 01:02:33,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 79 transitions, 398 flow [2025-04-14 01:02:33,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:02:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:02:33,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-04-14 01:02:33,466 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4950980392156863 [2025-04-14 01:02:33,466 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 182 flow. Second operand 4 states and 101 transitions. [2025-04-14 01:02:33,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 79 transitions, 398 flow [2025-04-14 01:02:33,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 79 transitions, 388 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-14 01:02:33,469 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 190 flow [2025-04-14 01:02:33,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2025-04-14 01:02:33,469 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2025-04-14 01:02:33,469 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 190 flow [2025-04-14 01:02:33,470 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:33,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:02:33,470 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:02:33,470 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 01:02:33,470 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:02:33,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:02:33,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1796875880, now seen corresponding path program 1 times [2025-04-14 01:02:33,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:02:33,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944807338] [2025-04-14 01:02:33,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:02:33,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:02:33,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-14 01:02:33,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-14 01:02:33,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:02:33,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:02:33,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:02:33,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944807338] [2025-04-14 01:02:33,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944807338] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:02:33,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:02:33,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:02:33,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061839990] [2025-04-14 01:02:33,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:02:33,602 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:02:33,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:02:33,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:02:33,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:02:33,602 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 51 [2025-04-14 01:02:33,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:33,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:02:33,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 51 [2025-04-14 01:02:33,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:02:34,232 INFO L116 PetriNetUnfolderBase]: 8717/11473 cut-off events. [2025-04-14 01:02:34,232 INFO L117 PetriNetUnfolderBase]: For 3546/3546 co-relation queries the response was YES. [2025-04-14 01:02:34,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26940 conditions, 11473 events. 8717/11473 cut-off events. For 3546/3546 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 54379 event pairs, 6570 based on Foata normal form. 30/8554 useless extension candidates. Maximal degree in co-relation 26910. Up to 10178 conditions per place. [2025-04-14 01:02:34,272 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 43 selfloop transitions, 8 changer transitions 26/81 dead transitions. [2025-04-14 01:02:34,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 81 transitions, 420 flow [2025-04-14 01:02:34,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:02:34,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:02:34,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-04-14 01:02:34,273 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44313725490196076 [2025-04-14 01:02:34,273 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 190 flow. Second operand 5 states and 113 transitions. [2025-04-14 01:02:34,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 81 transitions, 420 flow [2025-04-14 01:02:34,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 81 transitions, 408 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-04-14 01:02:34,276 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 212 flow [2025-04-14 01:02:34,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2025-04-14 01:02:34,276 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2025-04-14 01:02:34,278 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 212 flow [2025-04-14 01:02:34,278 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:34,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:02:34,278 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:02:34,278 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 01:02:34,278 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:02:34,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:02:34,279 INFO L85 PathProgramCache]: Analyzing trace with hash 385854844, now seen corresponding path program 1 times [2025-04-14 01:02:34,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:02:34,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288134242] [2025-04-14 01:02:34,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:02:34,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:02:34,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 01:02:34,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 01:02:34,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:02:34,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:34,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:02:34,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:02:34,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288134242] [2025-04-14 01:02:34,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288134242] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:02:34,491 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540384051] [2025-04-14 01:02:34,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:02:34,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:02:34,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:02:34,494 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:02:34,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 01:02:34,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 01:02:34,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 01:02:34,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:02:34,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:34,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:02:34,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:02:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:02:34,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:02:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:02:34,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540384051] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:02:34,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:02:34,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-04-14 01:02:34,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342420506] [2025-04-14 01:02:34,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:02:34,843 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 01:02:34,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:02:34,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 01:02:34,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:02:34,844 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 51 [2025-04-14 01:02:34,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 212 flow. Second operand has 13 states, 13 states have (on average 13.846153846153847) internal successors, (180), 13 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:34,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:02:34,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 51 [2025-04-14 01:02:34,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:02:36,176 INFO L116 PetriNetUnfolderBase]: 12059/16337 cut-off events. [2025-04-14 01:02:36,176 INFO L117 PetriNetUnfolderBase]: For 5720/5720 co-relation queries the response was YES. [2025-04-14 01:02:36,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37869 conditions, 16337 events. 12059/16337 cut-off events. For 5720/5720 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 85540 event pairs, 4951 based on Foata normal form. 589/12622 useless extension candidates. Maximal degree in co-relation 32105. Up to 9339 conditions per place. [2025-04-14 01:02:36,229 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 53 selfloop transitions, 7 changer transitions 173/237 dead transitions. [2025-04-14 01:02:36,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 237 transitions, 1251 flow [2025-04-14 01:02:36,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 01:02:36,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-14 01:02:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 381 transitions. [2025-04-14 01:02:36,232 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3931888544891641 [2025-04-14 01:02:36,232 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 212 flow. Second operand 19 states and 381 transitions. [2025-04-14 01:02:36,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 237 transitions, 1251 flow [2025-04-14 01:02:36,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 237 transitions, 1199 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-04-14 01:02:36,237 INFO L231 Difference]: Finished difference. Result has 89 places, 57 transitions, 252 flow [2025-04-14 01:02:36,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=252, PETRI_PLACES=89, PETRI_TRANSITIONS=57} [2025-04-14 01:02:36,237 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 38 predicate places. [2025-04-14 01:02:36,237 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 57 transitions, 252 flow [2025-04-14 01:02:36,238 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.846153846153847) internal successors, (180), 13 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:36,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:02:36,238 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:02:36,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 01:02:36,438 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-14 01:02:36,439 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:02:36,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:02:36,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1263076653, now seen corresponding path program 2 times [2025-04-14 01:02:36,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:02:36,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182244083] [2025-04-14 01:02:36,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:02:36,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:02:36,459 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-14 01:02:36,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 42 statements. [2025-04-14 01:02:36,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:02:36,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:36,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-14 01:02:36,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:02:36,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182244083] [2025-04-14 01:02:36,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182244083] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:02:36,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:02:36,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:02:36,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707252824] [2025-04-14 01:02:36,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:02:36,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:02:36,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:02:36,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:02:36,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:02:36,543 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 51 [2025-04-14 01:02:36,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 57 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:36,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:02:36,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 51 [2025-04-14 01:02:36,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:02:38,123 INFO L116 PetriNetUnfolderBase]: 20193/26067 cut-off events. [2025-04-14 01:02:38,124 INFO L117 PetriNetUnfolderBase]: For 21691/21691 co-relation queries the response was YES. [2025-04-14 01:02:38,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70373 conditions, 26067 events. 20193/26067 cut-off events. For 21691/21691 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 124280 event pairs, 6604 based on Foata normal form. 654/20476 useless extension candidates. Maximal degree in co-relation 70330. Up to 9707 conditions per place. [2025-04-14 01:02:38,298 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 94 selfloop transitions, 12 changer transitions 0/110 dead transitions. [2025-04-14 01:02:38,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 110 transitions, 664 flow [2025-04-14 01:02:38,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:02:38,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:02:38,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2025-04-14 01:02:38,299 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6176470588235294 [2025-04-14 01:02:38,299 INFO L175 Difference]: Start difference. First operand has 89 places, 57 transitions, 252 flow. Second operand 4 states and 126 transitions. [2025-04-14 01:02:38,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 110 transitions, 664 flow [2025-04-14 01:02:38,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 110 transitions, 606 flow, removed 25 selfloop flow, removed 10 redundant places. [2025-04-14 01:02:38,336 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 312 flow [2025-04-14 01:02:38,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=312, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2025-04-14 01:02:38,336 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2025-04-14 01:02:38,336 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 312 flow [2025-04-14 01:02:38,337 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:38,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:02:38,337 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:02:38,337 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 01:02:38,337 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:02:38,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:02:38,337 INFO L85 PathProgramCache]: Analyzing trace with hash -650921795, now seen corresponding path program 1 times [2025-04-14 01:02:38,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:02:38,337 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247667817] [2025-04-14 01:02:38,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:02:38,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:02:38,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-14 01:02:38,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-14 01:02:38,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:02:38,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:38,545 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 01:02:38,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:02:38,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247667817] [2025-04-14 01:02:38,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247667817] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:02:38,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271505863] [2025-04-14 01:02:38,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:02:38,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:02:38,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:02:38,547 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:02:38,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 01:02:38,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-14 01:02:38,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-14 01:02:38,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:02:38,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:38,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:02:38,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:02:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-14 01:02:38,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:02:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-14 01:02:38,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271505863] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:02:38,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:02:38,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2025-04-14 01:02:38,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896601000] [2025-04-14 01:02:38,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:02:38,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 01:02:38,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:02:38,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 01:02:38,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-04-14 01:02:38,862 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 51 [2025-04-14 01:02:38,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 312 flow. Second operand has 15 states, 15 states have (on average 13.466666666666667) internal successors, (202), 15 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:38,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:02:38,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 51 [2025-04-14 01:02:38,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:02:43,094 INFO L116 PetriNetUnfolderBase]: 41905/55543 cut-off events. [2025-04-14 01:02:43,094 INFO L117 PetriNetUnfolderBase]: For 51896/51896 co-relation queries the response was YES. [2025-04-14 01:02:43,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158615 conditions, 55543 events. 41905/55543 cut-off events. For 51896/51896 co-relation queries the response was YES. Maximal size of possible extension queue 1451. Compared 302831 event pairs, 16507 based on Foata normal form. 1318/43894 useless extension candidates. Maximal degree in co-relation 150510. Up to 24897 conditions per place. [2025-04-14 01:02:43,441 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 145 selfloop transitions, 11 changer transitions 150/310 dead transitions. [2025-04-14 01:02:43,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 310 transitions, 1840 flow [2025-04-14 01:02:43,442 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-14 01:02:43,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-14 01:02:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 475 transitions. [2025-04-14 01:02:43,443 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2025-04-14 01:02:43,443 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 312 flow. Second operand 25 states and 475 transitions. [2025-04-14 01:02:43,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 310 transitions, 1840 flow [2025-04-14 01:02:43,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 310 transitions, 1778 flow, removed 31 selfloop flow, removed 0 redundant places. [2025-04-14 01:02:43,533 INFO L231 Difference]: Finished difference. Result has 112 places, 71 transitions, 415 flow [2025-04-14 01:02:43,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=415, PETRI_PLACES=112, PETRI_TRANSITIONS=71} [2025-04-14 01:02:43,534 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 61 predicate places. [2025-04-14 01:02:43,534 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 71 transitions, 415 flow [2025-04-14 01:02:43,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.466666666666667) internal successors, (202), 15 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:02:43,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:02:43,535 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:02:43,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 01:02:43,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-14 01:02:43,735 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:02:43,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:02:43,736 INFO L85 PathProgramCache]: Analyzing trace with hash -396808899, now seen corresponding path program 1 times [2025-04-14 01:02:43,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:02:43,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146673294] [2025-04-14 01:02:43,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:02:43,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:02:43,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-14 01:02:43,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-14 01:02:43,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:02:43,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:49,456 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:02:49,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:02:49,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146673294] [2025-04-14 01:02:49,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146673294] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:02:49,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286083242] [2025-04-14 01:02:49,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:02:49,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:02:49,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:02:49,459 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:02:49,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 01:02:49,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-14 01:02:49,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-14 01:02:49,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:02:49,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:49,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 111 conjuncts are in the unsatisfiable core [2025-04-14 01:02:49,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:02:49,816 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-14 01:02:49,892 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 23 treesize of output 1 [2025-04-14 01:02:49,971 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:02:49,971 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-14 01:02:50,044 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:02:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:02:51,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:03:31,145 INFO L325 Elim1Store]: treesize reduction 46, result has 89.4 percent of original size [2025-04-14 01:03:31,146 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 6383 treesize of output 6017 [2025-04-14 01:05:54,431 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-14 01:05:54,433 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-14 01:05:54,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-04-14 01:05:54,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 01:05:54,633 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:05:54,634 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2025-04-14 01:05:54,637 INFO L158 Benchmark]: Toolchain (without parser) took 212510.55ms. Allocated memory was 125.8MB in the beginning and 964.7MB in the end (delta: 838.9MB). Free memory was 87.0MB in the beginning and 829.8MB in the end (delta: -742.8MB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2025-04-14 01:05:54,638 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 159.4MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:05:54,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.68ms. Allocated memory is still 125.8MB. Free memory was 87.0MB in the beginning and 70.1MB in the end (delta: 16.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 01:05:54,638 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.69ms. Allocated memory is still 125.8MB. Free memory was 70.1MB in the beginning and 66.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:05:54,638 INFO L158 Benchmark]: Boogie Preprocessor took 48.53ms. Allocated memory is still 125.8MB. Free memory was 66.4MB in the beginning and 63.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:05:54,638 INFO L158 Benchmark]: IcfgBuilder took 1150.99ms. Allocated memory is still 125.8MB. Free memory was 63.3MB in the beginning and 35.7MB in the end (delta: 27.6MB). Peak memory consumption was 53.6MB. Max. memory is 8.0GB. [2025-04-14 01:05:54,638 INFO L158 Benchmark]: TraceAbstraction took 210965.05ms. Allocated memory was 125.8MB in the beginning and 964.7MB in the end (delta: 838.9MB). Free memory was 34.9MB in the beginning and 829.8MB in the end (delta: -794.9MB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2025-04-14 01:05:54,640 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.45ms. Allocated memory is still 159.4MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 296.68ms. Allocated memory is still 125.8MB. Free memory was 87.0MB in the beginning and 70.1MB in the end (delta: 16.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.69ms. Allocated memory is still 125.8MB. Free memory was 70.1MB in the beginning and 66.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.53ms. Allocated memory is still 125.8MB. Free memory was 66.4MB in the beginning and 63.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 1150.99ms. Allocated memory is still 125.8MB. Free memory was 63.3MB in the beginning and 35.7MB in the end (delta: 27.6MB). Peak memory consumption was 53.6MB. Max. memory is 8.0GB. * TraceAbstraction took 210965.05ms. Allocated memory was 125.8MB in the beginning and 964.7MB in the end (delta: 838.9MB). Free memory was 34.9MB in the beginning and 829.8MB in the end (delta: -794.9MB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...