/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/pthread/fib_unsafe-12.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:44:14,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:44:14,307 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 23:44:14,311 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:44:14,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:44:14,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:44:14,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:44:14,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:44:14,334 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:44:14,334 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:44:14,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:44:14,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:44:14,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:44:14,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:44:14,334 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:44:14,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:44:14,334 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:44:14,334 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:44:14,334 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:44:14,334 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:44:14,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:44:14,334 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:44:14,335 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:44:14,335 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:44:14,335 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:44:14,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:44:14,335 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:44:14,335 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:44:14,335 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:44:14,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:44:14,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:44:14,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:44:14,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:44:14,335 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:44:14,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:44:14,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:44:14,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:44:14,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:44:14,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:44:14,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:44:14,337 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:44:14,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:44:14,337 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:44:14,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:44:14,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:44:14,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:44:14,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:44:14,338 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-13 23:44:14,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:44:14,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:44:14,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:44:14,587 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:44:14,588 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:44:14,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-12.i [2025-04-13 23:44:15,928 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5fb1d465/54e13ccac06f4e948dd7f74a0ff77401/FLAG04ee5e6fa [2025-04-13 23:44:16,156 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:44:16,157 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-12.i [2025-04-13 23:44:16,166 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5fb1d465/54e13ccac06f4e948dd7f74a0ff77401/FLAG04ee5e6fa [2025-04-13 23:44:16,930 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5fb1d465/54e13ccac06f4e948dd7f74a0ff77401 [2025-04-13 23:44:16,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:44:16,932 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:44:16,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:44:16,933 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:44:16,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:44:16,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:44:16" (1/1) ... [2025-04-13 23:44:16,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d340067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:16, skipping insertion in model container [2025-04-13 23:44:16,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:44:16" (1/1) ... [2025-04-13 23:44:16,962 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:44:17,241 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-12.i[30243,30256] [2025-04-13 23:44:17,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:44:17,274 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:44:17,317 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-12.i[30243,30256] [2025-04-13 23:44:17,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:44:17,352 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:44:17,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17 WrapperNode [2025-04-13 23:44:17,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:44:17,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:44:17,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:44:17,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:44:17,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,377 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,390 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-04-13 23:44:17,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:44:17,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:44:17,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:44:17,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:44:17,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,407 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 23:44:17,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,409 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,410 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:44:17,418 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:44:17,418 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:44:17,418 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:44:17,419 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:44:17,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:44:17,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 23:44:17,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 23:44:17,462 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 23:44:17,462 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 23:44:17,462 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 23:44:17,462 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 23:44:17,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 23:44:17,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:44:17,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:44:17,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 23:44:17,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:44:17,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:44:17,463 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:44:17,550 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:44:17,552 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:44:17,649 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:44:17,650 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:44:17,650 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:44:17,753 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:44:17,755 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:44:17,764 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:44:17,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:44:17 BoogieIcfgContainer [2025-04-13 23:44:17,765 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:44:17,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:44:17,767 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:44:17,771 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:44:17,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:44:16" (1/3) ... [2025-04-13 23:44:17,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d012bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:44:17, skipping insertion in model container [2025-04-13 23:44:17,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (2/3) ... [2025-04-13 23:44:17,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d012bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:44:17, skipping insertion in model container [2025-04-13 23:44:17,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:44:17" (3/3) ... [2025-04-13 23:44:17,773 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_unsafe-12.i [2025-04-13 23:44:17,783 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:44:17,784 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_unsafe-12.i that has 3 procedures, 21 locations, 23 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 23:44:17,784 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:44:17,824 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:44:17,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 58 flow [2025-04-13 23:44:17,868 INFO L116 PetriNetUnfolderBase]: 5/23 cut-off events. [2025-04-13 23:44:17,869 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:44:17,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 23 events. 5/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2025-04-13 23:44:17,871 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 25 transitions, 58 flow [2025-04-13 23:44:17,873 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 23 transitions, 52 flow [2025-04-13 23:44:17,878 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:44:17,890 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;@3da0fbbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:44:17,890 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 23:44:17,896 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:44:17,896 INFO L116 PetriNetUnfolderBase]: 5/21 cut-off events. [2025-04-13 23:44:17,896 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:44:17,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:17,897 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:17,897 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:44:17,901 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:17,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1578653316, now seen corresponding path program 1 times [2025-04-13 23:44:17,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:17,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168608360] [2025-04-13 23:44:17,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:44:17,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:17,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:44:17,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:44:17,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:44:17,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:18,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:18,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:18,111 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168608360] [2025-04-13 23:44:18,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168608360] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:44:18,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:44:18,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:44:18,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44537849] [2025-04-13 23:44:18,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:44:18,119 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:44:18,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:18,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:44:18,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:44:18,139 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 23:44:18,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:18,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:18,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 23:44:18,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:18,271 INFO L116 PetriNetUnfolderBase]: 233/357 cut-off events. [2025-04-13 23:44:18,271 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:44:18,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 357 events. 233/357 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 986 event pairs, 39 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 712. Up to 257 conditions per place. [2025-04-13 23:44:18,292 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 27 selfloop transitions, 2 changer transitions 1/30 dead transitions. [2025-04-13 23:44:18,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 30 transitions, 126 flow [2025-04-13 23:44:18,294 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:44:18,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:44:18,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-04-13 23:44:18,302 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2025-04-13 23:44:18,303 INFO L175 Difference]: Start difference. First operand has 25 places, 23 transitions, 52 flow. Second operand 3 states and 41 transitions. [2025-04-13 23:44:18,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 30 transitions, 126 flow [2025-04-13 23:44:18,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 23:44:18,308 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 56 flow [2025-04-13 23:44:18,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2025-04-13 23:44:18,312 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 1 predicate places. [2025-04-13 23:44:18,312 INFO L485 AbstractCegarLoop]: Abstraction has has 26 places, 21 transitions, 56 flow [2025-04-13 23:44:18,312 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:18,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:18,312 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:18,312 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:44:18,312 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:44:18,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:18,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1693576751, now seen corresponding path program 1 times [2025-04-13 23:44:18,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:18,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018709124] [2025-04-13 23:44:18,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:44:18,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:18,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:44:18,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:44:18,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:44:18,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:18,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:18,383 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018709124] [2025-04-13 23:44:18,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018709124] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:44:18,383 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009105679] [2025-04-13 23:44:18,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:44:18,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:18,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:44:18,386 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:44:18,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 23:44:18,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:44:18,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:44:18,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:44:18,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:18,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 23:44:18,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:44:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:18,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:44:18,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:18,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009105679] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:44:18,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:44:18,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-13 23:44:18,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852576600] [2025-04-13 23:44:18,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:44:18,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:44:18,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:18,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:44:18,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:44:18,500 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 23:44:18,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 56 flow. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:18,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:18,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 23:44:18,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:18,618 INFO L116 PetriNetUnfolderBase]: 297/453 cut-off events. [2025-04-13 23:44:18,618 INFO L117 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-04-13 23:44:18,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 453 events. 297/453 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1244 event pairs, 39 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1016. Up to 209 conditions per place. [2025-04-13 23:44:18,622 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 51 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2025-04-13 23:44:18,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 56 transitions, 244 flow [2025-04-13 23:44:18,624 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:44:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 23:44:18,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2025-04-13 23:44:18,624 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2025-04-13 23:44:18,624 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 56 flow. Second operand 6 states and 71 transitions. [2025-04-13 23:44:18,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 56 transitions, 244 flow [2025-04-13 23:44:18,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 56 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 23:44:18,626 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 90 flow [2025-04-13 23:44:18,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=90, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2025-04-13 23:44:18,626 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2025-04-13 23:44:18,627 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 90 flow [2025-04-13 23:44:18,627 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:18,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:18,627 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:18,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 23:44:18,832 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:18,832 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:44:18,833 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash 328624452, now seen corresponding path program 2 times [2025-04-13 23:44:18,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:18,833 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110418802] [2025-04-13 23:44:18,833 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:44:18,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:18,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 23:44:18,859 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:44:18,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:44:18,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:18,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:18,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110418802] [2025-04-13 23:44:18,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110418802] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:44:18,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521844239] [2025-04-13 23:44:18,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:44:18,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:18,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:44:18,970 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-13 23:44:18,971 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-13 23:44:19,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 23:44:19,027 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:44:19,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:44:19,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:19,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:44:19,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:44:19,045 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:19,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:44:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:19,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521844239] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:44:19,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:44:19,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 23:44:19,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728476442] [2025-04-13 23:44:19,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:44:19,100 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 23:44:19,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:19,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 23:44:19,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:44:19,101 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 23:44:19,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 90 flow. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:19,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:19,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 23:44:19,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:19,309 INFO L116 PetriNetUnfolderBase]: 489/741 cut-off events. [2025-04-13 23:44:19,309 INFO L117 PetriNetUnfolderBase]: For 388/388 co-relation queries the response was YES. [2025-04-13 23:44:19,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1965 conditions, 741 events. 489/741 cut-off events. For 388/388 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2115 event pairs, 39 based on Foata normal form. 96/715 useless extension candidates. Maximal degree in co-relation 1944. Up to 209 conditions per place. [2025-04-13 23:44:19,313 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 99 selfloop transitions, 11 changer transitions 0/110 dead transitions. [2025-04-13 23:44:19,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 110 transitions, 506 flow [2025-04-13 23:44:19,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:44:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 23:44:19,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 140 transitions. [2025-04-13 23:44:19,314 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-04-13 23:44:19,314 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 90 flow. Second operand 12 states and 140 transitions. [2025-04-13 23:44:19,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 110 transitions, 506 flow [2025-04-13 23:44:19,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 110 transitions, 492 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 23:44:19,318 INFO L231 Difference]: Finished difference. Result has 48 places, 30 transitions, 160 flow [2025-04-13 23:44:19,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=160, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2025-04-13 23:44:19,318 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 23 predicate places. [2025-04-13 23:44:19,318 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 160 flow [2025-04-13 23:44:19,318 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:19,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:19,319 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:19,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 23:44:19,519 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,SelfDestructingSolverStorable2 [2025-04-13 23:44:19,519 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:44:19,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:19,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2090552988, now seen corresponding path program 3 times [2025-04-13 23:44:19,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:19,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722627773] [2025-04-13 23:44:19,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:44:19,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:19,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-04-13 23:44:19,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:44:19,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 23:44:19,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:19,695 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:19,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:19,695 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722627773] [2025-04-13 23:44:19,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722627773] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:44:19,695 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672527546] [2025-04-13 23:44:19,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:44:19,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:19,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:44:19,697 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-13 23:44:19,699 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-13 23:44:19,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-04-13 23:44:19,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:44:19,756 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 23:44:19,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:19,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 23:44:19,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:44:19,781 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:19,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:44:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:19,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672527546] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:44:19,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:44:19,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-04-13 23:44:19,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899317678] [2025-04-13 23:44:19,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:44:19,973 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 23:44:19,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:19,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 23:44:19,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:44:19,974 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 23:44:19,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 30 transitions, 160 flow. Second operand has 25 states, 25 states have (on average 3.4) internal successors, (85), 25 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:19,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:19,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 23:44:19,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:20,361 INFO L116 PetriNetUnfolderBase]: 873/1317 cut-off events. [2025-04-13 23:44:20,361 INFO L117 PetriNetUnfolderBase]: For 7492/7492 co-relation queries the response was YES. [2025-04-13 23:44:20,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3972 conditions, 1317 events. 873/1317 cut-off events. For 7492/7492 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3837 event pairs, 39 based on Foata normal form. 192/1291 useless extension candidates. Maximal degree in co-relation 3944. Up to 337 conditions per place. [2025-04-13 23:44:20,374 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 195 selfloop transitions, 23 changer transitions 0/218 dead transitions. [2025-04-13 23:44:20,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 218 transitions, 1044 flow [2025-04-13 23:44:20,375 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 23:44:20,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-13 23:44:20,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 278 transitions. [2025-04-13 23:44:20,379 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4633333333333333 [2025-04-13 23:44:20,379 INFO L175 Difference]: Start difference. First operand has 48 places, 30 transitions, 160 flow. Second operand 24 states and 278 transitions. [2025-04-13 23:44:20,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 218 transitions, 1044 flow [2025-04-13 23:44:20,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 218 transitions, 972 flow, removed 31 selfloop flow, removed 5 redundant places. [2025-04-13 23:44:20,393 INFO L231 Difference]: Finished difference. Result has 78 places, 42 transitions, 280 flow [2025-04-13 23:44:20,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=280, PETRI_PLACES=78, PETRI_TRANSITIONS=42} [2025-04-13 23:44:20,394 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 53 predicate places. [2025-04-13 23:44:20,394 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 42 transitions, 280 flow [2025-04-13 23:44:20,395 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.4) internal successors, (85), 25 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:20,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:20,395 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:20,401 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-13 23:44:20,596 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:20,596 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:44:20,597 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:20,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1826129500, now seen corresponding path program 4 times [2025-04-13 23:44:20,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:20,597 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457138715] [2025-04-13 23:44:20,597 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:44:20,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:20,604 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 23:44:20,620 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 23:44:20,621 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:44:20,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:21,015 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:21,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:21,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457138715] [2025-04-13 23:44:21,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457138715] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:44:21,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104907279] [2025-04-13 23:44:21,015 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:44:21,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:21,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:44:21,019 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-13 23:44:21,021 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-13 23:44:21,060 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 23:44:21,084 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 23:44:21,085 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:44:21,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:21,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 23:44:21,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:44:21,144 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:21,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:44:21,433 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:21,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104907279] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:44:21,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:44:21,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 28 [2025-04-13 23:44:21,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062868028] [2025-04-13 23:44:21,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:44:21,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 23:44:21,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:21,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 23:44:21,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2025-04-13 23:44:21,435 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 23:44:21,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 42 transitions, 280 flow. Second operand has 28 states, 28 states have (on average 3.357142857142857) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:21,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:21,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 23:44:21,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:21,836 INFO L116 PetriNetUnfolderBase]: 1001/1509 cut-off events. [2025-04-13 23:44:21,837 INFO L117 PetriNetUnfolderBase]: For 16612/16612 co-relation queries the response was YES. [2025-04-13 23:44:21,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4752 conditions, 1509 events. 1001/1509 cut-off events. For 16612/16612 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4420 event pairs, 39 based on Foata normal form. 64/1323 useless extension candidates. Maximal degree in co-relation 4712. Up to 305 conditions per place. [2025-04-13 23:44:21,849 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 227 selfloop transitions, 27 changer transitions 0/254 dead transitions. [2025-04-13 23:44:21,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 254 transitions, 1236 flow [2025-04-13 23:44:21,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 23:44:21,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-13 23:44:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 314 transitions. [2025-04-13 23:44:21,852 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44857142857142857 [2025-04-13 23:44:21,852 INFO L175 Difference]: Start difference. First operand has 78 places, 42 transitions, 280 flow. Second operand 28 states and 314 transitions. [2025-04-13 23:44:21,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 254 transitions, 1236 flow [2025-04-13 23:44:21,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 254 transitions, 1132 flow, removed 41 selfloop flow, removed 11 redundant places. [2025-04-13 23:44:21,869 INFO L231 Difference]: Finished difference. Result has 98 places, 46 transitions, 280 flow [2025-04-13 23:44:21,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=280, PETRI_PLACES=98, PETRI_TRANSITIONS=46} [2025-04-13 23:44:21,871 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 73 predicate places. [2025-04-13 23:44:21,871 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 46 transitions, 280 flow [2025-04-13 23:44:21,871 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.357142857142857) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:21,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:21,871 INFO L206 CegarLoopForPetriNet]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:21,878 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-13 23:44:22,072 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:22,072 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:44:22,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:22,073 INFO L85 PathProgramCache]: Analyzing trace with hash 404683876, now seen corresponding path program 5 times [2025-04-13 23:44:22,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:22,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217071264] [2025-04-13 23:44:22,073 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:44:22,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:22,080 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 14 equivalence classes. [2025-04-13 23:44:22,165 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 23:44:22,165 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-04-13 23:44:22,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:23,715 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:23,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:23,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217071264] [2025-04-13 23:44:23,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217071264] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:44:23,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255782881] [2025-04-13 23:44:23,716 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:44:23,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:23,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:44:23,718 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-13 23:44:23,719 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-13 23:44:23,759 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 14 equivalence classes. [2025-04-13 23:44:23,795 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 23:44:23,795 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-04-13 23:44:23,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:23,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-04-13 23:44:23,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:44:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 300 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:25,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:44:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:26,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255782881] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:44:26,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:44:26,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 91 [2025-04-13 23:44:26,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892386897] [2025-04-13 23:44:26,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:44:26,685 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2025-04-13 23:44:26,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:26,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2025-04-13 23:44:26,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1325, Invalid=7231, Unknown=0, NotChecked=0, Total=8556 [2025-04-13 23:44:26,689 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 23:44:26,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 46 transitions, 280 flow. Second operand has 93 states, 93 states have (on average 3.172043010752688) internal successors, (295), 93 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:26,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:26,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 23:44:26,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:48,729 INFO L116 PetriNetUnfolderBase]: 31526/47554 cut-off events. [2025-04-13 23:44:48,730 INFO L117 PetriNetUnfolderBase]: For 201690/201690 co-relation queries the response was YES. [2025-04-13 23:44:48,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140857 conditions, 47554 events. 31526/47554 cut-off events. For 201690/201690 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 276528 event pairs, 717 based on Foata normal form. 463/40002 useless extension candidates. Maximal degree in co-relation 140813. Up to 6918 conditions per place. [2025-04-13 23:44:48,992 INFO L140 encePairwiseOnDemand]: 16/25 looper letters, 669 selfloop transitions, 1594 changer transitions 325/2588 dead transitions. [2025-04-13 23:44:48,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 2588 transitions, 20673 flow [2025-04-13 23:44:48,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2025-04-13 23:44:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2025-04-13 23:44:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 1476 transitions. [2025-04-13 23:44:49,000 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4016326530612245 [2025-04-13 23:44:49,002 INFO L175 Difference]: Start difference. First operand has 98 places, 46 transitions, 280 flow. Second operand 147 states and 1476 transitions. [2025-04-13 23:44:49,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 2588 transitions, 20673 flow [2025-04-13 23:44:49,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 2588 transitions, 16651 flow, removed 754 selfloop flow, removed 23 redundant places. [2025-04-13 23:44:49,486 INFO L231 Difference]: Finished difference. Result has 283 places, 1740 transitions, 10636 flow [2025-04-13 23:44:49,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=147, PETRI_FLOW=10636, PETRI_PLACES=283, PETRI_TRANSITIONS=1740} [2025-04-13 23:44:49,487 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 258 predicate places. [2025-04-13 23:44:49,487 INFO L485 AbstractCegarLoop]: Abstraction has has 283 places, 1740 transitions, 10636 flow [2025-04-13 23:44:49,487 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 93 states have (on average 3.172043010752688) internal successors, (295), 93 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:49,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:49,488 INFO L206 CegarLoopForPetriNet]: trace histogram [26, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:49,493 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-13 23:44:49,692 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:49,692 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:44:49,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:49,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1880474941, now seen corresponding path program 1 times [2025-04-13 23:44:49,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:49,692 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495136038] [2025-04-13 23:44:49,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:44:49,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:49,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 23:44:49,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 23:44:49,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:44:49,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:51,264 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 379 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:51,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:51,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495136038] [2025-04-13 23:44:51,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495136038] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:44:51,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975281864] [2025-04-13 23:44:51,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:44:51,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:51,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:44:51,268 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-13 23:44:51,269 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-13 23:44:51,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 23:44:51,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 23:44:51,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:44:51,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:51,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-04-13 23:44:51,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:44:52,734 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 300 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:52,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:44:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 379 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:54,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975281864] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:44:54,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:44:54,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2025-04-13 23:44:54,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087936866] [2025-04-13 23:44:54,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:44:54,258 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2025-04-13 23:44:54,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:54,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2025-04-13 23:44:54,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1425, Invalid=8675, Unknown=0, NotChecked=0, Total=10100 [2025-04-13 23:44:54,261 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 23:44:54,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 1740 transitions, 10636 flow. Second operand has 101 states, 101 states have (on average 3.217821782178218) internal successors, (325), 101 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:54,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:54,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 23:44:54,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand