/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-bad-three-array-sum-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:01:07,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:01:07,438 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:01:07,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:01:07,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:01:07,464 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:01:07,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:01:07,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:01:07,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:01:07,465 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:01:07,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:01:07,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:01:07,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:01:07,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:01:07,467 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:01:07,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:01:07,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:01:07,467 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:01:07,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:01:07,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:01:07,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:01:07,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:01:07,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:01:07,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:01:07,468 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:01:07,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:01:07,468 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:01:07,468 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:01:07,468 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:01:07,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:01:07,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:01:07,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:01:07,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:01:07,469 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:01:07,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:01:07,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:01:07,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:01:07,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:01:07,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:01:07,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:01:07,469 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:01:07,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:01:07,469 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:01:07,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:01:07,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:01:07,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:01:07,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:01:07,470 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:01:07,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:01:07,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:01:07,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:01:07,708 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:01:07,708 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:01:07,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-04-14 01:01:09,025 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2045ccec/7695e7af804940e280e05681ddffe45e/FLAG88b372cf7 [2025-04-14 01:01:09,210 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:01:09,210 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-04-14 01:01:09,215 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2045ccec/7695e7af804940e280e05681ddffe45e/FLAG88b372cf7 [2025-04-14 01:01:10,025 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2045ccec/7695e7af804940e280e05681ddffe45e [2025-04-14 01:01:10,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:01:10,028 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:01:10,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:01:10,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:01:10,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:01:10,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:01:10" (1/1) ... [2025-04-14 01:01:10,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35d7760c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:10, skipping insertion in model container [2025-04-14 01:01:10,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:01:10" (1/1) ... [2025-04-14 01:01:10,044 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:01:10,215 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-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-04-14 01:01:10,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:01:10,239 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:01:10,270 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-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-04-14 01:01:10,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:01:10,290 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:01:10,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:10 WrapperNode [2025-04-14 01:01:10,291 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:01:10,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:01:10,292 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:01:10,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:01:10,296 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:01:10" (1/1) ... [2025-04-14 01:01:10,306 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:01:10" (1/1) ... [2025-04-14 01:01:10,331 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 247 [2025-04-14 01:01:10,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:01:10,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:01:10,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:01:10,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:01:10,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:10" (1/1) ... [2025-04-14 01:01:10,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:10" (1/1) ... [2025-04-14 01:01:10,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:10" (1/1) ... [2025-04-14 01:01:10,352 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 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:01:10,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:10" (1/1) ... [2025-04-14 01:01:10,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:10" (1/1) ... [2025-04-14 01:01:10,360 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:10" (1/1) ... [2025-04-14 01:01:10,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:10" (1/1) ... [2025-04-14 01:01:10,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:10" (1/1) ... [2025-04-14 01:01:10,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:10" (1/1) ... [2025-04-14 01:01:10,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:01:10,374 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:01:10,374 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:01:10,374 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:01:10,375 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:10" (1/1) ... [2025-04-14 01:01:10,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:01:10,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:01:10,398 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:01:10,400 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:01:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:01:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:01:10,416 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:01:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:01:10,416 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:01:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 01:01:10,416 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 01:01:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:01:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:01:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:01:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:01:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 01:01:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:01:10,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:01:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:01:10,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:01:10,417 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:01:10,500 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:01:10,501 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:01:10,839 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:01:10,839 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:01:10,840 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:01:11,165 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:01:11,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:01:11 BoogieIcfgContainer [2025-04-14 01:01:11,167 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:01:11,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:01:11,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:01:11,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:01:11,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:01:10" (1/3) ... [2025-04-14 01:01:11,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@318891f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:01:11, skipping insertion in model container [2025-04-14 01:01:11,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:10" (2/3) ... [2025-04-14 01:01:11,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@318891f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:01:11, skipping insertion in model container [2025-04-14 01:01:11,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:01:11" (3/3) ... [2025-04-14 01:01:11,174 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-04-14 01:01:11,185 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:01:11,186 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 25 locations, 27 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-14 01:01:11,186 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:01:11,225 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 01:01:11,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 30 transitions, 81 flow [2025-04-14 01:01:11,278 INFO L116 PetriNetUnfolderBase]: 6/27 cut-off events. [2025-04-14 01:01:11,279 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:01:11,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 6/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 16 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-14 01:01:11,281 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 30 transitions, 81 flow [2025-04-14 01:01:11,283 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 70 flow [2025-04-14 01:01:11,293 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:01:11,303 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;@6d9ffa6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:01:11,303 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 01:01:11,312 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:01:11,312 INFO L116 PetriNetUnfolderBase]: 6/25 cut-off events. [2025-04-14 01:01:11,312 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:01:11,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:11,314 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] [2025-04-14 01:01:11,314 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 1 more)] === [2025-04-14 01:01:11,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:11,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1612421560, now seen corresponding path program 1 times [2025-04-14 01:01:11,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:11,324 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555391309] [2025-04-14 01:01:11,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:11,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:11,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:01:11,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:01:11,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:11,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:12,005 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:01:12,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:12,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555391309] [2025-04-14 01:01:12,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555391309] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:01:12,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:01:12,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:01:12,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481671552] [2025-04-14 01:01:12,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:12,014 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:01:12,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:12,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:01:12,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:01:12,034 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:01:12,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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:01:12,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:12,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:01:12,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:12,242 INFO L116 PetriNetUnfolderBase]: 392/576 cut-off events. [2025-04-14 01:01:12,242 INFO L117 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-04-14 01:01:12,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 576 events. 392/576 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1775 event pairs, 124 based on Foata normal form. 1/421 useless extension candidates. Maximal degree in co-relation 1030. Up to 349 conditions per place. [2025-04-14 01:01:12,251 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 38 selfloop transitions, 10 changer transitions 1/49 dead transitions. [2025-04-14 01:01:12,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 49 transitions, 229 flow [2025-04-14 01:01:12,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:01:12,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:01:12,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-04-14 01:01:12,260 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-04-14 01:01:12,263 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 70 flow. Second operand 4 states and 62 transitions. [2025-04-14 01:01:12,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 49 transitions, 229 flow [2025-04-14 01:01:12,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 49 transitions, 207 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 01:01:12,272 INFO L231 Difference]: Finished difference. Result has 29 places, 35 transitions, 132 flow [2025-04-14 01:01:12,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=29, PETRI_TRANSITIONS=35} [2025-04-14 01:01:12,286 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2025-04-14 01:01:12,286 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 35 transitions, 132 flow [2025-04-14 01:01:12,286 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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:01:12,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:12,286 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] [2025-04-14 01:01:12,286 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:01:12,286 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 1 more)] === [2025-04-14 01:01:12,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:12,287 INFO L85 PathProgramCache]: Analyzing trace with hash 578245045, now seen corresponding path program 1 times [2025-04-14 01:01:12,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:12,287 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349084222] [2025-04-14 01:01:12,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:12,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:12,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 01:01:12,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:01:12,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:12,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:12,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:01:12,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:12,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349084222] [2025-04-14 01:01:12,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349084222] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:01:12,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:01:12,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:01:12,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099191950] [2025-04-14 01:01:12,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:12,432 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:01:12,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:12,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:01:12,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:01:12,433 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:01:12,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 35 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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:01:12,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:12,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:01:12,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:12,695 INFO L116 PetriNetUnfolderBase]: 725/1085 cut-off events. [2025-04-14 01:01:12,695 INFO L117 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2025-04-14 01:01:12,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2629 conditions, 1085 events. 725/1085 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3816 event pairs, 417 based on Foata normal form. 43/1126 useless extension candidates. Maximal degree in co-relation 1375. Up to 571 conditions per place. [2025-04-14 01:01:12,701 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 56 selfloop transitions, 12 changer transitions 0/68 dead transitions. [2025-04-14 01:01:12,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 68 transitions, 370 flow [2025-04-14 01:01:12,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:01:12,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:01:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2025-04-14 01:01:12,704 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2025-04-14 01:01:12,704 INFO L175 Difference]: Start difference. First operand has 29 places, 35 transitions, 132 flow. Second operand 6 states and 82 transitions. [2025-04-14 01:01:12,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 68 transitions, 370 flow [2025-04-14 01:01:12,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 68 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:01:12,706 INFO L231 Difference]: Finished difference. Result has 36 places, 39 transitions, 191 flow [2025-04-14 01:01:12,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=191, PETRI_PLACES=36, PETRI_TRANSITIONS=39} [2025-04-14 01:01:12,707 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2025-04-14 01:01:12,707 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 39 transitions, 191 flow [2025-04-14 01:01:12,707 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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:01:12,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:12,707 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] [2025-04-14 01:01:12,707 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:01:12,707 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 1 more)] === [2025-04-14 01:01:12,707 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:12,707 INFO L85 PathProgramCache]: Analyzing trace with hash 407177351, now seen corresponding path program 1 times [2025-04-14 01:01:12,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:12,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385022409] [2025-04-14 01:01:12,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:12,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:12,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 01:01:12,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:01:12,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:12,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:01:12,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:12,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385022409] [2025-04-14 01:01:12,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385022409] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:01:12,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:01:12,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:01:12,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141994403] [2025-04-14 01:01:12,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:12,811 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:01:12,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:12,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:01:12,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:01:12,812 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:01:12,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 39 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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:01:12,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:12,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:01:12,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:13,011 INFO L116 PetriNetUnfolderBase]: 640/977 cut-off events. [2025-04-14 01:01:13,011 INFO L117 PetriNetUnfolderBase]: For 402/402 co-relation queries the response was YES. [2025-04-14 01:01:13,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2527 conditions, 977 events. 640/977 cut-off events. For 402/402 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3485 event pairs, 391 based on Foata normal form. 42/1018 useless extension candidates. Maximal degree in co-relation 1436. Up to 571 conditions per place. [2025-04-14 01:01:13,018 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 54 selfloop transitions, 12 changer transitions 0/66 dead transitions. [2025-04-14 01:01:13,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 403 flow [2025-04-14 01:01:13,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:01:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:01:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2025-04-14 01:01:13,020 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-04-14 01:01:13,020 INFO L175 Difference]: Start difference. First operand has 36 places, 39 transitions, 191 flow. Second operand 6 states and 80 transitions. [2025-04-14 01:01:13,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 403 flow [2025-04-14 01:01:13,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 66 transitions, 391 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-14 01:01:13,023 INFO L231 Difference]: Finished difference. Result has 42 places, 41 transitions, 221 flow [2025-04-14 01:01:13,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=42, PETRI_TRANSITIONS=41} [2025-04-14 01:01:13,024 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2025-04-14 01:01:13,024 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 41 transitions, 221 flow [2025-04-14 01:01:13,024 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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:01:13,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:13,024 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] [2025-04-14 01:01:13,024 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:01:13,024 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 1 more)] === [2025-04-14 01:01:13,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:13,025 INFO L85 PathProgramCache]: Analyzing trace with hash -800764812, now seen corresponding path program 1 times [2025-04-14 01:01:13,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:13,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970024787] [2025-04-14 01:01:13,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:13,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:13,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 01:01:13,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:01:13,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:13,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:13,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:01:13,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:13,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970024787] [2025-04-14 01:01:13,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970024787] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:01:13,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:01:13,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:01:13,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147895593] [2025-04-14 01:01:13,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:13,146 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:01:13,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:13,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:01:13,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:01:13,147 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:01:13,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 221 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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:01:13,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:13,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:01:13,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:13,320 INFO L116 PetriNetUnfolderBase]: 515/793 cut-off events. [2025-04-14 01:01:13,320 INFO L117 PetriNetUnfolderBase]: For 641/641 co-relation queries the response was YES. [2025-04-14 01:01:13,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2300 conditions, 793 events. 515/793 cut-off events. For 641/641 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2658 event pairs, 324 based on Foata normal form. 27/819 useless extension candidates. Maximal degree in co-relation 1586. Up to 571 conditions per place. [2025-04-14 01:01:13,324 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 26 selfloop transitions, 6 changer transitions 28/60 dead transitions. [2025-04-14 01:01:13,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 403 flow [2025-04-14 01:01:13,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:01:13,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:01:13,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2025-04-14 01:01:13,325 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2025-04-14 01:01:13,325 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 221 flow. Second operand 6 states and 76 transitions. [2025-04-14 01:01:13,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 403 flow [2025-04-14 01:01:13,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 60 transitions, 385 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 01:01:13,329 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 160 flow [2025-04-14 01:01:13,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2025-04-14 01:01:13,330 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 16 predicate places. [2025-04-14 01:01:13,330 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 160 flow [2025-04-14 01:01:13,330 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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:01:13,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:13,330 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] [2025-04-14 01:01:13,330 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:01:13,330 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 1 more)] === [2025-04-14 01:01:13,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:13,331 INFO L85 PathProgramCache]: Analyzing trace with hash -2134215780, now seen corresponding path program 1 times [2025-04-14 01:01:13,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:13,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957986809] [2025-04-14 01:01:13,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:13,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:13,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 01:01:13,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:01:13,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:13,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:13,484 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:01:13,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:13,484 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957986809] [2025-04-14 01:01:13,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957986809] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:01:13,484 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647513853] [2025-04-14 01:01:13,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:13,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:13,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:01:13,488 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:01:13,489 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:01:13,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 01:01:13,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:01:13,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:13,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:13,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:01:13,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:01:13,644 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:01:13,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:01:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:01:13,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647513853] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:01:13,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:01:13,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-04-14 01:01:13,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3162509] [2025-04-14 01:01:13,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:13,704 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:01:13,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:13,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:01:13,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:01:13,704 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:01:13,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:13,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:13,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:01:13,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:13,829 INFO L116 PetriNetUnfolderBase]: 377/553 cut-off events. [2025-04-14 01:01:13,829 INFO L117 PetriNetUnfolderBase]: For 510/510 co-relation queries the response was YES. [2025-04-14 01:01:13,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1716 conditions, 553 events. 377/553 cut-off events. For 510/510 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1671 event pairs, 150 based on Foata normal form. 50/602 useless extension candidates. Maximal degree in co-relation 1662. Up to 385 conditions per place. [2025-04-14 01:01:13,832 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 40 selfloop transitions, 5 changer transitions 0/45 dead transitions. [2025-04-14 01:01:13,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 304 flow [2025-04-14 01:01:13,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:01:13,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:01:13,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2025-04-14 01:01:13,833 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36 [2025-04-14 01:01:13,833 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 160 flow. Second operand 5 states and 54 transitions. [2025-04-14 01:01:13,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 304 flow [2025-04-14 01:01:13,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 45 transitions, 240 flow, removed 20 selfloop flow, removed 10 redundant places. [2025-04-14 01:01:13,838 INFO L231 Difference]: Finished difference. Result has 33 places, 33 transitions, 133 flow [2025-04-14 01:01:13,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=33, PETRI_TRANSITIONS=33} [2025-04-14 01:01:13,839 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2025-04-14 01:01:13,839 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 133 flow [2025-04-14 01:01:13,839 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:13,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:13,840 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] [2025-04-14 01:01:13,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-14 01:01:14,040 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:14,040 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 1 more)] === [2025-04-14 01:01:14,041 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:14,041 INFO L85 PathProgramCache]: Analyzing trace with hash 2043553443, now seen corresponding path program 1 times [2025-04-14 01:01:14,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:14,041 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578233181] [2025-04-14 01:01:14,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:14,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:14,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 01:01:14,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:01:14,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:14,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:14,164 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:01:14,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:14,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578233181] [2025-04-14 01:01:14,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578233181] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:01:14,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274725819] [2025-04-14 01:01:14,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:14,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:14,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:01:14,166 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:01:14,168 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:01:14,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 01:01:14,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:01:14,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:14,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:14,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:01:14,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:01:14,298 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:01:14,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:01:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:01:14,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274725819] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:01:14,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:01:14,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-04-14 01:01:14,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946689401] [2025-04-14 01:01:14,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:14,337 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:01:14,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:14,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:01:14,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:01:14,337 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:01:14,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:14,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:14,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:01:14,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:14,425 INFO L116 PetriNetUnfolderBase]: 383/559 cut-off events. [2025-04-14 01:01:14,425 INFO L117 PetriNetUnfolderBase]: For 372/372 co-relation queries the response was YES. [2025-04-14 01:01:14,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1560 conditions, 559 events. 383/559 cut-off events. For 372/372 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1674 event pairs, 164 based on Foata normal form. 42/600 useless extension candidates. Maximal degree in co-relation 1517. Up to 418 conditions per place. [2025-04-14 01:01:14,429 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 43 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2025-04-14 01:01:14,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 48 transitions, 286 flow [2025-04-14 01:01:14,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:01:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:01:14,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2025-04-14 01:01:14,430 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2025-04-14 01:01:14,430 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 133 flow. Second operand 5 states and 55 transitions. [2025-04-14 01:01:14,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 48 transitions, 286 flow [2025-04-14 01:01:14,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 268 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-14 01:01:14,431 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 143 flow [2025-04-14 01:01:14,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=143, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2025-04-14 01:01:14,432 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2025-04-14 01:01:14,432 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 143 flow [2025-04-14 01:01:14,432 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:14,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:14,432 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] [2025-04-14 01:01:14,447 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:01:14,634 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,SelfDestructingSolverStorable5 [2025-04-14 01:01:14,634 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 1 more)] === [2025-04-14 01:01:14,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:14,635 INFO L85 PathProgramCache]: Analyzing trace with hash -482721768, now seen corresponding path program 1 times [2025-04-14 01:01:14,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:14,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015256817] [2025-04-14 01:01:14,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:14,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:14,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:01:14,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:01:14,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:14,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:01:14,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:14,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015256817] [2025-04-14 01:01:14,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015256817] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:01:14,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019140969] [2025-04-14 01:01:14,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:14,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:14,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:01:14,750 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:01:14,752 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:01:14,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:01:14,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:01:14,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:14,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:14,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:01:14,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:01:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:01:14,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:01:14,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:01:14,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019140969] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:01:14,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:01:14,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-04-14 01:01:14,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786963055] [2025-04-14 01:01:14,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:14,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:01:14,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:14,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:01:14,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:01:14,928 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:01:14,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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:01:14,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:14,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:01:14,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:15,022 INFO L116 PetriNetUnfolderBase]: 432/629 cut-off events. [2025-04-14 01:01:15,023 INFO L117 PetriNetUnfolderBase]: For 562/562 co-relation queries the response was YES. [2025-04-14 01:01:15,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1891 conditions, 629 events. 432/629 cut-off events. For 562/562 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1843 event pairs, 202 based on Foata normal form. 37/665 useless extension candidates. Maximal degree in co-relation 1847. Up to 502 conditions per place. [2025-04-14 01:01:15,027 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 43 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2025-04-14 01:01:15,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 302 flow [2025-04-14 01:01:15,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:01:15,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:01:15,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2025-04-14 01:01:15,028 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35333333333333333 [2025-04-14 01:01:15,028 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 143 flow. Second operand 5 states and 53 transitions. [2025-04-14 01:01:15,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 302 flow [2025-04-14 01:01:15,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 284 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-04-14 01:01:15,030 INFO L231 Difference]: Finished difference. Result has 38 places, 35 transitions, 153 flow [2025-04-14 01:01:15,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=38, PETRI_TRANSITIONS=35} [2025-04-14 01:01:15,031 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2025-04-14 01:01:15,031 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 35 transitions, 153 flow [2025-04-14 01:01:15,031 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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:01:15,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:15,031 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:01:15,037 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:01:15,231 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:15,232 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 1 more)] === [2025-04-14 01:01:15,232 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:15,232 INFO L85 PathProgramCache]: Analyzing trace with hash -515601043, now seen corresponding path program 1 times [2025-04-14 01:01:15,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:15,232 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177268003] [2025-04-14 01:01:15,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:15,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:15,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:01:15,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:01:15,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:15,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:01:16,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:16,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177268003] [2025-04-14 01:01:16,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177268003] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:01:16,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297903691] [2025-04-14 01:01:16,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:16,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:16,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:01:16,110 INFO L229 MonitoredProcess]: Starting monitored process 5 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:01:16,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 01:01:16,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:01:16,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:01:16,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:16,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:16,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-14 01:01:16,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:01:16,251 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:01:16,297 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:01:16,297 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:01:16,523 INFO L325 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2025-04-14 01:01:16,524 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-04-14 01:01:16,590 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-04-14 01:01:16,599 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:01:16,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:01:21,466 WARN L849 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.offset Int)) (let ((.cse0 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse1 (select (select |c_#memory_int#1| c_~B~0.base) (+ .cse0 ~B~0.offset))) (.cse2 (select (select |c_#memory_int#1| c_~A~0.base) (+ c_~A~0.offset .cse0)))) (= (+ (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) (+ .cse0 ~C~0.offset) (+ .cse1 .cse2))) c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork2_~i~1#1| 4) ~B~0.offset)) c_~asum~0 c_~bsum~0) (+ .cse1 .cse2 c_~csum~0))))) is different from false [2025-04-14 01:01:25,662 WARN L849 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int#1| c_~A~0.base) c_~A~0.offset)) (.cse1 (select (select |c_#memory_int#1| c_~B~0.base) ~B~0.offset))) (= (+ c_~csum~0 .cse0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) ~C~0.offset (+ .cse0 .cse1))) c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork2_~i~1#1| 4) ~B~0.offset)))))) is different from false [2025-04-14 01:01:26,687 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:01:26,688 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 52 treesize of output 40 [2025-04-14 01:01:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2025-04-14 01:01:28,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297903691] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:01:28,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:01:28,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 28 [2025-04-14 01:01:28,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761706862] [2025-04-14 01:01:28,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:01:28,812 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-14 01:01:28,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:28,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-14 01:01:28,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=638, Unknown=2, NotChecked=106, Total=870 [2025-04-14 01:01:28,813 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:01:28,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 153 flow. Second operand has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 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:01:28,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:28,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:01:28,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:41,089 INFO L116 PetriNetUnfolderBase]: 618/899 cut-off events. [2025-04-14 01:01:41,089 INFO L117 PetriNetUnfolderBase]: For 686/686 co-relation queries the response was YES. [2025-04-14 01:01:41,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2853 conditions, 899 events. 618/899 cut-off events. For 686/686 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3039 event pairs, 27 based on Foata normal form. 1/899 useless extension candidates. Maximal degree in co-relation 2808. Up to 659 conditions per place. [2025-04-14 01:01:41,093 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 65 selfloop transitions, 30 changer transitions 1/96 dead transitions. [2025-04-14 01:01:41,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 96 transitions, 579 flow [2025-04-14 01:01:41,094 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:01:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:01:41,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2025-04-14 01:01:41,094 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34102564102564104 [2025-04-14 01:01:41,094 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 153 flow. Second operand 13 states and 133 transitions. [2025-04-14 01:01:41,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 96 transitions, 579 flow [2025-04-14 01:01:41,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 96 transitions, 552 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-04-14 01:01:41,096 INFO L231 Difference]: Finished difference. Result has 51 places, 55 transitions, 334 flow [2025-04-14 01:01:41,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=334, PETRI_PLACES=51, PETRI_TRANSITIONS=55} [2025-04-14 01:01:41,097 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2025-04-14 01:01:41,097 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 55 transitions, 334 flow [2025-04-14 01:01:41,097 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 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:01:41,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:41,097 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:01:41,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-14 01:01:41,297 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:41,298 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 1 more)] === [2025-04-14 01:01:41,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:41,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2083270823, now seen corresponding path program 2 times [2025-04-14 01:01:41,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:41,298 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661476125] [2025-04-14 01:01:41,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:01:41,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:41,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:01:41,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:01:41,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:01:41,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:47,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:01:47,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:47,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661476125] [2025-04-14 01:01:47,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661476125] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:01:47,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688105555] [2025-04-14 01:01:47,355 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:01:47,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:47,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:01:47,357 INFO L229 MonitoredProcess]: Starting monitored process 6 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:01:47,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 01:01:47,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:01:47,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:01:47,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:01:47,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:47,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 01:01:47,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:01:51,642 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:01:51,642 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 20 [2025-04-14 01:01:51,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:01:51,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:01:53,286 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:01:53,287 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 95 [2025-04-14 01:01:55,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:01:55,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688105555] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:01:55,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:01:55,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 20 [2025-04-14 01:01:55,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604802774] [2025-04-14 01:01:55,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:01:55,824 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-14 01:01:55,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:55,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-14 01:01:55,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2025-04-14 01:01:55,825 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:01:55,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 55 transitions, 334 flow. Second operand has 22 states, 22 states have (on average 5.590909090909091) internal successors, (123), 22 states have internal predecessors, (123), 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:01:55,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:55,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:01:55,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:02:06,410 INFO L116 PetriNetUnfolderBase]: 720/1046 cut-off events. [2025-04-14 01:02:06,410 INFO L117 PetriNetUnfolderBase]: For 1414/1414 co-relation queries the response was YES. [2025-04-14 01:02:06,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3927 conditions, 1046 events. 720/1046 cut-off events. For 1414/1414 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3545 event pairs, 117 based on Foata normal form. 1/1047 useless extension candidates. Maximal degree in co-relation 3873. Up to 894 conditions per place. [2025-04-14 01:02:06,415 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 69 selfloop transitions, 35 changer transitions 1/105 dead transitions. [2025-04-14 01:02:06,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 105 transitions, 788 flow [2025-04-14 01:02:06,415 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:02:06,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:02:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 126 transitions. [2025-04-14 01:02:06,416 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28 [2025-04-14 01:02:06,416 INFO L175 Difference]: Start difference. First operand has 51 places, 55 transitions, 334 flow. Second operand 15 states and 126 transitions. [2025-04-14 01:02:06,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 105 transitions, 788 flow [2025-04-14 01:02:06,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 105 transitions, 723 flow, removed 19 selfloop flow, removed 2 redundant places. [2025-04-14 01:02:06,419 INFO L231 Difference]: Finished difference. Result has 69 places, 78 transitions, 552 flow [2025-04-14 01:02:06,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=552, PETRI_PLACES=69, PETRI_TRANSITIONS=78} [2025-04-14 01:02:06,420 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2025-04-14 01:02:06,420 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 78 transitions, 552 flow [2025-04-14 01:02:06,420 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.590909090909091) internal successors, (123), 22 states have internal predecessors, (123), 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:06,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:02:06,420 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:06,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 01:02:06,621 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:02:06,621 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 1 more)] === [2025-04-14 01:02:06,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:02:06,622 INFO L85 PathProgramCache]: Analyzing trace with hash 898339745, now seen corresponding path program 3 times [2025-04-14 01:02:06,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:02:06,622 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418205662] [2025-04-14 01:02:06,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:02:06,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:02:06,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:02:06,662 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:02:06,662 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:02:06,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:10,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:02:10,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:02:10,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418205662] [2025-04-14 01:02:10,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418205662] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:02:10,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277498910] [2025-04-14 01:02:10,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:02:10,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:02:10,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:02:10,146 INFO L229 MonitoredProcess]: Starting monitored process 7 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:10,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 01:02:10,197 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:02:10,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:02:10,222 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:02:10,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:10,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 01:02:10,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:02:13,607 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:02:13,608 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 20 [2025-04-14 01:02:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:02:13,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:02:15,589 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:02:15,589 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 87 [2025-04-14 01:02:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:02:18,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277498910] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:02:18,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:02:18,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 15 [2025-04-14 01:02:18,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922736573] [2025-04-14 01:02:18,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:02:18,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 01:02:18,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:02:18,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 01:02:18,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:02:18,513 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:02:18,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 78 transitions, 552 flow. Second operand has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 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:18,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:02:18,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:02:18,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:02:27,769 INFO L116 PetriNetUnfolderBase]: 841/1220 cut-off events. [2025-04-14 01:02:27,769 INFO L117 PetriNetUnfolderBase]: For 2542/2542 co-relation queries the response was YES. [2025-04-14 01:02:27,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5058 conditions, 1220 events. 841/1220 cut-off events. For 2542/2542 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4293 event pairs, 144 based on Foata normal form. 1/1221 useless extension candidates. Maximal degree in co-relation 4997. Up to 1045 conditions per place. [2025-04-14 01:02:27,775 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 89 selfloop transitions, 40 changer transitions 1/130 dead transitions. [2025-04-14 01:02:27,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 130 transitions, 1089 flow [2025-04-14 01:02:27,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:02:27,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:02:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2025-04-14 01:02:27,777 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37666666666666665 [2025-04-14 01:02:27,777 INFO L175 Difference]: Start difference. First operand has 69 places, 78 transitions, 552 flow. Second operand 10 states and 113 transitions. [2025-04-14 01:02:27,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 130 transitions, 1089 flow [2025-04-14 01:02:27,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 130 transitions, 1039 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-04-14 01:02:27,783 INFO L231 Difference]: Finished difference. Result has 78 places, 98 transitions, 811 flow [2025-04-14 01:02:27,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=811, PETRI_PLACES=78, PETRI_TRANSITIONS=98} [2025-04-14 01:02:27,783 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 48 predicate places. [2025-04-14 01:02:27,783 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 98 transitions, 811 flow [2025-04-14 01:02:27,783 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 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,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:02:27,784 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:27,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 01:02:27,984 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:02:27,984 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 1 more)] === [2025-04-14 01:02:27,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:02:27,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1323307823, now seen corresponding path program 4 times [2025-04-14 01:02:27,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:02:27,985 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568953421] [2025-04-14 01:02:27,985 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:02:27,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:02:27,996 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:02:28,013 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:02:28,013 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:02:28,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:33,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:02:33,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:02:33,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568953421] [2025-04-14 01:02:33,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568953421] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:02:33,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030036226] [2025-04-14 01:02:33,752 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:02:33,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:02:33,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:02:33,754 INFO L229 MonitoredProcess]: Starting monitored process 8 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:33,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 01:02:33,804 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:02:33,825 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:02:33,825 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:02:33,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:33,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:02:33,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:02:38,118 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:02:38,118 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 24 [2025-04-14 01:02:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:02:38,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:03:52,591 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:03:52,591 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 87 [2025-04-14 01:03:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:03:55,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030036226] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:03:55,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:03:55,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 23 [2025-04-14 01:03:55,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542497754] [2025-04-14 01:03:55,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:03:55,778 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 01:03:55,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:03:55,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 01:03:55,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=487, Unknown=16, NotChecked=0, Total=600 [2025-04-14 01:03:55,779 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:03:55,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 98 transitions, 811 flow. Second operand has 25 states, 25 states have (on average 5.72) internal successors, (143), 25 states have internal predecessors, (143), 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:03:55,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:03:55,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:03:55,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:04:11,296 INFO L116 PetriNetUnfolderBase]: 952/1380 cut-off events. [2025-04-14 01:04:11,297 INFO L117 PetriNetUnfolderBase]: For 4349/4349 co-relation queries the response was YES. [2025-04-14 01:04:11,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6235 conditions, 1380 events. 952/1380 cut-off events. For 4349/4349 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4956 event pairs, 214 based on Foata normal form. 1/1381 useless extension candidates. Maximal degree in co-relation 6174. Up to 1200 conditions per place. [2025-04-14 01:04:11,305 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 89 selfloop transitions, 54 changer transitions 1/144 dead transitions. [2025-04-14 01:04:11,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 144 transitions, 1388 flow [2025-04-14 01:04:11,306 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:04:11,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:04:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 121 transitions. [2025-04-14 01:04:11,307 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31025641025641026 [2025-04-14 01:04:11,307 INFO L175 Difference]: Start difference. First operand has 78 places, 98 transitions, 811 flow. Second operand 13 states and 121 transitions. [2025-04-14 01:04:11,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 144 transitions, 1388 flow [2025-04-14 01:04:11,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 144 transitions, 1310 flow, removed 22 selfloop flow, removed 3 redundant places. [2025-04-14 01:04:11,321 INFO L231 Difference]: Finished difference. Result has 93 places, 117 transitions, 1119 flow [2025-04-14 01:04:11,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1119, PETRI_PLACES=93, PETRI_TRANSITIONS=117} [2025-04-14 01:04:11,322 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 63 predicate places. [2025-04-14 01:04:11,322 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 117 transitions, 1119 flow [2025-04-14 01:04:11,323 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.72) internal successors, (143), 25 states have internal predecessors, (143), 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:04:11,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:04:11,323 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:04:11,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-14 01:04:11,523 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:04:11,523 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 1 more)] === [2025-04-14 01:04:11,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:04:11,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1796778681, now seen corresponding path program 5 times [2025-04-14 01:04:11,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:04:11,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149900649] [2025-04-14 01:04:11,524 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:04:11,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:04:11,531 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:04:11,557 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:04:11,557 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:04:11,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:04:14,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:04:14,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:04:14,658 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149900649] [2025-04-14 01:04:14,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149900649] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:04:14,658 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708591863] [2025-04-14 01:04:14,658 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:04:14,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:04:14,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:04:14,660 INFO L229 MonitoredProcess]: Starting monitored process 9 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:04:14,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-14 01:04:14,709 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:04:14,731 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:04:14,732 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:04:14,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:04:14,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 01:04:14,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:04:20,962 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:04:20,962 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 20 [2025-04-14 01:04:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:04:21,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:04:21,880 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:04:21,880 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 17 [2025-04-14 01:04:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:04:22,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708591863] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:04:22,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:04:22,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 6] total 21 [2025-04-14 01:04:22,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721114704] [2025-04-14 01:04:22,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:04:22,702 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 01:04:22,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:04:22,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 01:04:22,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2025-04-14 01:04:22,703 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:04:22,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 117 transitions, 1119 flow. Second operand has 23 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 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:04:22,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:04:22,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:04:22,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:04:36,759 INFO L116 PetriNetUnfolderBase]: 1093/1585 cut-off events. [2025-04-14 01:04:36,760 INFO L117 PetriNetUnfolderBase]: For 6776/6776 co-relation queries the response was YES. [2025-04-14 01:04:36,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7695 conditions, 1585 events. 1093/1585 cut-off events. For 6776/6776 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6030 event pairs, 83 based on Foata normal form. 1/1586 useless extension candidates. Maximal degree in co-relation 7622. Up to 1166 conditions per place. [2025-04-14 01:04:36,770 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 91 selfloop transitions, 78 changer transitions 1/170 dead transitions. [2025-04-14 01:04:36,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 170 transitions, 1730 flow [2025-04-14 01:04:36,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:04:36,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:04:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 139 transitions. [2025-04-14 01:04:36,771 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3564102564102564 [2025-04-14 01:04:36,771 INFO L175 Difference]: Start difference. First operand has 93 places, 117 transitions, 1119 flow. Second operand 13 states and 139 transitions. [2025-04-14 01:04:36,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 170 transitions, 1730 flow [2025-04-14 01:04:36,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 170 transitions, 1646 flow, removed 36 selfloop flow, removed 4 redundant places. [2025-04-14 01:04:36,787 INFO L231 Difference]: Finished difference. Result has 103 places, 127 transitions, 1355 flow [2025-04-14 01:04:36,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1355, PETRI_PLACES=103, PETRI_TRANSITIONS=127} [2025-04-14 01:04:36,787 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 73 predicate places. [2025-04-14 01:04:36,787 INFO L485 AbstractCegarLoop]: Abstraction has has 103 places, 127 transitions, 1355 flow [2025-04-14 01:04:36,788 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 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:04:36,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:04:36,788 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:04:36,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-14 01:04:36,988 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-14 01:04:36,988 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 1 more)] === [2025-04-14 01:04:36,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:04:36,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2020530969, now seen corresponding path program 6 times [2025-04-14 01:04:36,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:04:36,989 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367114663] [2025-04-14 01:04:36,989 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:04:36,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:04:36,995 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:04:37,009 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:04:37,010 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:04:37,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:04:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:04:42,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:04:42,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367114663] [2025-04-14 01:04:42,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367114663] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:04:42,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360624006] [2025-04-14 01:04:42,608 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:04:42,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:04:42,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:04:42,609 INFO L229 MonitoredProcess]: Starting monitored process 10 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:04:42,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-14 01:04:42,661 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:04:42,682 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:04:42,682 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:04:42,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:04:42,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 01:04:42,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:04:46,574 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:04:46,574 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 20 [2025-04-14 01:04:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:04:46,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:04:48,475 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:04:48,475 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 17 [2025-04-14 01:04:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:04:49,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360624006] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:04:49,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:04:49,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 20 [2025-04-14 01:04:49,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883652405] [2025-04-14 01:04:49,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:04:49,245 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-14 01:04:49,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:04:49,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-14 01:04:49,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2025-04-14 01:04:49,246 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:04:49,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 127 transitions, 1355 flow. Second operand has 22 states, 22 states have (on average 5.5) internal successors, (121), 22 states have internal predecessors, (121), 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:04:49,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:04:49,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:04:49,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:05:02,674 INFO L116 PetriNetUnfolderBase]: 1168/1694 cut-off events. [2025-04-14 01:05:02,674 INFO L117 PetriNetUnfolderBase]: For 8403/8403 co-relation queries the response was YES. [2025-04-14 01:05:02,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8720 conditions, 1694 events. 1168/1694 cut-off events. For 8403/8403 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6471 event pairs, 133 based on Foata normal form. 1/1695 useless extension candidates. Maximal degree in co-relation 8643. Up to 1390 conditions per place. [2025-04-14 01:05:02,685 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 102 selfloop transitions, 72 changer transitions 1/175 dead transitions. [2025-04-14 01:05:02,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 175 transitions, 1987 flow [2025-04-14 01:05:02,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:05:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:05:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 138 transitions. [2025-04-14 01:05:02,686 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30666666666666664 [2025-04-14 01:05:02,686 INFO L175 Difference]: Start difference. First operand has 103 places, 127 transitions, 1355 flow. Second operand 15 states and 138 transitions. [2025-04-14 01:05:02,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 175 transitions, 1987 flow [2025-04-14 01:05:02,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 175 transitions, 1791 flow, removed 54 selfloop flow, removed 8 redundant places. [2025-04-14 01:05:02,708 INFO L231 Difference]: Finished difference. Result has 113 places, 139 transitions, 1541 flow [2025-04-14 01:05:02,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1183, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1541, PETRI_PLACES=113, PETRI_TRANSITIONS=139} [2025-04-14 01:05:02,708 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 83 predicate places. [2025-04-14 01:05:02,709 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 139 transitions, 1541 flow [2025-04-14 01:05:02,709 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.5) internal successors, (121), 22 states have internal predecessors, (121), 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:05:02,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:05:02,709 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:05:02,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-14 01:05:02,909 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-14 01:05:02,909 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:05:02,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:05:02,910 INFO L85 PathProgramCache]: Analyzing trace with hash -862254623, now seen corresponding path program 7 times [2025-04-14 01:05:02,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:05:02,910 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964649676] [2025-04-14 01:05:02,910 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:05:02,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:05:02,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:05:02,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:05:02,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:05:02,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:05:07,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:05:07,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:05:07,336 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964649676] [2025-04-14 01:05:07,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964649676] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:05:07,336 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985889024] [2025-04-14 01:05:07,336 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:05:07,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:05:07,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:05:07,338 INFO L229 MonitoredProcess]: Starting monitored process 11 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:05:07,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-14 01:05:07,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:05:07,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:05:07,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:05:07,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:05:07,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 01:05:07,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:05:11,073 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:05:11,073 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 24 [2025-04-14 01:05:11,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:05:11,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:06:20,893 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:06:20,893 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 17 [2025-04-14 01:06:21,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:06:21,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985889024] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:06:21,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:06:21,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 6] total 22 [2025-04-14 01:06:21,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747614304] [2025-04-14 01:06:21,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:06:21,574 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-14 01:06:21,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:06:21,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-14 01:06:21,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=442, Unknown=15, NotChecked=0, Total=552 [2025-04-14 01:06:21,575 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:06:21,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 139 transitions, 1541 flow. Second operand has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 states have internal predecessors, (142), 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:06:21,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:06:21,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:06:21,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:06:34,834 INFO L116 PetriNetUnfolderBase]: 1218/1767 cut-off events. [2025-04-14 01:06:34,834 INFO L117 PetriNetUnfolderBase]: For 9176/9176 co-relation queries the response was YES. [2025-04-14 01:06:34,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9251 conditions, 1767 events. 1218/1767 cut-off events. For 9176/9176 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6830 event pairs, 139 based on Foata normal form. 1/1768 useless extension candidates. Maximal degree in co-relation 9169. Up to 1463 conditions per place. [2025-04-14 01:06:34,846 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 107 selfloop transitions, 74 changer transitions 1/182 dead transitions. [2025-04-14 01:06:34,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 182 transitions, 2098 flow [2025-04-14 01:06:34,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:06:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:06:34,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 134 transitions. [2025-04-14 01:06:34,848 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3435897435897436 [2025-04-14 01:06:34,848 INFO L175 Difference]: Start difference. First operand has 113 places, 139 transitions, 1541 flow. Second operand 13 states and 134 transitions. [2025-04-14 01:06:34,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 182 transitions, 2098 flow [2025-04-14 01:06:34,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 182 transitions, 1920 flow, removed 42 selfloop flow, removed 9 redundant places. [2025-04-14 01:06:34,867 INFO L231 Difference]: Finished difference. Result has 118 places, 144 transitions, 1611 flow [2025-04-14 01:06:34,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1363, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1611, PETRI_PLACES=118, PETRI_TRANSITIONS=144} [2025-04-14 01:06:34,868 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 88 predicate places. [2025-04-14 01:06:34,868 INFO L485 AbstractCegarLoop]: Abstraction has has 118 places, 144 transitions, 1611 flow [2025-04-14 01:06:34,868 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 states have internal predecessors, (142), 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:06:34,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:06:34,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:06:34,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-14 01:06:35,072 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-14 01:06:35,072 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:06:35,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:06:35,072 INFO L85 PathProgramCache]: Analyzing trace with hash 283753237, now seen corresponding path program 8 times [2025-04-14 01:06:35,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:06:35,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726181755] [2025-04-14 01:06:35,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:06:35,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:06:35,078 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:06:35,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:06:35,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:06:35,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:06:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:06:40,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:06:40,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726181755] [2025-04-14 01:06:40,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726181755] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:06:40,564 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639070263] [2025-04-14 01:06:40,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:06:40,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:06:40,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:06:40,565 INFO L229 MonitoredProcess]: Starting monitored process 12 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:06:40,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-14 01:06:40,618 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:06:40,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:06:40,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:06:40,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:06:40,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-04-14 01:06:40,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:06:41,181 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:06:41,992 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:06:41,992 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:06:44,574 INFO L325 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-04-14 01:06:44,575 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-04-14 01:06:46,983 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:06:46,983 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 94 [2025-04-14 01:06:47,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:06:47,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:06:54,332 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:06:54,332 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 52 treesize of output 40 [2025-04-14 01:06:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:06:56,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639070263] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:06:56,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:06:56,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 25 [2025-04-14 01:06:56,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347786687] [2025-04-14 01:06:56,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:06:56,819 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-14 01:06:56,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:06:56,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-14 01:06:56,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=596, Unknown=1, NotChecked=0, Total=702 [2025-04-14 01:06:56,819 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:06:56,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 144 transitions, 1611 flow. Second operand has 27 states, 27 states have (on average 5.074074074074074) internal successors, (137), 27 states have internal predecessors, (137), 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:06:56,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:06:56,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:06:56,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:07:08,814 INFO L116 PetriNetUnfolderBase]: 1340/1942 cut-off events. [2025-04-14 01:07:08,814 INFO L117 PetriNetUnfolderBase]: For 11526/11526 co-relation queries the response was YES. [2025-04-14 01:07:08,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10164 conditions, 1942 events. 1340/1942 cut-off events. For 11526/11526 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7720 event pairs, 145 based on Foata normal form. 1/1943 useless extension candidates. Maximal degree in co-relation 10080. Up to 1570 conditions per place. [2025-04-14 01:07:08,824 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 111 selfloop transitions, 78 changer transitions 1/190 dead transitions. [2025-04-14 01:07:08,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 190 transitions, 2260 flow [2025-04-14 01:07:08,824 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:07:08,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:07:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 139 transitions. [2025-04-14 01:07:08,825 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3088888888888889 [2025-04-14 01:07:08,825 INFO L175 Difference]: Start difference. First operand has 118 places, 144 transitions, 1611 flow. Second operand 15 states and 139 transitions. [2025-04-14 01:07:08,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 190 transitions, 2260 flow [2025-04-14 01:07:08,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 190 transitions, 2052 flow, removed 30 selfloop flow, removed 12 redundant places. [2025-04-14 01:07:08,843 INFO L231 Difference]: Finished difference. Result has 122 places, 154 transitions, 1745 flow [2025-04-14 01:07:08,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1403, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1745, PETRI_PLACES=122, PETRI_TRANSITIONS=154} [2025-04-14 01:07:08,843 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 92 predicate places. [2025-04-14 01:07:08,843 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 154 transitions, 1745 flow [2025-04-14 01:07:08,843 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.074074074074074) internal successors, (137), 27 states have internal predecessors, (137), 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:07:08,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:07:08,843 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:07:08,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-14 01:07:09,045 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-14 01:07:09,045 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:07:09,045 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:07:09,045 INFO L85 PathProgramCache]: Analyzing trace with hash 842668617, now seen corresponding path program 9 times [2025-04-14 01:07:09,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:07:09,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908939109] [2025-04-14 01:07:09,046 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:07:09,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:07:09,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:07:09,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:07:09,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:07:09,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:07:14,287 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:07:14,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:07:14,287 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908939109] [2025-04-14 01:07:14,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908939109] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:07:14,287 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602623745] [2025-04-14 01:07:14,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:07:14,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:07:14,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:07:14,289 INFO L229 MonitoredProcess]: Starting monitored process 13 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:07:14,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-14 01:07:14,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:07:14,365 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:07:14,365 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:07:14,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:07:14,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-04-14 01:07:14,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:07:15,029 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:07:15,831 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:07:15,831 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:07:18,821 INFO L325 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-04-14 01:07:18,821 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-04-14 01:07:20,527 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:07:20,527 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 96 [2025-04-14 01:07:21,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:07:21,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:07:35,724 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:07:35,725 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 52 treesize of output 40 [2025-04-14 01:07:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:07:38,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602623745] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:07:38,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:07:38,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 22 [2025-04-14 01:07:38,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885563461] [2025-04-14 01:07:38,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:07:38,145 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-14 01:07:38,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:07:38,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-14 01:07:38,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=468, Unknown=1, NotChecked=0, Total=552 [2025-04-14 01:07:38,146 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:07:38,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 154 transitions, 1745 flow. Second operand has 24 states, 24 states have (on average 5.25) internal successors, (126), 24 states have internal predecessors, (126), 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:07:38,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:07:38,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:07:38,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:07:49,666 INFO L116 PetriNetUnfolderBase]: 1414/2049 cut-off events. [2025-04-14 01:07:49,666 INFO L117 PetriNetUnfolderBase]: For 12927/12927 co-relation queries the response was YES. [2025-04-14 01:07:49,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10874 conditions, 2049 events. 1414/2049 cut-off events. For 12927/12927 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8257 event pairs, 172 based on Foata normal form. 1/2050 useless extension candidates. Maximal degree in co-relation 10790. Up to 1747 conditions per place. [2025-04-14 01:07:49,674 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 122 selfloop transitions, 72 changer transitions 1/195 dead transitions. [2025-04-14 01:07:49,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 195 transitions, 2361 flow [2025-04-14 01:07:49,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:07:49,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:07:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 131 transitions. [2025-04-14 01:07:49,675 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33589743589743587 [2025-04-14 01:07:49,675 INFO L175 Difference]: Start difference. First operand has 122 places, 154 transitions, 1745 flow. Second operand 13 states and 131 transitions. [2025-04-14 01:07:49,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 195 transitions, 2361 flow [2025-04-14 01:07:49,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 195 transitions, 2129 flow, removed 74 selfloop flow, removed 10 redundant places. [2025-04-14 01:07:49,702 INFO L231 Difference]: Finished difference. Result has 126 places, 160 transitions, 1800 flow [2025-04-14 01:07:49,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1543, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1800, PETRI_PLACES=126, PETRI_TRANSITIONS=160} [2025-04-14 01:07:49,703 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 96 predicate places. [2025-04-14 01:07:49,703 INFO L485 AbstractCegarLoop]: Abstraction has has 126 places, 160 transitions, 1800 flow [2025-04-14 01:07:49,703 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.25) internal successors, (126), 24 states have internal predecessors, (126), 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:07:49,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:07:49,703 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:07:49,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-14 01:07:49,903 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-14 01:07:49,904 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:07:49,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:07:49,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1083822309, now seen corresponding path program 10 times [2025-04-14 01:07:49,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:07:49,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038691736] [2025-04-14 01:07:49,904 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:07:49,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:07:49,910 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:07:49,918 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:07:49,918 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:07:49,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:07:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:07:54,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:07:54,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038691736] [2025-04-14 01:07:54,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038691736] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:07:54,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848942553] [2025-04-14 01:07:54,780 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:07:54,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:07:54,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:07:54,782 INFO L229 MonitoredProcess]: Starting monitored process 14 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:07:54,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-14 01:07:54,835 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:07:54,854 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:07:54,855 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:07:54,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:07:54,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 01:07:54,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:07:58,778 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:07:58,778 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 24 [2025-04-14 01:07:58,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:07:58,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:08:13,119 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:08:13,119 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 87 [2025-04-14 01:08:15,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:08:15,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848942553] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:08:15,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:08:15,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 23 [2025-04-14 01:08:15,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410038009] [2025-04-14 01:08:15,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:08:15,279 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 01:08:15,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:15,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 01:08:15,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=501, Unknown=2, NotChecked=0, Total=600 [2025-04-14 01:08:15,280 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:08:15,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 160 transitions, 1800 flow. Second operand has 25 states, 25 states have (on average 5.8) internal successors, (145), 25 states have internal predecessors, (145), 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:08:15,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:15,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:08:15,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:28,833 INFO L116 PetriNetUnfolderBase]: 1630/2361 cut-off events. [2025-04-14 01:08:28,833 INFO L117 PetriNetUnfolderBase]: For 16820/16820 co-relation queries the response was YES. [2025-04-14 01:08:28,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12967 conditions, 2361 events. 1630/2361 cut-off events. For 16820/16820 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9825 event pairs, 414 based on Foata normal form. 1/2362 useless extension candidates. Maximal degree in co-relation 12880. Up to 2060 conditions per place. [2025-04-14 01:08:28,847 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 156 selfloop transitions, 71 changer transitions 1/228 dead transitions. [2025-04-14 01:08:28,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 228 transitions, 2911 flow [2025-04-14 01:08:28,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:08:28,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:08:28,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 132 transitions. [2025-04-14 01:08:28,849 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3384615384615385 [2025-04-14 01:08:28,849 INFO L175 Difference]: Start difference. First operand has 126 places, 160 transitions, 1800 flow. Second operand 13 states and 132 transitions. [2025-04-14 01:08:28,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 228 transitions, 2911 flow [2025-04-14 01:08:28,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 228 transitions, 2671 flow, removed 30 selfloop flow, removed 10 redundant places. [2025-04-14 01:08:28,883 INFO L231 Difference]: Finished difference. Result has 132 places, 191 transitions, 2324 flow [2025-04-14 01:08:28,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2324, PETRI_PLACES=132, PETRI_TRANSITIONS=191} [2025-04-14 01:08:28,884 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 102 predicate places. [2025-04-14 01:08:28,884 INFO L485 AbstractCegarLoop]: Abstraction has has 132 places, 191 transitions, 2324 flow [2025-04-14 01:08:28,884 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.8) internal successors, (145), 25 states have internal predecessors, (145), 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:08:28,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:28,884 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:08:28,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-14 01:08:29,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-14 01:08:29,085 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:29,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:29,085 INFO L85 PathProgramCache]: Analyzing trace with hash -268147927, now seen corresponding path program 11 times [2025-04-14 01:08:29,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:29,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844815140] [2025-04-14 01:08:29,087 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:08:29,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:29,093 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:08:29,102 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:08:29,102 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:08:29,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:32,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:08:32,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:32,017 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844815140] [2025-04-14 01:08:32,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844815140] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:08:32,017 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607740719] [2025-04-14 01:08:32,017 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:08:32,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:08:32,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:08:32,020 INFO L229 MonitoredProcess]: Starting monitored process 15 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:08:32,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-14 01:08:32,073 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:08:32,094 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:08:32,094 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:08:32,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:32,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 01:08:32,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:08:38,281 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:08:38,281 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 20 [2025-04-14 01:08:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:08:38,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:08:39,764 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:08:39,764 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 87 [2025-04-14 01:08:41,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:08:41,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607740719] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:08:41,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:08:41,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 6] total 22 [2025-04-14 01:08:41,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194463015] [2025-04-14 01:08:41,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:08:41,814 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-14 01:08:41,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:41,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-14 01:08:41,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2025-04-14 01:08:41,815 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:08:41,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 191 transitions, 2324 flow. Second operand has 24 states, 24 states have (on average 5.708333333333333) internal successors, (137), 24 states have internal predecessors, (137), 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:08:41,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:41,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:08:41,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:56,239 INFO L116 PetriNetUnfolderBase]: 1799/2606 cut-off events. [2025-04-14 01:08:56,239 INFO L117 PetriNetUnfolderBase]: For 22544/22544 co-relation queries the response was YES. [2025-04-14 01:08:56,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14757 conditions, 2606 events. 1799/2606 cut-off events. For 22544/22544 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 11069 event pairs, 476 based on Foata normal form. 1/2607 useless extension candidates. Maximal degree in co-relation 14666. Up to 2356 conditions per place. [2025-04-14 01:08:56,251 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 183 selfloop transitions, 59 changer transitions 1/243 dead transitions. [2025-04-14 01:08:56,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 243 transitions, 3222 flow [2025-04-14 01:08:56,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:08:56,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:08:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2025-04-14 01:08:56,252 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34102564102564104 [2025-04-14 01:08:56,252 INFO L175 Difference]: Start difference. First operand has 132 places, 191 transitions, 2324 flow. Second operand 13 states and 133 transitions. [2025-04-14 01:08:56,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 243 transitions, 3222 flow [2025-04-14 01:08:56,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 243 transitions, 3025 flow, removed 88 selfloop flow, removed 5 redundant places. [2025-04-14 01:08:56,294 INFO L231 Difference]: Finished difference. Result has 143 places, 205 transitions, 2576 flow [2025-04-14 01:08:56,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2134, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2576, PETRI_PLACES=143, PETRI_TRANSITIONS=205} [2025-04-14 01:08:56,296 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 113 predicate places. [2025-04-14 01:08:56,296 INFO L485 AbstractCegarLoop]: Abstraction has has 143 places, 205 transitions, 2576 flow [2025-04-14 01:08:56,296 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.708333333333333) internal successors, (137), 24 states have internal predecessors, (137), 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:08:56,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:56,296 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:08:56,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-14 01:08:56,496 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:08:56,497 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:56,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:56,497 INFO L85 PathProgramCache]: Analyzing trace with hash -111737877, now seen corresponding path program 12 times [2025-04-14 01:08:56,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:56,497 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185300155] [2025-04-14 01:08:56,497 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:08:56,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:56,503 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:08:56,514 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:08:56,514 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:08:56,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:09:02,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:09:02,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:09:02,193 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185300155] [2025-04-14 01:09:02,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185300155] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:09:02,193 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101103605] [2025-04-14 01:09:02,193 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:09:02,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:09:02,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:09:02,195 INFO L229 MonitoredProcess]: Starting monitored process 16 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:09:02,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-14 01:09:02,252 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:09:02,274 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:09:02,274 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:09:02,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:09:02,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 01:09:02,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:09:06,595 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:09:06,596 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 20 [2025-04-14 01:09:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:09:06,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:09:08,611 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:09:08,611 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 87 [2025-04-14 01:09:10,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:09:10,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101103605] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:09:10,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:09:10,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 21 [2025-04-14 01:09:10,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902145847] [2025-04-14 01:09:10,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:09:10,804 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 01:09:10,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:09:10,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 01:09:10,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2025-04-14 01:09:10,804 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:09:10,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 205 transitions, 2576 flow. Second operand has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 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:09:10,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:09:10,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:09:10,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:09:24,749 INFO L116 PetriNetUnfolderBase]: 1940/2811 cut-off events. [2025-04-14 01:09:24,749 INFO L117 PetriNetUnfolderBase]: For 26359/26359 co-relation queries the response was YES. [2025-04-14 01:09:24,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16040 conditions, 2811 events. 1940/2811 cut-off events. For 26359/26359 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 12184 event pairs, 527 based on Foata normal form. 1/2812 useless extension candidates. Maximal degree in co-relation 15944. Up to 2536 conditions per place. [2025-04-14 01:09:24,768 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 193 selfloop transitions, 67 changer transitions 1/261 dead transitions. [2025-04-14 01:09:24,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 261 transitions, 3570 flow [2025-04-14 01:09:24,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:09:24,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:09:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 140 transitions. [2025-04-14 01:09:24,769 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3111111111111111 [2025-04-14 01:09:24,769 INFO L175 Difference]: Start difference. First operand has 143 places, 205 transitions, 2576 flow. Second operand 15 states and 140 transitions. [2025-04-14 01:09:24,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 261 transitions, 3570 flow [2025-04-14 01:09:24,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 261 transitions, 3330 flow, removed 108 selfloop flow, removed 5 redundant places. [2025-04-14 01:09:24,816 INFO L231 Difference]: Finished difference. Result has 155 places, 222 transitions, 2865 flow [2025-04-14 01:09:24,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2336, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2865, PETRI_PLACES=155, PETRI_TRANSITIONS=222} [2025-04-14 01:09:24,816 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 125 predicate places. [2025-04-14 01:09:24,817 INFO L485 AbstractCegarLoop]: Abstraction has has 155 places, 222 transitions, 2865 flow [2025-04-14 01:09:24,817 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 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:09:24,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:09:24,817 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:09:24,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-14 01:09:25,017 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:09:25,017 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:09:25,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:09:25,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2012233489, now seen corresponding path program 13 times [2025-04-14 01:09:25,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:09:25,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33935240] [2025-04-14 01:09:25,018 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:09:25,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:09:25,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:09:25,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:09:25,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:09:25,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:09:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:09:29,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:09:29,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33935240] [2025-04-14 01:09:29,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33935240] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:09:29,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929798697] [2025-04-14 01:09:29,993 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:09:29,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:09:29,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:09:29,995 INFO L229 MonitoredProcess]: Starting monitored process 17 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:09:29,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-14 01:09:30,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:09:30,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:09:30,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:09:30,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:09:30,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-14 01:09:30,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:09:30,545 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:09:31,167 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:09:31,168 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:09:34,983 INFO L325 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2025-04-14 01:09:34,984 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-04-14 01:09:35,929 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-04-14 01:09:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:09:36,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:09:40,597 WARN L849 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.offset Int)) (let ((.cse0 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse1 (select (select |c_#memory_int#1| c_~B~0.base) (+ .cse0 ~B~0.offset))) (.cse2 (select (select |c_#memory_int#1| c_~A~0.base) (+ c_~A~0.offset .cse0)))) (= (+ (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) (+ .cse0 ~C~0.offset) (+ .cse1 .cse2))) c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork2_~i~1#1| 4) ~B~0.offset)) c_~asum~0 c_~bsum~0) (+ .cse1 .cse2 c_~csum~0))))) is different from false [2025-04-14 01:09:44,672 WARN L849 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int#1| c_~A~0.base) c_~A~0.offset)) (.cse1 (select (select |c_#memory_int#1| c_~B~0.base) ~B~0.offset))) (= (+ c_~csum~0 .cse0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) ~C~0.offset (+ .cse0 .cse1))) c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork2_~i~1#1| 4) ~B~0.offset)))))) is different from false [2025-04-14 01:09:45,432 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:09:45,432 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 118 [2025-04-14 01:09:50,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2025-04-14 01:09:50,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929798697] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:09:50,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:09:50,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 28 [2025-04-14 01:09:50,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504818153] [2025-04-14 01:09:50,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:09:50,164 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-14 01:09:50,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:09:50,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-14 01:09:50,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=631, Unknown=2, NotChecked=106, Total=870 [2025-04-14 01:09:50,165 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:09:50,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 222 transitions, 2865 flow. Second operand has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 states have internal predecessors, (160), 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:09:50,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:09:50,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:09:50,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:10:02,771 INFO L116 PetriNetUnfolderBase]: 2014/2918 cut-off events. [2025-04-14 01:10:02,771 INFO L117 PetriNetUnfolderBase]: For 27539/27539 co-relation queries the response was YES. [2025-04-14 01:10:02,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16413 conditions, 2918 events. 2014/2918 cut-off events. For 27539/27539 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 12744 event pairs, 572 based on Foata normal form. 1/2919 useless extension candidates. Maximal degree in co-relation 16313. Up to 2723 conditions per place. [2025-04-14 01:10:02,824 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 197 selfloop transitions, 64 changer transitions 1/262 dead transitions. [2025-04-14 01:10:02,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 262 transitions, 3625 flow [2025-04-14 01:10:02,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:10:02,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:10:02,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 128 transitions. [2025-04-14 01:10:02,826 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3282051282051282 [2025-04-14 01:10:02,826 INFO L175 Difference]: Start difference. First operand has 155 places, 222 transitions, 2865 flow. Second operand 13 states and 128 transitions. [2025-04-14 01:10:02,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 262 transitions, 3625 flow [2025-04-14 01:10:02,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 262 transitions, 3341 flow, removed 113 selfloop flow, removed 9 redundant places. [2025-04-14 01:10:02,878 INFO L231 Difference]: Finished difference. Result has 161 places, 229 transitions, 2877 flow [2025-04-14 01:10:02,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2581, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2877, PETRI_PLACES=161, PETRI_TRANSITIONS=229} [2025-04-14 01:10:02,878 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 131 predicate places. [2025-04-14 01:10:02,878 INFO L485 AbstractCegarLoop]: Abstraction has has 161 places, 229 transitions, 2877 flow [2025-04-14 01:10:02,879 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 states have internal predecessors, (160), 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:10:02,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:10:02,879 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:10:02,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-14 01:10:03,079 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:10:03,079 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:10:03,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:10:03,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1615431147, now seen corresponding path program 14 times [2025-04-14 01:10:03,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:10:03,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402218847] [2025-04-14 01:10:03,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:10:03,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:10:03,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:10:03,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:10:03,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:10:03,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:10:06,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:10:06,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:10:06,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402218847] [2025-04-14 01:10:06,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402218847] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:10:06,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280038228] [2025-04-14 01:10:06,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:10:06,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:10:06,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:10:06,798 INFO L229 MonitoredProcess]: Starting monitored process 18 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:10:06,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-14 01:10:06,855 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:10:06,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:10:06,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:10:06,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:10:06,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 01:10:06,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:10:10,444 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:10:10,445 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 20 [2025-04-14 01:10:10,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:10:10,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:10:12,240 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:10:12,240 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 87 [2025-04-14 01:10:14,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:10:14,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280038228] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:10:14,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:10:14,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 15 [2025-04-14 01:10:14,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242261701] [2025-04-14 01:10:14,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:10:14,183 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 01:10:14,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:10:14,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 01:10:14,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:10:14,183 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:10:14,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 229 transitions, 2877 flow. Second operand has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 17 states have internal predecessors, (103), 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:10:14,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:10:14,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:10:14,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:10:22,607 INFO L116 PetriNetUnfolderBase]: 2099/3041 cut-off events. [2025-04-14 01:10:22,607 INFO L117 PetriNetUnfolderBase]: For 26645/26645 co-relation queries the response was YES. [2025-04-14 01:10:22,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16628 conditions, 3041 events. 2099/3041 cut-off events. For 26645/26645 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 13439 event pairs, 594 based on Foata normal form. 1/3042 useless extension candidates. Maximal degree in co-relation 16524. Up to 2854 conditions per place. [2025-04-14 01:10:22,623 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 216 selfloop transitions, 54 changer transitions 1/271 dead transitions. [2025-04-14 01:10:22,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 271 transitions, 3676 flow [2025-04-14 01:10:22,623 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:10:22,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:10:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2025-04-14 01:10:22,625 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2025-04-14 01:10:22,625 INFO L175 Difference]: Start difference. First operand has 161 places, 229 transitions, 2877 flow. Second operand 10 states and 115 transitions. [2025-04-14 01:10:22,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 271 transitions, 3676 flow [2025-04-14 01:10:22,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 271 transitions, 3466 flow, removed 46 selfloop flow, removed 9 redundant places. [2025-04-14 01:10:22,683 INFO L231 Difference]: Finished difference. Result has 164 places, 239 transitions, 2962 flow [2025-04-14 01:10:22,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2667, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2962, PETRI_PLACES=164, PETRI_TRANSITIONS=239} [2025-04-14 01:10:22,683 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 134 predicate places. [2025-04-14 01:10:22,683 INFO L485 AbstractCegarLoop]: Abstraction has has 164 places, 239 transitions, 2962 flow [2025-04-14 01:10:22,684 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 17 states have internal predecessors, (103), 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:10:22,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:10:22,684 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:10:22,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-14 01:10:22,884 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:10:22,884 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:10:22,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:10:22,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1738889139, now seen corresponding path program 15 times [2025-04-14 01:10:22,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:10:22,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317731817] [2025-04-14 01:10:22,885 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:10:22,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:10:22,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:10:22,901 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:10:22,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:10:22,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:10:28,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:10:28,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:10:28,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317731817] [2025-04-14 01:10:28,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317731817] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:10:28,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643878709] [2025-04-14 01:10:28,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:10:28,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:10:28,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:10:28,794 INFO L229 MonitoredProcess]: Starting monitored process 19 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:10:28,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-14 01:10:28,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:10:28,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:10:28,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:10:28,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:10:28,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 01:10:28,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:10:33,101 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:10:33,101 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 20 [2025-04-14 01:10:33,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:10:33,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:10:35,203 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:10:35,203 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 87 [2025-04-14 01:10:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:10:37,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643878709] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:10:37,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:10:37,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 20 [2025-04-14 01:10:37,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574556943] [2025-04-14 01:10:37,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:10:37,838 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-14 01:10:37,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:10:37,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-14 01:10:37,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2025-04-14 01:10:37,839 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:10:37,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 239 transitions, 2962 flow. Second operand has 22 states, 22 states have (on average 5.590909090909091) internal successors, (123), 22 states have internal predecessors, (123), 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:10:37,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:10:37,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:10:37,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:10:49,096 INFO L116 PetriNetUnfolderBase]: 2174/3150 cut-off events. [2025-04-14 01:10:49,096 INFO L117 PetriNetUnfolderBase]: For 30318/30318 co-relation queries the response was YES. [2025-04-14 01:10:49,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17243 conditions, 3150 events. 2174/3150 cut-off events. For 30318/30318 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 14023 event pairs, 624 based on Foata normal form. 1/3151 useless extension candidates. Maximal degree in co-relation 17141. Up to 2953 conditions per place. [2025-04-14 01:10:49,114 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 214 selfloop transitions, 64 changer transitions 1/279 dead transitions. [2025-04-14 01:10:49,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 279 transitions, 3749 flow [2025-04-14 01:10:49,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:10:49,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:10:49,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 135 transitions. [2025-04-14 01:10:49,116 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3 [2025-04-14 01:10:49,117 INFO L175 Difference]: Start difference. First operand has 164 places, 239 transitions, 2962 flow. Second operand 15 states and 135 transitions. [2025-04-14 01:10:49,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 279 transitions, 3749 flow [2025-04-14 01:10:49,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 279 transitions, 3549 flow, removed 51 selfloop flow, removed 6 redundant places. [2025-04-14 01:10:49,179 INFO L231 Difference]: Finished difference. Result has 174 places, 245 transitions, 3033 flow [2025-04-14 01:10:49,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2762, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3033, PETRI_PLACES=174, PETRI_TRANSITIONS=245} [2025-04-14 01:10:49,179 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 144 predicate places. [2025-04-14 01:10:49,179 INFO L485 AbstractCegarLoop]: Abstraction has has 174 places, 245 transitions, 3033 flow [2025-04-14 01:10:49,180 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.590909090909091) internal successors, (123), 22 states have internal predecessors, (123), 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:10:49,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:10:49,180 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:10:49,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-14 01:10:49,380 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:10:49,380 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:10:49,381 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:10:49,381 INFO L85 PathProgramCache]: Analyzing trace with hash -383797077, now seen corresponding path program 16 times [2025-04-14 01:10:49,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:10:49,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408676208] [2025-04-14 01:10:49,381 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:10:49,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:10:49,387 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:10:49,397 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:10:49,397 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:10:49,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:10:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:10:55,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:10:55,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408676208] [2025-04-14 01:10:55,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408676208] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:10:55,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475168730] [2025-04-14 01:10:55,190 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:10:55,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:10:55,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:10:55,192 INFO L229 MonitoredProcess]: Starting monitored process 20 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:10:55,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-14 01:10:55,254 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:10:55,277 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:10:55,277 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:10:55,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:10:55,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-14 01:10:55,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:10:55,339 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:10:56,167 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-14 01:10:56,167 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-14 01:10:56,844 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:10:56,844 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:11:01,308 INFO L325 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2025-04-14 01:11:01,308 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-04-14 01:11:01,929 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-04-14 01:11:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:11:02,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:11:06,713 WARN L849 $PredicateComparison]: unable to prove that (forall ((~A~0.offset Int) (~C~0.offset Int)) (let ((.cse0 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse1 (select (select |c_#memory_int#1| c_~A~0.base) (+ .cse0 ~A~0.offset))) (.cse2 (select (select |c_#memory_int#1| c_~B~0.base) (+ .cse0 c_~B~0.offset)))) (= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) (+ .cse0 ~C~0.offset) (+ .cse1 .cse2))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ .cse1 .cse2 c_~csum~0))))) is different from false [2025-04-14 01:11:10,809 WARN L849 $PredicateComparison]: unable to prove that (forall ((~A~0.offset Int) (~C~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int#1| c_~A~0.base) ~A~0.offset)) (.cse1 (select (select |c_#memory_int#1| c_~B~0.base) c_~B~0.offset))) (= (+ (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) ~C~0.offset (+ .cse0 .cse1))) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) c_~asum~0 c_~bsum~0) (+ .cse0 .cse1 c_~csum~0)))) is different from false [2025-04-14 01:11:11,548 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:11:11,548 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 118 [2025-04-14 01:11:17,496 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2025-04-14 01:11:17,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475168730] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:11:17,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:11:17,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2025-04-14 01:11:17,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243500772] [2025-04-14 01:11:17,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:11:17,497 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-14 01:11:17,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:11:17,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-14 01:11:17,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=741, Unknown=2, NotChecked=114, Total=992 [2025-04-14 01:11:17,498 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:11:17,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 245 transitions, 3033 flow. Second operand has 32 states, 32 states have (on average 5.0625) internal successors, (162), 32 states have internal predecessors, (162), 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:11:17,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:11:17,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:11:17,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:11:33,321 INFO L116 PetriNetUnfolderBase]: 2244/3251 cut-off events. [2025-04-14 01:11:33,321 INFO L117 PetriNetUnfolderBase]: For 34252/34252 co-relation queries the response was YES. [2025-04-14 01:11:33,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17939 conditions, 3251 events. 2244/3251 cut-off events. For 34252/34252 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 14543 event pairs, 661 based on Foata normal form. 1/3252 useless extension candidates. Maximal degree in co-relation 17830. Up to 3071 conditions per place. [2025-04-14 01:11:33,340 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 221 selfloop transitions, 59 changer transitions 1/281 dead transitions. [2025-04-14 01:11:33,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 281 transitions, 3877 flow [2025-04-14 01:11:33,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:11:33,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:11:33,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 125 transitions. [2025-04-14 01:11:33,341 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32051282051282054 [2025-04-14 01:11:33,342 INFO L175 Difference]: Start difference. First operand has 174 places, 245 transitions, 3033 flow. Second operand 13 states and 125 transitions. [2025-04-14 01:11:33,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 281 transitions, 3877 flow [2025-04-14 01:11:33,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 281 transitions, 3667 flow, removed 45 selfloop flow, removed 12 redundant places. [2025-04-14 01:11:33,406 INFO L231 Difference]: Finished difference. Result has 176 places, 251 transitions, 3145 flow [2025-04-14 01:11:33,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2823, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3145, PETRI_PLACES=176, PETRI_TRANSITIONS=251} [2025-04-14 01:11:33,407 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 146 predicate places. [2025-04-14 01:11:33,407 INFO L485 AbstractCegarLoop]: Abstraction has has 176 places, 251 transitions, 3145 flow [2025-04-14 01:11:33,407 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.0625) internal successors, (162), 32 states have internal predecessors, (162), 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:11:33,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:11:33,407 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:11:33,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-14 01:11:33,607 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:11:33,608 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:11:33,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:11:33,608 INFO L85 PathProgramCache]: Analyzing trace with hash 664685189, now seen corresponding path program 17 times [2025-04-14 01:11:33,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:11:33,608 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744700424] [2025-04-14 01:11:33,608 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:11:33,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:11:33,615 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:11:33,623 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:11:33,623 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:11:33,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:11:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:11:37,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:11:37,353 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744700424] [2025-04-14 01:11:37,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744700424] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:11:37,353 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551242336] [2025-04-14 01:11:37,353 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:11:37,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:11:37,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:11:37,355 INFO L229 MonitoredProcess]: Starting monitored process 21 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:11:37,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-14 01:11:37,417 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:11:37,438 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:11:37,439 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:11:37,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:11:37,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-14 01:11:37,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:11:44,671 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:11:44,672 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 20 [2025-04-14 01:11:44,809 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:11:44,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:11:46,394 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:11:46,394 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 95 [2025-04-14 01:11:49,540 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:11:49,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551242336] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:11:49,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:11:49,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 6] total 23 [2025-04-14 01:11:49,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553239190] [2025-04-14 01:11:49,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:11:49,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 01:11:49,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:11:49,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 01:11:49,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-04-14 01:11:49,541 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:11:49,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 251 transitions, 3145 flow. Second operand has 25 states, 25 states have (on average 5.64) internal successors, (141), 25 states have internal predecessors, (141), 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:11:49,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:11:49,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:11:49,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:12:01,635 INFO L116 PetriNetUnfolderBase]: 2329/3374 cut-off events. [2025-04-14 01:12:01,635 INFO L117 PetriNetUnfolderBase]: For 36710/36710 co-relation queries the response was YES. [2025-04-14 01:12:01,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18616 conditions, 3374 events. 2329/3374 cut-off events. For 36710/36710 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 15296 event pairs, 688 based on Foata normal form. 1/3375 useless extension candidates. Maximal degree in co-relation 18505. Up to 3213 conditions per place. [2025-04-14 01:12:01,655 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 229 selfloop transitions, 57 changer transitions 1/287 dead transitions. [2025-04-14 01:12:01,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 287 transitions, 3973 flow [2025-04-14 01:12:01,656 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:12:01,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:12:01,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 121 transitions. [2025-04-14 01:12:01,656 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31025641025641026 [2025-04-14 01:12:01,656 INFO L175 Difference]: Start difference. First operand has 176 places, 251 transitions, 3145 flow. Second operand 13 states and 121 transitions. [2025-04-14 01:12:01,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 287 transitions, 3973 flow [2025-04-14 01:12:01,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 287 transitions, 3734 flow, removed 82 selfloop flow, removed 9 redundant places. [2025-04-14 01:12:01,764 INFO L231 Difference]: Finished difference. Result has 183 places, 261 transitions, 3246 flow [2025-04-14 01:12:01,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2911, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3246, PETRI_PLACES=183, PETRI_TRANSITIONS=261} [2025-04-14 01:12:01,764 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 153 predicate places. [2025-04-14 01:12:01,764 INFO L485 AbstractCegarLoop]: Abstraction has has 183 places, 261 transitions, 3246 flow [2025-04-14 01:12:01,765 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.64) internal successors, (141), 25 states have internal predecessors, (141), 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:12:01,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:12:01,765 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:12:01,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-14 01:12:01,965 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-14 01:12:01,965 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:12:01,966 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:12:01,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1058092087, now seen corresponding path program 18 times [2025-04-14 01:12:01,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:12:01,966 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988111135] [2025-04-14 01:12:01,966 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:12:01,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:12:01,972 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:12:01,985 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:12:01,985 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:12:01,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:08,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:12:08,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:12:08,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988111135] [2025-04-14 01:12:08,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988111135] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:12:08,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850922108] [2025-04-14 01:12:08,333 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:12:08,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:12:08,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:12:08,335 INFO L229 MonitoredProcess]: Starting monitored process 22 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:12:08,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-14 01:12:08,401 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:12:08,423 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:12:08,423 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:12:08,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:08,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 01:12:08,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:12:12,980 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:12:12,980 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 20 [2025-04-14 01:12:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:12:13,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:12:14,769 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:12:14,770 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 95 [2025-04-14 01:12:17,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:12:17,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850922108] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:12:17,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:12:17,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 20 [2025-04-14 01:12:17,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054738591] [2025-04-14 01:12:17,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:12:17,057 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-14 01:12:17,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:12:17,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-14 01:12:17,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2025-04-14 01:12:17,058 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:12:17,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 261 transitions, 3246 flow. Second operand has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 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:12:17,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:12:17,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:12:17,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:12:27,519 INFO L116 PetriNetUnfolderBase]: 2414/3497 cut-off events. [2025-04-14 01:12:27,520 INFO L117 PetriNetUnfolderBase]: For 39087/39087 co-relation queries the response was YES. [2025-04-14 01:12:27,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19382 conditions, 3497 events. 2414/3497 cut-off events. For 39087/39087 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 15987 event pairs, 724 based on Foata normal form. 1/3498 useless extension candidates. Maximal degree in co-relation 19266. Up to 3336 conditions per place. [2025-04-14 01:12:27,541 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 241 selfloop transitions, 57 changer transitions 1/299 dead transitions. [2025-04-14 01:12:27,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 299 transitions, 4121 flow [2025-04-14 01:12:27,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:12:27,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:12:27,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 129 transitions. [2025-04-14 01:12:27,542 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2866666666666667 [2025-04-14 01:12:27,542 INFO L175 Difference]: Start difference. First operand has 183 places, 261 transitions, 3246 flow. Second operand 15 states and 129 transitions. [2025-04-14 01:12:27,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 299 transitions, 4121 flow [2025-04-14 01:12:27,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 299 transitions, 3911 flow, removed 54 selfloop flow, removed 8 redundant places. [2025-04-14 01:12:27,620 INFO L231 Difference]: Finished difference. Result has 193 places, 271 transitions, 3394 flow [2025-04-14 01:12:27,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3038, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3394, PETRI_PLACES=193, PETRI_TRANSITIONS=271} [2025-04-14 01:12:27,621 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 163 predicate places. [2025-04-14 01:12:27,621 INFO L485 AbstractCegarLoop]: Abstraction has has 193 places, 271 transitions, 3394 flow [2025-04-14 01:12:27,621 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 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:12:27,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:12:27,621 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:12:27,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-14 01:12:27,821 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-14 01:12:27,822 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:12:27,822 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:12:27,822 INFO L85 PathProgramCache]: Analyzing trace with hash -893291157, now seen corresponding path program 19 times [2025-04-14 01:12:27,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:12:27,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443260924] [2025-04-14 01:12:27,822 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:12:27,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:12:27,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:12:27,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:12:27,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:12:27,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:34,392 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:12:34,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:12:34,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443260924] [2025-04-14 01:12:34,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443260924] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:12:34,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871967024] [2025-04-14 01:12:34,392 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:12:34,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:12:34,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:12:34,394 INFO L229 MonitoredProcess]: Starting monitored process 23 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:12:34,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-14 01:12:34,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:12:34,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:12:34,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:12:34,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:34,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-14 01:12:34,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:12:34,538 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:12:35,304 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-14 01:12:35,304 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-14 01:12:36,247 INFO L325 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-04-14 01:12:36,248 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-04-14 01:12:40,206 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-14 01:12:40,207 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2025-04-14 01:12:42,075 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:12:42,076 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2025-04-14 01:12:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:12:42,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:12:44,020 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:12:44,020 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 215 [2025-04-14 01:12:53,526 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:12:53,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871967024] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:12:53,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:12:53,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2025-04-14 01:12:53,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988235153] [2025-04-14 01:12:53,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:12:53,527 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-14 01:12:53,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:12:53,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-14 01:12:53,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=835, Unknown=0, NotChecked=0, Total=992 [2025-04-14 01:12:53,528 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:12:53,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 271 transitions, 3394 flow. Second operand has 32 states, 32 states have (on average 5.0625) internal successors, (162), 32 states have internal predecessors, (162), 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:12:53,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:12:53,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:12:53,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:13:07,209 INFO L116 PetriNetUnfolderBase]: 2498/3618 cut-off events. [2025-04-14 01:13:07,210 INFO L117 PetriNetUnfolderBase]: For 44958/44958 co-relation queries the response was YES. [2025-04-14 01:13:07,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20296 conditions, 3618 events. 2498/3618 cut-off events. For 44958/44958 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 16614 event pairs, 754 based on Foata normal form. 1/3619 useless extension candidates. Maximal degree in co-relation 20176. Up to 3459 conditions per place. [2025-04-14 01:13:07,237 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 249 selfloop transitions, 57 changer transitions 1/307 dead transitions. [2025-04-14 01:13:07,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 307 transitions, 4359 flow [2025-04-14 01:13:07,238 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:13:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:13:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 128 transitions. [2025-04-14 01:13:07,239 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28444444444444444 [2025-04-14 01:13:07,239 INFO L175 Difference]: Start difference. First operand has 193 places, 271 transitions, 3394 flow. Second operand 15 states and 128 transitions. [2025-04-14 01:13:07,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 307 transitions, 4359 flow [2025-04-14 01:13:07,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 307 transitions, 4133 flow, removed 63 selfloop flow, removed 10 redundant places. [2025-04-14 01:13:07,344 INFO L231 Difference]: Finished difference. Result has 199 places, 280 transitions, 3578 flow [2025-04-14 01:13:07,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3168, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3578, PETRI_PLACES=199, PETRI_TRANSITIONS=280} [2025-04-14 01:13:07,345 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 169 predicate places. [2025-04-14 01:13:07,345 INFO L485 AbstractCegarLoop]: Abstraction has has 199 places, 280 transitions, 3578 flow [2025-04-14 01:13:07,345 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.0625) internal successors, (162), 32 states have internal predecessors, (162), 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:13:07,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:13:07,345 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:13:07,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-14 01:13:07,546 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-14 01:13:07,546 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:13:07,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:13:07,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1237646985, now seen corresponding path program 20 times [2025-04-14 01:13:07,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:13:07,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455114902] [2025-04-14 01:13:07,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:13:07,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:13:07,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:13:07,570 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:13:07,570 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:13:07,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:13:14,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:13:14,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:13:14,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455114902] [2025-04-14 01:13:14,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455114902] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:13:14,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533762669] [2025-04-14 01:13:14,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:13:14,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:13:14,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:13:14,077 INFO L229 MonitoredProcess]: Starting monitored process 24 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:13:14,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-14 01:13:14,142 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:13:14,164 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:13:14,164 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:13:14,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:13:14,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-14 01:13:14,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:13:14,224 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:13:15,238 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-14 01:13:15,238 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-14 01:13:16,172 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:13:16,173 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:13:19,269 INFO L325 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-04-14 01:13:19,270 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-04-14 01:13:20,945 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:13:20,946 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 96 [2025-04-14 01:13:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:13:21,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:13:24,428 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:13:24,429 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 134 [2025-04-14 01:13:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:13:32,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533762669] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:13:32,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:13:32,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 24 [2025-04-14 01:13:32,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849552953] [2025-04-14 01:13:32,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:13:32,080 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-14 01:13:32,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:13:32,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-14 01:13:32,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-04-14 01:13:32,081 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:13:32,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 280 transitions, 3578 flow. Second operand has 26 states, 26 states have (on average 5.038461538461538) internal successors, (131), 26 states have internal predecessors, (131), 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:13:32,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:13:32,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:13:32,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:13:46,793 INFO L116 PetriNetUnfolderBase]: 2568/3719 cut-off events. [2025-04-14 01:13:46,793 INFO L117 PetriNetUnfolderBase]: For 49256/49256 co-relation queries the response was YES. [2025-04-14 01:13:46,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21015 conditions, 3719 events. 2568/3719 cut-off events. For 49256/49256 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 17236 event pairs, 772 based on Foata normal form. 1/3720 useless extension candidates. Maximal degree in co-relation 20893. Up to 3565 conditions per place. [2025-04-14 01:13:46,813 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 254 selfloop transitions, 57 changer transitions 1/312 dead transitions. [2025-04-14 01:13:46,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 312 transitions, 4504 flow [2025-04-14 01:13:46,814 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:13:46,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:13:46,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 121 transitions. [2025-04-14 01:13:46,815 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31025641025641026 [2025-04-14 01:13:46,815 INFO L175 Difference]: Start difference. First operand has 199 places, 280 transitions, 3578 flow. Second operand 13 states and 121 transitions. [2025-04-14 01:13:46,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 312 transitions, 4504 flow [2025-04-14 01:13:46,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 312 transitions, 4196 flow, removed 123 selfloop flow, removed 10 redundant places. [2025-04-14 01:13:46,907 INFO L231 Difference]: Finished difference. Result has 203 places, 286 transitions, 3632 flow [2025-04-14 01:13:46,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3270, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3632, PETRI_PLACES=203, PETRI_TRANSITIONS=286} [2025-04-14 01:13:46,908 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 173 predicate places. [2025-04-14 01:13:46,908 INFO L485 AbstractCegarLoop]: Abstraction has has 203 places, 286 transitions, 3632 flow [2025-04-14 01:13:46,908 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.038461538461538) internal successors, (131), 26 states have internal predecessors, (131), 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:13:46,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:13:46,908 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:13:46,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-14 01:13:47,108 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:13:47,109 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:13:47,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:13:47,109 INFO L85 PathProgramCache]: Analyzing trace with hash 385342055, now seen corresponding path program 21 times [2025-04-14 01:13:47,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:13:47,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79939762] [2025-04-14 01:13:47,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:13:47,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:13:47,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:13:47,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:13:47,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:13:47,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:13:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:13:53,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:13:53,919 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79939762] [2025-04-14 01:13:53,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79939762] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:13:53,919 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474736879] [2025-04-14 01:13:53,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:13:53,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:13:53,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:13:53,921 INFO L229 MonitoredProcess]: Starting monitored process 25 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:13:53,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-14 01:13:53,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:13:54,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:13:54,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:13:54,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:13:54,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-14 01:13:54,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:13:54,073 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:13:54,632 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-14 01:13:54,632 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-14 01:13:55,711 INFO L325 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-04-14 01:13:55,711 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-04-14 01:13:58,262 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-14 01:13:58,262 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2025-04-14 01:14:00,410 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:14:00,411 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 23 [2025-04-14 01:14:00,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:14:00,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:14:02,153 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:14:02,154 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 215 [2025-04-14 01:14:12,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:14:12,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474736879] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:14:12,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:14:12,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 24 [2025-04-14 01:14:12,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414705590] [2025-04-14 01:14:12,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:14:12,433 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-14 01:14:12,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:14:12,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-14 01:14:12,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2025-04-14 01:14:12,434 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:14:12,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 286 transitions, 3632 flow. Second operand has 26 states, 26 states have (on average 5.1923076923076925) internal successors, (135), 26 states have internal predecessors, (135), 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:14:12,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:14:12,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:14:12,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:14:26,266 INFO L116 PetriNetUnfolderBase]: 2638/3820 cut-off events. [2025-04-14 01:14:26,266 INFO L117 PetriNetUnfolderBase]: For 54080/54080 co-relation queries the response was YES. [2025-04-14 01:14:26,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21629 conditions, 3820 events. 2638/3820 cut-off events. For 54080/54080 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 17778 event pairs, 807 based on Foata normal form. 1/3821 useless extension candidates. Maximal degree in co-relation 21504. Up to 3666 conditions per place. [2025-04-14 01:14:26,292 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 260 selfloop transitions, 57 changer transitions 1/318 dead transitions. [2025-04-14 01:14:26,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 318 transitions, 4582 flow [2025-04-14 01:14:26,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:14:26,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:14:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 127 transitions. [2025-04-14 01:14:26,293 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2822222222222222 [2025-04-14 01:14:26,293 INFO L175 Difference]: Start difference. First operand has 203 places, 286 transitions, 3632 flow. Second operand 15 states and 127 transitions. [2025-04-14 01:14:26,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 318 transitions, 4582 flow [2025-04-14 01:14:26,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 318 transitions, 4308 flow, removed 104 selfloop flow, removed 9 redundant places. [2025-04-14 01:14:26,387 INFO L231 Difference]: Finished difference. Result has 210 places, 292 transitions, 3732 flow [2025-04-14 01:14:26,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3358, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3732, PETRI_PLACES=210, PETRI_TRANSITIONS=292} [2025-04-14 01:14:26,388 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 180 predicate places. [2025-04-14 01:14:26,388 INFO L485 AbstractCegarLoop]: Abstraction has has 210 places, 292 transitions, 3732 flow [2025-04-14 01:14:26,388 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.1923076923076925) internal successors, (135), 26 states have internal predecessors, (135), 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:14:26,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:14:26,388 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:14:26,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-14 01:14:26,588 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-14 01:14:26,589 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:14:26,590 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:14:26,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1693456951, now seen corresponding path program 22 times [2025-04-14 01:14:26,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:14:26,590 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382059458] [2025-04-14 01:14:26,590 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:14:26,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:14:26,597 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:14:26,607 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:14:26,607 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:14:26,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:14:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:14:32,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:14:32,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382059458] [2025-04-14 01:14:32,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382059458] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:14:32,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940762668] [2025-04-14 01:14:32,205 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:14:32,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:14:32,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:14:32,207 INFO L229 MonitoredProcess]: Starting monitored process 26 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:14:32,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-14 01:14:32,272 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:14:32,291 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:14:32,292 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:14:32,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:14:32,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-14 01:14:32,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:14:32,766 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:14:33,430 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:14:33,430 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:14:38,248 INFO L325 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2025-04-14 01:14:38,249 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-04-14 01:14:38,830 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-04-14 01:14:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:14:38,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:14:43,891 WARN L849 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.offset Int)) (let ((.cse0 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse1 (select (select |c_#memory_int#1| c_~B~0.base) (+ .cse0 ~B~0.offset))) (.cse2 (select (select |c_#memory_int#1| c_~A~0.base) (+ c_~A~0.offset .cse0)))) (= (+ (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) (+ .cse0 ~C~0.offset) (+ .cse1 .cse2))) c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork2_~i~1#1| 4) ~B~0.offset)) c_~asum~0 c_~bsum~0) (+ .cse1 .cse2 c_~csum~0))))) is different from false [2025-04-14 01:14:44,787 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:14:44,788 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 134 [2025-04-14 01:14:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2025-04-14 01:14:49,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940762668] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:14:49,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:14:49,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 28 [2025-04-14 01:14:49,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743790196] [2025-04-14 01:14:49,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:14:49,930 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-14 01:14:49,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:14:49,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-14 01:14:49,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=678, Unknown=1, NotChecked=54, Total=870 [2025-04-14 01:14:49,931 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:14:49,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 292 transitions, 3732 flow. Second operand has 30 states, 30 states have (on average 5.266666666666667) internal successors, (158), 30 states have internal predecessors, (158), 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:14:49,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:14:49,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:14:49,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:05,447 INFO L116 PetriNetUnfolderBase]: 2724/3944 cut-off events. [2025-04-14 01:15:05,448 INFO L117 PetriNetUnfolderBase]: For 57793/57793 co-relation queries the response was YES. [2025-04-14 01:15:05,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22514 conditions, 3944 events. 2724/3944 cut-off events. For 57793/57793 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 18509 event pairs, 833 based on Foata normal form. 1/3945 useless extension candidates. Maximal degree in co-relation 22386. Up to 3783 conditions per place. [2025-04-14 01:15:05,474 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 271 selfloop transitions, 57 changer transitions 1/329 dead transitions. [2025-04-14 01:15:05,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 329 transitions, 4769 flow [2025-04-14 01:15:05,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:15:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:15:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 123 transitions. [2025-04-14 01:15:05,475 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3153846153846154 [2025-04-14 01:15:05,475 INFO L175 Difference]: Start difference. First operand has 210 places, 292 transitions, 3732 flow. Second operand 13 states and 123 transitions. [2025-04-14 01:15:05,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 329 transitions, 4769 flow [2025-04-14 01:15:05,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 329 transitions, 4483 flow, removed 110 selfloop flow, removed 11 redundant places. [2025-04-14 01:15:05,606 INFO L231 Difference]: Finished difference. Result has 214 places, 301 transitions, 3889 flow [2025-04-14 01:15:05,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3446, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3889, PETRI_PLACES=214, PETRI_TRANSITIONS=301} [2025-04-14 01:15:05,607 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 184 predicate places. [2025-04-14 01:15:05,607 INFO L485 AbstractCegarLoop]: Abstraction has has 214 places, 301 transitions, 3889 flow [2025-04-14 01:15:05,607 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.266666666666667) internal successors, (158), 30 states have internal predecessors, (158), 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:15:05,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:05,607 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:15:05,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-14 01:15:05,807 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-14 01:15:05,808 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:15:05,808 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:05,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1356305327, now seen corresponding path program 23 times [2025-04-14 01:15:05,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:05,808 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285300228] [2025-04-14 01:15:05,808 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:15:05,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:05,814 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:15:05,822 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:15:05,822 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:15:05,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:10,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:15:10,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:10,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285300228] [2025-04-14 01:15:10,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285300228] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:15:10,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756931564] [2025-04-14 01:15:10,766 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:15:10,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:15:10,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:15:10,769 INFO L229 MonitoredProcess]: Starting monitored process 27 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:15:10,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-14 01:15:10,838 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:15:10,859 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:15:10,859 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:15:10,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:10,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 01:15:10,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:15:18,480 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:15:18,480 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 20 [2025-04-14 01:15:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:15:18,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:15:20,226 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:15:20,226 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 95 [2025-04-14 01:15:23,003 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:15:23,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756931564] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:15:23,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:15:23,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 24 [2025-04-14 01:15:23,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831520871] [2025-04-14 01:15:23,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:15:23,004 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-14 01:15:23,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:23,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-14 01:15:23,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2025-04-14 01:15:23,004 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 01:15:23,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 301 transitions, 3889 flow. Second operand has 26 states, 26 states have (on average 5.538461538461538) internal successors, (144), 26 states have internal predecessors, (144), 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:15:23,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:23,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 01:15:23,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-04-14 01:15:31,606 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:15:31,609 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:15:31,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:15:31,815 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 01:15:31,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-04-14 01:15:32,015 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:15:32,016 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (26states, 3/30 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 730 conditions, 87 events (43/86 cut-off events. For 1400/1400 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 320 event pairs, 5 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 640. Up to 46 conditions per place.). [2025-04-14 01:15:32,018 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 01:15:32,018 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 01:15:32,018 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 01:15:32,019 INFO L422 BasicCegarLoop]: Path program histogram: [23, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:15:32,029 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:15:32,029 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:15:32,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:15:32 BasicIcfg [2025-04-14 01:15:32,036 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:15:32,037 INFO L158 Benchmark]: Toolchain (without parser) took 862009.28ms. Allocated memory was 155.2MB in the beginning and 406.8MB in the end (delta: 251.7MB). Free memory was 109.8MB in the beginning and 173.9MB in the end (delta: -64.1MB). Peak memory consumption was 185.5MB. Max. memory is 8.0GB. [2025-04-14 01:15:32,037 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:15:32,037 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.35ms. Allocated memory is still 155.2MB. Free memory was 109.8MB in the beginning and 95.0MB in the end (delta: 14.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 01:15:32,037 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.43ms. Allocated memory is still 155.2MB. Free memory was 95.0MB in the beginning and 91.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:15:32,041 INFO L158 Benchmark]: Boogie Preprocessor took 41.43ms. Allocated memory is still 155.2MB. Free memory was 91.9MB in the beginning and 90.1MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:15:32,042 INFO L158 Benchmark]: IcfgBuilder took 792.78ms. Allocated memory is still 155.2MB. Free memory was 89.3MB in the beginning and 71.0MB in the end (delta: 18.3MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. [2025-04-14 01:15:32,042 INFO L158 Benchmark]: TraceAbstraction took 860868.27ms. Allocated memory was 155.2MB in the beginning and 406.8MB in the end (delta: 251.7MB). Free memory was 70.1MB in the beginning and 173.9MB in the end (delta: -103.8MB). Peak memory consumption was 144.5MB. Max. memory is 8.0GB. [2025-04-14 01:15:32,043 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.17ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 262.35ms. Allocated memory is still 155.2MB. Free memory was 109.8MB in the beginning and 95.0MB in the end (delta: 14.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.43ms. Allocated memory is still 155.2MB. Free memory was 95.0MB in the beginning and 91.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.43ms. Allocated memory is still 155.2MB. Free memory was 91.9MB in the beginning and 90.1MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 792.78ms. Allocated memory is still 155.2MB. Free memory was 89.3MB in the beginning and 71.0MB in the end (delta: 18.3MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. * TraceAbstraction took 860868.27ms. Allocated memory was 155.2MB in the beginning and 406.8MB in the end (delta: 251.7MB). Free memory was 70.1MB in the beginning and 173.9MB in the end (delta: -103.8MB). Peak memory consumption was 144.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (26states, 3/30 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 730 conditions, 87 events (43/86 cut-off events. For 1400/1400 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 320 event pairs, 5 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 640. Up to 46 conditions per place.). - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (26states, 3/30 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 730 conditions, 87 events (43/86 cut-off events. For 1400/1400 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 320 event pairs, 5 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 640. Up to 46 conditions per place.). - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (26states, 3/30 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 730 conditions, 87 events (43/86 cut-off events. For 1400/1400 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 320 event pairs, 5 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 640. Up to 46 conditions per place.). - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (26states, 3/30 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 730 conditions, 87 events (43/86 cut-off events. For 1400/1400 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 320 event pairs, 5 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 640. Up to 46 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 37 locations, 45 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 860.8s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 23, EmptinessCheckTime: 0.0s, AutomataDifference: 293.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1455 SdHoareTripleChecker+Valid, 231.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1455 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 228.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 603 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 203 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17741 IncrementalHoareTripleChecker+Invalid, 18547 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 203 mSolverCounterUnsat, 0 mSDtfsCounter, 17741 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1721 GetRequests, 1026 SyntacticMatches, 10 SemanticMatches, 685 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 5219 ImplicationChecksByTransitivity, 417.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3889occurred in iteration=29, InterpolantAutomatonStates: 333, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 558.6s InterpolantComputationTime, 1425 NumberOfCodeBlocks, 1425 NumberOfCodeBlocksAsserted, 94 NumberOfCheckSat, 2014 ConstructedInterpolants, 105 QuantifiedInterpolants, 28198 SizeOfPredicates, 336 NumberOfNonLiveVariables, 7487 ConjunctsInSsa, 924 ConjunctsInUnsatCore, 82 InterpolantComputations, 7 PerfectInterpolantSequences, 194/483 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown