./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/unwind2-100.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-theta/unwind2-100.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7857262d4d8d027aa598d94064d6edf426fece06c8ec09601338aa41711d7f37 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:30:41,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:30:41,860 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:30:41,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:30:41,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:30:41,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:30:41,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:30:41,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:30:41,878 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:30:41,878 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:30:41,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:30:41,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:30:41,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:30:41,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:30:41,878 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:30:41,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:30:41,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:30:41,879 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:30:41,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:30:41,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:30:41,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:30:41,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:30:41,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:30:41,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:30:41,879 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:30:41,879 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:30:41,880 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:30:41,880 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:30:41,880 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:30:41,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:30:41,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:30:41,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:30:41,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:30:41,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:30:41,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:30:41,880 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:30:41,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:30:41,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:30:41,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:30:41,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:30:41,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:30:41,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:30:41,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:30:41,880 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7857262d4d8d027aa598d94064d6edf426fece06c8ec09601338aa41711d7f37 [2025-03-04 02:30:42,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:30:42,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:30:42,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:30:42,086 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:30:42,086 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:30:42,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind2-100.i [2025-03-04 02:30:43,236 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50b1fbefa/a363612fb7e44d729ab927d9118de12a/FLAG2d95e7b42 [2025-03-04 02:30:43,554 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:30:43,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-100.i [2025-03-04 02:30:43,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50b1fbefa/a363612fb7e44d729ab927d9118de12a/FLAG2d95e7b42 [2025-03-04 02:30:43,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50b1fbefa/a363612fb7e44d729ab927d9118de12a [2025-03-04 02:30:43,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:30:43,592 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:30:43,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:30:43,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:30:43,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:30:43,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:30:43" (1/1) ... [2025-03-04 02:30:43,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@750a8b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:43, skipping insertion in model container [2025-03-04 02:30:43,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:30:43" (1/1) ... [2025-03-04 02:30:43,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:30:43,864 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-100.i[33026,33039] [2025-03-04 02:30:43,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:30:43,887 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:30:43,920 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-100.i[33026,33039] [2025-03-04 02:30:43,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:30:43,950 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:30:43,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:43 WrapperNode [2025-03-04 02:30:43,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:30:43,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:30:43,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:30:43,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:30:43,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:43" (1/1) ... [2025-03-04 02:30:43,963 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:43" (1/1) ... [2025-03-04 02:30:43,977 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2025-03-04 02:30:43,978 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:30:43,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:30:43,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:30:43,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:30:43,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:43" (1/1) ... [2025-03-04 02:30:43,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:43" (1/1) ... [2025-03-04 02:30:43,985 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:43" (1/1) ... [2025-03-04 02:30:43,994 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-03-04 02:30:43,994 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:43" (1/1) ... [2025-03-04 02:30:43,994 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:43" (1/1) ... [2025-03-04 02:30:43,997 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:43" (1/1) ... [2025-03-04 02:30:43,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:43" (1/1) ... [2025-03-04 02:30:43,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:43" (1/1) ... [2025-03-04 02:30:43,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:43" (1/1) ... [2025-03-04 02:30:44,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:30:44,000 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:30:44,000 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:30:44,001 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:30:44,001 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:43" (1/1) ... [2025-03-04 02:30:44,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:30:44,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:44,025 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-03-04 02:30:44,028 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-03-04 02:30:44,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:30:44,043 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-04 02:30:44,043 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-04 02:30:44,043 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-04 02:30:44,043 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-04 02:30:44,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:30:44,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:30:44,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:30:44,044 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:30:44,126 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:30:44,127 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:30:44,237 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:30:44,237 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:30:44,313 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:30:44,313 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:30:44,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:30:44 BoogieIcfgContainer [2025-03-04 02:30:44,313 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:30:44,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:30:44,316 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:30:44,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:30:44,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:30:43" (1/3) ... [2025-03-04 02:30:44,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516fe155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:30:44, skipping insertion in model container [2025-03-04 02:30:44,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:43" (2/3) ... [2025-03-04 02:30:44,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516fe155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:30:44, skipping insertion in model container [2025-03-04 02:30:44,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:30:44" (3/3) ... [2025-03-04 02:30:44,322 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind2-100.i [2025-03-04 02:30:44,331 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:30:44,333 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-100.i that has 3 procedures, 27 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-04 02:30:44,333 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:30:44,373 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:30:44,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 74 flow [2025-03-04 02:30:44,414 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-03-04 02:30:44,416 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:30:44,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 4/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-03-04 02:30:44,419 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 30 transitions, 74 flow [2025-03-04 02:30:44,422 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 61 flow [2025-03-04 02:30:44,427 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:30:44,433 INFO L333 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;@6a2cdaa3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:30:44,433 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 02:30:44,439 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:30:44,440 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2025-03-04 02:30:44,441 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:30:44,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:44,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:44,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:30:44,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:44,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1583119239, now seen corresponding path program 1 times [2025-03-04 02:30:44,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:44,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697420036] [2025-03-04 02:30:44,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:44,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:44,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 02:30:44,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 02:30:44,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:44,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:44,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:44,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697420036] [2025-03-04 02:30:44,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697420036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:44,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:44,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:30:44,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587436232] [2025-03-04 02:30:44,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:44,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:30:44,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:44,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:30:44,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:30:44,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-04 02:30:44,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 61 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-03-04 02:30:44,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:44,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-04 02:30:44,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:45,003 INFO L124 PetriNetUnfolderBase]: 211/450 cut-off events. [2025-03-04 02:30:45,003 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 02:30:45,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 450 events. 211/450 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2207 event pairs, 26 based on Foata normal form. 48/420 useless extension candidates. Maximal degree in co-relation 780. Up to 153 conditions per place. [2025-03-04 02:30:45,007 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 49 selfloop transitions, 8 changer transitions 0/63 dead transitions. [2025-03-04 02:30:45,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 63 transitions, 261 flow [2025-03-04 02:30:45,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:30:45,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:30:45,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2025-03-04 02:30:45,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2025-03-04 02:30:45,017 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 61 flow. Second operand 7 states and 122 transitions. [2025-03-04 02:30:45,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 63 transitions, 261 flow [2025-03-04 02:30:45,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 63 transitions, 251 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 02:30:45,021 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 101 flow [2025-03-04 02:30:45,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=101, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2025-03-04 02:30:45,025 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2025-03-04 02:30:45,025 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 101 flow [2025-03-04 02:30:45,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-03-04 02:30:45,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:45,026 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:45,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:30:45,026 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:30:45,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:45,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1832025527, now seen corresponding path program 1 times [2025-03-04 02:30:45,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:45,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938518850] [2025-03-04 02:30:45,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:45,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:45,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 02:30:45,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 02:30:45,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:45,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:45,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:45,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:45,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938518850] [2025-03-04 02:30:45,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938518850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:30:45,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964177246] [2025-03-04 02:30:45,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:45,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:45,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:45,158 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-03-04 02:30:45,160 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-03-04 02:30:45,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 02:30:45,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 02:30:45,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:45,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:45,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:30:45,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:30:45,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:45,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:30:45,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:45,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964177246] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:30:45,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:30:45,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 02:30:45,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117300130] [2025-03-04 02:30:45,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:30:45,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:30:45,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:45,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:30:45,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:30:45,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-04 02:30:45,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 101 flow. Second operand has 14 states, 14 states have (on average 9.214285714285714) internal successors, (129), 14 states have internal predecessors, (129), 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-03-04 02:30:45,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:45,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-04 02:30:45,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:45,633 INFO L124 PetriNetUnfolderBase]: 307/630 cut-off events. [2025-03-04 02:30:45,633 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2025-03-04 02:30:45,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1550 conditions, 630 events. 307/630 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3167 event pairs, 26 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 1400. Up to 153 conditions per place. [2025-03-04 02:30:45,639 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 88 selfloop transitions, 17 changer transitions 0/111 dead transitions. [2025-03-04 02:30:45,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 111 transitions, 533 flow [2025-03-04 02:30:45,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:30:45,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:30:45,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 215 transitions. [2025-03-04 02:30:45,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2025-03-04 02:30:45,646 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 101 flow. Second operand 13 states and 215 transitions. [2025-03-04 02:30:45,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 111 transitions, 533 flow [2025-03-04 02:30:45,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 111 transitions, 519 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 02:30:45,652 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 212 flow [2025-03-04 02:30:45,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=212, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2025-03-04 02:30:45,653 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 21 predicate places. [2025-03-04 02:30:45,653 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 212 flow [2025-03-04 02:30:45,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.214285714285714) internal successors, (129), 14 states have internal predecessors, (129), 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-03-04 02:30:45,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:45,654 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:45,661 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-03-04 02:30:45,855 WARN L453 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-03-04 02:30:45,855 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:30:45,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:45,856 INFO L85 PathProgramCache]: Analyzing trace with hash -225954777, now seen corresponding path program 1 times [2025-03-04 02:30:45,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:45,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817341682] [2025-03-04 02:30:45,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:45,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:45,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 02:30:45,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 02:30:45,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:45,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:45,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:45,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:45,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817341682] [2025-03-04 02:30:45,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817341682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:45,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:45,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:30:45,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637012235] [2025-03-04 02:30:45,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:45,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:30:45,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:45,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:30:45,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:30:45,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-04 02:30:45,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-03-04 02:30:45,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:45,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-04 02:30:45,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:46,087 INFO L124 PetriNetUnfolderBase]: 363/760 cut-off events. [2025-03-04 02:30:46,088 INFO L125 PetriNetUnfolderBase]: For 1257/1257 co-relation queries the response was YES. [2025-03-04 02:30:46,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2206 conditions, 760 events. 363/760 cut-off events. For 1257/1257 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3949 event pairs, 86 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 1460. Up to 245 conditions per place. [2025-03-04 02:30:46,092 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 66 selfloop transitions, 13 changer transitions 0/85 dead transitions. [2025-03-04 02:30:46,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 85 transitions, 662 flow [2025-03-04 02:30:46,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:30:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:30:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2025-03-04 02:30:46,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-04 02:30:46,093 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 212 flow. Second operand 7 states and 112 transitions. [2025-03-04 02:30:46,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 85 transitions, 662 flow [2025-03-04 02:30:46,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 85 transitions, 542 flow, removed 45 selfloop flow, removed 5 redundant places. [2025-03-04 02:30:46,104 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 231 flow [2025-03-04 02:30:46,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=231, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2025-03-04 02:30:46,105 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 25 predicate places. [2025-03-04 02:30:46,105 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 231 flow [2025-03-04 02:30:46,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-03-04 02:30:46,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:46,105 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:46,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:30:46,105 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:30:46,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:46,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1585305889, now seen corresponding path program 1 times [2025-03-04 02:30:46,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:46,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612734720] [2025-03-04 02:30:46,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:46,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:46,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 02:30:46,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:30:46,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:46,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:46,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:46,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:46,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612734720] [2025-03-04 02:30:46,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612734720] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:30:46,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531625631] [2025-03-04 02:30:46,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:46,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:46,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:46,197 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-03-04 02:30:46,198 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-03-04 02:30:46,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 02:30:46,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:30:46,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:46,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:46,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:30:46,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:30:46,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:46,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:30:46,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:46,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531625631] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:30:46,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:30:46,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 02:30:46,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693943910] [2025-03-04 02:30:46,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:30:46,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:30:46,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:46,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:30:46,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:30:46,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-04 02:30:46,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 231 flow. Second operand has 14 states, 14 states have (on average 9.5) internal successors, (133), 14 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-03-04 02:30:46,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:46,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-04 02:30:46,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:46,638 INFO L124 PetriNetUnfolderBase]: 531/1054 cut-off events. [2025-03-04 02:30:46,639 INFO L125 PetriNetUnfolderBase]: For 1926/1926 co-relation queries the response was YES. [2025-03-04 02:30:46,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3312 conditions, 1054 events. 531/1054 cut-off events. For 1926/1926 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5569 event pairs, 93 based on Foata normal form. 0/962 useless extension candidates. Maximal degree in co-relation 2112. Up to 245 conditions per place. [2025-03-04 02:30:46,645 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 129 selfloop transitions, 22 changer transitions 0/157 dead transitions. [2025-03-04 02:30:46,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 157 transitions, 1142 flow [2025-03-04 02:30:46,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:30:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:30:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 212 transitions. [2025-03-04 02:30:46,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5435897435897435 [2025-03-04 02:30:46,647 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 231 flow. Second operand 13 states and 212 transitions. [2025-03-04 02:30:46,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 157 transitions, 1142 flow [2025-03-04 02:30:46,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 157 transitions, 1123 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 02:30:46,657 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 356 flow [2025-03-04 02:30:46,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=356, PETRI_PLACES=69, PETRI_TRANSITIONS=54} [2025-03-04 02:30:46,658 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 40 predicate places. [2025-03-04 02:30:46,658 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 356 flow [2025-03-04 02:30:46,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.5) internal successors, (133), 14 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-03-04 02:30:46,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:46,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:46,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:30:46,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 02:30:46,859 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:30:46,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:46,860 INFO L85 PathProgramCache]: Analyzing trace with hash -832600784, now seen corresponding path program 1 times [2025-03-04 02:30:46,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:46,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877547959] [2025-03-04 02:30:46,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:46,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:46,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 02:30:46,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 02:30:46,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:46,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:46,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:46,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877547959] [2025-03-04 02:30:46,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877547959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:46,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:46,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:30:46,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549290795] [2025-03-04 02:30:46,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:46,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:30:46,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:46,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:30:46,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:30:46,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-04 02:30:46,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 54 transitions, 356 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-03-04 02:30:46,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:46,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-04 02:30:46,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:47,058 INFO L124 PetriNetUnfolderBase]: 555/1112 cut-off events. [2025-03-04 02:30:47,059 INFO L125 PetriNetUnfolderBase]: For 3881/3881 co-relation queries the response was YES. [2025-03-04 02:30:47,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4047 conditions, 1112 events. 555/1112 cut-off events. For 3881/3881 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6005 event pairs, 121 based on Foata normal form. 16/1068 useless extension candidates. Maximal degree in co-relation 2799. Up to 421 conditions per place. [2025-03-04 02:30:47,064 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 62 selfloop transitions, 15 changer transitions 0/83 dead transitions. [2025-03-04 02:30:47,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 83 transitions, 707 flow [2025-03-04 02:30:47,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:30:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:30:47,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2025-03-04 02:30:47,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-03-04 02:30:47,065 INFO L175 Difference]: Start difference. First operand has 69 places, 54 transitions, 356 flow. Second operand 6 states and 93 transitions. [2025-03-04 02:30:47,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 83 transitions, 707 flow [2025-03-04 02:30:47,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 83 transitions, 629 flow, removed 27 selfloop flow, removed 5 redundant places. [2025-03-04 02:30:47,077 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 344 flow [2025-03-04 02:30:47,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=344, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2025-03-04 02:30:47,080 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 41 predicate places. [2025-03-04 02:30:47,080 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 344 flow [2025-03-04 02:30:47,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-03-04 02:30:47,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:47,081 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:47,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:30:47,081 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:30:47,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:47,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1489036570, now seen corresponding path program 1 times [2025-03-04 02:30:47,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:47,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488588655] [2025-03-04 02:30:47,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:47,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:47,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 02:30:47,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 02:30:47,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:47,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:47,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:47,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488588655] [2025-03-04 02:30:47,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488588655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:47,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:47,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:30:47,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167925597] [2025-03-04 02:30:47,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:47,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:30:47,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:47,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:30:47,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:30:47,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-04 02:30:47,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 344 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-03-04 02:30:47,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:47,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-04 02:30:47,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:47,309 INFO L124 PetriNetUnfolderBase]: 580/1166 cut-off events. [2025-03-04 02:30:47,309 INFO L125 PetriNetUnfolderBase]: For 4158/4158 co-relation queries the response was YES. [2025-03-04 02:30:47,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3962 conditions, 1166 events. 580/1166 cut-off events. For 4158/4158 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6445 event pairs, 117 based on Foata normal form. 17/1117 useless extension candidates. Maximal degree in co-relation 3784. Up to 457 conditions per place. [2025-03-04 02:30:47,317 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 67 selfloop transitions, 15 changer transitions 0/88 dead transitions. [2025-03-04 02:30:47,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 88 transitions, 705 flow [2025-03-04 02:30:47,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:30:47,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:30:47,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2025-03-04 02:30:47,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5388888888888889 [2025-03-04 02:30:47,319 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 344 flow. Second operand 6 states and 97 transitions. [2025-03-04 02:30:47,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 88 transitions, 705 flow [2025-03-04 02:30:47,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 88 transitions, 675 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-04 02:30:47,328 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 363 flow [2025-03-04 02:30:47,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=363, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2025-03-04 02:30:47,328 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 44 predicate places. [2025-03-04 02:30:47,329 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 363 flow [2025-03-04 02:30:47,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-03-04 02:30:47,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:47,329 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:47,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:30:47,330 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:30:47,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:47,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1692632967, now seen corresponding path program 2 times [2025-03-04 02:30:47,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:47,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396510043] [2025-03-04 02:30:47,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:30:47,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:47,336 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-04 02:30:47,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 02:30:47,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:30:47,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:47,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:47,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396510043] [2025-03-04 02:30:47,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396510043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:30:47,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112091391] [2025-03-04 02:30:47,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:30:47,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:47,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:47,443 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-03-04 02:30:47,445 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-03-04 02:30:47,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-04 02:30:47,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 02:30:47,480 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:30:47,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:47,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:30:47,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:30:47,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:47,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:30:47,645 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:47,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112091391] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:30:47,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:30:47,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-04 02:30:47,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441154481] [2025-03-04 02:30:47,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:30:47,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:30:47,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:47,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:30:47,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:30:47,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-04 02:30:47,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 363 flow. Second operand has 23 states, 23 states have (on average 9.130434782608695) internal successors, (210), 23 states have internal predecessors, (210), 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-03-04 02:30:47,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:47,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-04 02:30:47,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:48,286 INFO L124 PetriNetUnfolderBase]: 934/1778 cut-off events. [2025-03-04 02:30:48,286 INFO L125 PetriNetUnfolderBase]: For 14079/14079 co-relation queries the response was YES. [2025-03-04 02:30:48,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6625 conditions, 1778 events. 934/1778 cut-off events. For 14079/14079 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 9544 event pairs, 93 based on Foata normal form. 240/1948 useless extension candidates. Maximal degree in co-relation 6346. Up to 351 conditions per place. [2025-03-04 02:30:48,296 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 270 selfloop transitions, 40 changer transitions 0/316 dead transitions. [2025-03-04 02:30:48,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 316 transitions, 2588 flow [2025-03-04 02:30:48,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 02:30:48,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 02:30:48,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 413 transitions. [2025-03-04 02:30:48,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5506666666666666 [2025-03-04 02:30:48,300 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 363 flow. Second operand 25 states and 413 transitions. [2025-03-04 02:30:48,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 316 transitions, 2588 flow [2025-03-04 02:30:48,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 316 transitions, 2457 flow, removed 55 selfloop flow, removed 3 redundant places. [2025-03-04 02:30:48,324 INFO L231 Difference]: Finished difference. Result has 106 places, 74 transitions, 650 flow [2025-03-04 02:30:48,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=650, PETRI_PLACES=106, PETRI_TRANSITIONS=74} [2025-03-04 02:30:48,325 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 77 predicate places. [2025-03-04 02:30:48,326 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 74 transitions, 650 flow [2025-03-04 02:30:48,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.130434782608695) internal successors, (210), 23 states have internal predecessors, (210), 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-03-04 02:30:48,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:48,326 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:48,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 02:30:48,529 WARN L453 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-03-04 02:30:48,529 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:30:48,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:48,529 INFO L85 PathProgramCache]: Analyzing trace with hash -171818440, now seen corresponding path program 1 times [2025-03-04 02:30:48,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:48,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241666126] [2025-03-04 02:30:48,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:48,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:48,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 02:30:48,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:30:48,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:48,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:48,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:48,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241666126] [2025-03-04 02:30:48,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241666126] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:30:48,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031075191] [2025-03-04 02:30:48,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:48,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:48,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:48,593 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-03-04 02:30:48,594 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-03-04 02:30:48,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 02:30:48,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:30:48,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:48,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:48,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:30:48,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:30:48,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:48,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:30:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:48,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031075191] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:30:48,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:30:48,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 02:30:48,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559832928] [2025-03-04 02:30:48,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:30:48,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:30:48,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:48,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:30:48,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:30:48,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-04 02:30:48,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 74 transitions, 650 flow. Second operand has 14 states, 14 states have (on average 9.785714285714286) internal successors, (137), 14 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-03-04 02:30:48,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:48,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-04 02:30:48,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:49,004 INFO L124 PetriNetUnfolderBase]: 1006/1922 cut-off events. [2025-03-04 02:30:49,005 INFO L125 PetriNetUnfolderBase]: For 22234/22234 co-relation queries the response was YES. [2025-03-04 02:30:49,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8322 conditions, 1922 events. 1006/1922 cut-off events. For 22234/22234 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 10724 event pairs, 202 based on Foata normal form. 48/1892 useless extension candidates. Maximal degree in co-relation 7777. Up to 746 conditions per place. [2025-03-04 02:30:49,018 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 108 selfloop transitions, 24 changer transitions 0/138 dead transitions. [2025-03-04 02:30:49,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 138 transitions, 1426 flow [2025-03-04 02:30:49,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:30:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:30:49,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions. [2025-03-04 02:30:49,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5074074074074074 [2025-03-04 02:30:49,019 INFO L175 Difference]: Start difference. First operand has 106 places, 74 transitions, 650 flow. Second operand 9 states and 137 transitions. [2025-03-04 02:30:49,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 138 transitions, 1426 flow [2025-03-04 02:30:49,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 138 transitions, 1186 flow, removed 84 selfloop flow, removed 12 redundant places. [2025-03-04 02:30:49,062 INFO L231 Difference]: Finished difference. Result has 105 places, 77 transitions, 574 flow [2025-03-04 02:30:49,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=574, PETRI_PLACES=105, PETRI_TRANSITIONS=77} [2025-03-04 02:30:49,063 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 76 predicate places. [2025-03-04 02:30:49,063 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 77 transitions, 574 flow [2025-03-04 02:30:49,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.785714285714286) internal successors, (137), 14 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-03-04 02:30:49,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:49,063 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:49,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 02:30:49,264 WARN L453 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-03-04 02:30:49,264 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:30:49,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:49,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1509423180, now seen corresponding path program 1 times [2025-03-04 02:30:49,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:49,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790655827] [2025-03-04 02:30:49,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:49,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:49,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 02:30:49,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:30:49,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:49,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:49,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:49,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790655827] [2025-03-04 02:30:49,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790655827] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:30:49,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242454266] [2025-03-04 02:30:49,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:49,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:49,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:49,327 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-03-04 02:30:49,329 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-03-04 02:30:49,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 02:30:49,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:30:49,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:49,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:49,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:30:49,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:30:49,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:49,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:30:49,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:49,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242454266] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:30:49,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:30:49,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 02:30:49,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154054749] [2025-03-04 02:30:49,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:30:49,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:30:49,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:49,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:30:49,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:30:49,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-04 02:30:49,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 77 transitions, 574 flow. Second operand has 14 states, 14 states have (on average 9.785714285714286) internal successors, (137), 14 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-03-04 02:30:49,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:49,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-04 02:30:49,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:49,749 INFO L124 PetriNetUnfolderBase]: 1135/2126 cut-off events. [2025-03-04 02:30:49,750 INFO L125 PetriNetUnfolderBase]: For 19339/19339 co-relation queries the response was YES. [2025-03-04 02:30:49,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8272 conditions, 2126 events. 1135/2126 cut-off events. For 19339/19339 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 11857 event pairs, 114 based on Foata normal form. 87/2141 useless extension candidates. Maximal degree in co-relation 7974. Up to 819 conditions per place. [2025-03-04 02:30:49,763 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 136 selfloop transitions, 24 changer transitions 0/166 dead transitions. [2025-03-04 02:30:49,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 166 transitions, 1535 flow [2025-03-04 02:30:49,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:30:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:30:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2025-03-04 02:30:49,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-04 02:30:49,765 INFO L175 Difference]: Start difference. First operand has 105 places, 77 transitions, 574 flow. Second operand 9 states and 144 transitions. [2025-03-04 02:30:49,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 166 transitions, 1535 flow [2025-03-04 02:30:49,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 166 transitions, 1457 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-03-04 02:30:49,801 INFO L231 Difference]: Finished difference. Result has 111 places, 80 transitions, 594 flow [2025-03-04 02:30:49,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=594, PETRI_PLACES=111, PETRI_TRANSITIONS=80} [2025-03-04 02:30:49,802 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 82 predicate places. [2025-03-04 02:30:49,802 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 80 transitions, 594 flow [2025-03-04 02:30:49,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.785714285714286) internal successors, (137), 14 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-03-04 02:30:49,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:49,802 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:49,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 02:30:50,002 WARN L453 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-03-04 02:30:50,003 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:30:50,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:50,003 INFO L85 PathProgramCache]: Analyzing trace with hash 356950695, now seen corresponding path program 2 times [2025-03-04 02:30:50,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:50,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944904681] [2025-03-04 02:30:50,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:30:50,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:50,007 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 02:30:50,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:30:50,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:30:50,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:50,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:50,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:50,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944904681] [2025-03-04 02:30:50,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944904681] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:30:50,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147095359] [2025-03-04 02:30:50,094 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:30:50,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:50,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:50,097 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-03-04 02:30:50,098 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-03-04 02:30:50,127 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 02:30:50,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:30:50,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:30:50,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:50,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:30:50,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:30:50,196 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:50,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:30:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:50,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147095359] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:30:50,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:30:50,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-04 02:30:50,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149400155] [2025-03-04 02:30:50,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:30:50,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:30:50,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:50,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:30:50,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:30:50,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-04 02:30:50,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 80 transitions, 594 flow. Second operand has 23 states, 23 states have (on average 9.304347826086957) internal successors, (214), 23 states have internal predecessors, (214), 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-03-04 02:30:50,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:50,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-04 02:30:50,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:50,948 INFO L124 PetriNetUnfolderBase]: 1759/3257 cut-off events. [2025-03-04 02:30:50,948 INFO L125 PetriNetUnfolderBase]: For 55632/55632 co-relation queries the response was YES. [2025-03-04 02:30:50,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13328 conditions, 3257 events. 1759/3257 cut-off events. For 55632/55632 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 18821 event pairs, 279 based on Foata normal form. 420/3574 useless extension candidates. Maximal degree in co-relation 10848. Up to 697 conditions per place. [2025-03-04 02:30:50,996 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 441 selfloop transitions, 46 changer transitions 0/493 dead transitions. [2025-03-04 02:30:50,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 493 transitions, 4418 flow [2025-03-04 02:30:50,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 02:30:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 02:30:50,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 410 transitions. [2025-03-04 02:30:50,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2025-03-04 02:30:50,998 INFO L175 Difference]: Start difference. First operand has 111 places, 80 transitions, 594 flow. Second operand 25 states and 410 transitions. [2025-03-04 02:30:50,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 493 transitions, 4418 flow [2025-03-04 02:30:51,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 493 transitions, 4308 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-03-04 02:30:51,068 INFO L231 Difference]: Finished difference. Result has 142 places, 98 transitions, 858 flow [2025-03-04 02:30:51,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=858, PETRI_PLACES=142, PETRI_TRANSITIONS=98} [2025-03-04 02:30:51,069 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 113 predicate places. [2025-03-04 02:30:51,069 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 98 transitions, 858 flow [2025-03-04 02:30:51,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.304347826086957) internal successors, (214), 23 states have internal predecessors, (214), 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-03-04 02:30:51,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:51,070 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:51,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 02:30:51,270 WARN L453 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-03-04 02:30:51,271 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:30:51,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:51,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1551395664, now seen corresponding path program 2 times [2025-03-04 02:30:51,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:51,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687715293] [2025-03-04 02:30:51,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:30:51,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:51,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:30:51,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:30:51,278 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:30:51,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:51,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:51,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687715293] [2025-03-04 02:30:51,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687715293] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:30:51,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305234413] [2025-03-04 02:30:51,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:30:51,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:51,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:51,356 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-03-04 02:30:51,358 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-03-04 02:30:51,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:30:51,399 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:30:51,399 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:30:51,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:51,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:30:51,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:30:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:51,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:30:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:51,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305234413] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:30:51,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:30:51,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-04 02:30:51,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733741654] [2025-03-04 02:30:51,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:30:51,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:30:51,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:51,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:30:51,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:30:51,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-04 02:30:51,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 98 transitions, 858 flow. Second operand has 23 states, 23 states have (on average 9.478260869565217) internal successors, (218), 23 states have internal predecessors, (218), 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-03-04 02:30:51,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:51,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-04 02:30:51,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:52,058 INFO L124 PetriNetUnfolderBase]: 2011/3641 cut-off events. [2025-03-04 02:30:52,058 INFO L125 PetriNetUnfolderBase]: For 88268/88268 co-relation queries the response was YES. [2025-03-04 02:30:52,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17399 conditions, 3641 events. 2011/3641 cut-off events. For 88268/88268 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 21069 event pairs, 234 based on Foata normal form. 168/3718 useless extension candidates. Maximal degree in co-relation 13509. Up to 1406 conditions per place. [2025-03-04 02:30:52,080 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 237 selfloop transitions, 36 changer transitions 0/279 dead transitions. [2025-03-04 02:30:52,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 279 transitions, 3392 flow [2025-03-04 02:30:52,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:30:52,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:30:52,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 224 transitions. [2025-03-04 02:30:52,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49777777777777776 [2025-03-04 02:30:52,082 INFO L175 Difference]: Start difference. First operand has 142 places, 98 transitions, 858 flow. Second operand 15 states and 224 transitions. [2025-03-04 02:30:52,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 279 transitions, 3392 flow [2025-03-04 02:30:52,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 279 transitions, 2600 flow, removed 312 selfloop flow, removed 12 redundant places. [2025-03-04 02:30:52,279 INFO L231 Difference]: Finished difference. Result has 150 places, 104 transitions, 836 flow [2025-03-04 02:30:52,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=836, PETRI_PLACES=150, PETRI_TRANSITIONS=104} [2025-03-04 02:30:52,280 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 121 predicate places. [2025-03-04 02:30:52,280 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 104 transitions, 836 flow [2025-03-04 02:30:52,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.478260869565217) internal successors, (218), 23 states have internal predecessors, (218), 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-03-04 02:30:52,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:52,280 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:52,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 02:30:52,480 WARN L453 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-03-04 02:30:52,481 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:30:52,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:52,481 INFO L85 PathProgramCache]: Analyzing trace with hash 849220070, now seen corresponding path program 2 times [2025-03-04 02:30:52,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:52,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910881345] [2025-03-04 02:30:52,481 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:30:52,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:52,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:30:52,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:30:52,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:30:52,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:52,587 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:52,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:52,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910881345] [2025-03-04 02:30:52,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910881345] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:30:52,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781608682] [2025-03-04 02:30:52,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:30:52,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:52,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:52,590 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-03-04 02:30:52,591 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-03-04 02:30:52,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:30:52,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:30:52,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:30:52,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:52,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:30:52,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:30:52,700 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:52,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:30:52,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:52,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781608682] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:30:52,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:30:52,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-04 02:30:52,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059154757] [2025-03-04 02:30:52,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:30:52,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:30:52,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:52,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:30:52,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:30:52,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-04 02:30:52,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 104 transitions, 836 flow. Second operand has 23 states, 23 states have (on average 9.478260869565217) internal successors, (218), 23 states have internal predecessors, (218), 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-03-04 02:30:52,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:52,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-04 02:30:52,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:53,462 INFO L124 PetriNetUnfolderBase]: 2269/4061 cut-off events. [2025-03-04 02:30:53,462 INFO L125 PetriNetUnfolderBase]: For 104835/104835 co-relation queries the response was YES. [2025-03-04 02:30:53,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17812 conditions, 4061 events. 2269/4061 cut-off events. For 104835/104835 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 23634 event pairs, 275 based on Foata normal form. 174/4150 useless extension candidates. Maximal degree in co-relation 17481. Up to 1821 conditions per place. [2025-03-04 02:30:53,486 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 256 selfloop transitions, 36 changer transitions 0/298 dead transitions. [2025-03-04 02:30:53,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 298 transitions, 2985 flow [2025-03-04 02:30:53,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:30:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:30:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 237 transitions. [2025-03-04 02:30:53,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5266666666666666 [2025-03-04 02:30:53,487 INFO L175 Difference]: Start difference. First operand has 150 places, 104 transitions, 836 flow. Second operand 15 states and 237 transitions. [2025-03-04 02:30:53,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 298 transitions, 2985 flow [2025-03-04 02:30:53,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 298 transitions, 2845 flow, removed 37 selfloop flow, removed 8 redundant places. [2025-03-04 02:30:53,689 INFO L231 Difference]: Finished difference. Result has 162 places, 110 transitions, 872 flow [2025-03-04 02:30:53,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=872, PETRI_PLACES=162, PETRI_TRANSITIONS=110} [2025-03-04 02:30:53,690 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 133 predicate places. [2025-03-04 02:30:53,690 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 110 transitions, 872 flow [2025-03-04 02:30:53,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.478260869565217) internal successors, (218), 23 states have internal predecessors, (218), 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-03-04 02:30:53,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:53,690 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:53,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 02:30:53,890 WARN L453 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-03-04 02:30:53,891 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:30:53,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:53,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1243535751, now seen corresponding path program 3 times [2025-03-04 02:30:53,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:53,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321100978] [2025-03-04 02:30:53,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:30:53,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:53,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 6 equivalence classes. [2025-03-04 02:30:53,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 18 statements. [2025-03-04 02:30:53,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:30:53,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:53,977 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:30:53,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:53,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321100978] [2025-03-04 02:30:53,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321100978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:30:53,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540599801] [2025-03-04 02:30:53,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:30:53,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:53,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:53,980 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-03-04 02:30:53,981 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-03-04 02:30:54,010 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 6 equivalence classes. [2025-03-04 02:30:54,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 18 statements. [2025-03-04 02:30:54,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:30:54,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:54,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:30:54,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:30:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:30:54,047 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:30:54,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540599801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:54,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:30:54,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-03-04 02:30:54,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892669272] [2025-03-04 02:30:54,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:54,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:30:54,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:54,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:30:54,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:30:54,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2025-03-04 02:30:54,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 110 transitions, 872 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:54,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:54,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2025-03-04 02:30:54,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:54,637 INFO L124 PetriNetUnfolderBase]: 2451/4403 cut-off events. [2025-03-04 02:30:54,638 INFO L125 PetriNetUnfolderBase]: For 98102/98102 co-relation queries the response was YES. [2025-03-04 02:30:54,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19694 conditions, 4403 events. 2451/4403 cut-off events. For 98102/98102 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 25928 event pairs, 650 based on Foata normal form. 82/4432 useless extension candidates. Maximal degree in co-relation 19027. Up to 1557 conditions per place. [2025-03-04 02:30:54,666 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 210 selfloop transitions, 32 changer transitions 7/254 dead transitions. [2025-03-04 02:30:54,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 254 transitions, 2737 flow [2025-03-04 02:30:54,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:30:54,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:30:54,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2025-03-04 02:30:54,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5407407407407407 [2025-03-04 02:30:54,670 INFO L175 Difference]: Start difference. First operand has 162 places, 110 transitions, 872 flow. Second operand 9 states and 146 transitions. [2025-03-04 02:30:54,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 254 transitions, 2737 flow [2025-03-04 02:30:54,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 254 transitions, 2347 flow, removed 148 selfloop flow, removed 8 redundant places. [2025-03-04 02:30:54,931 INFO L231 Difference]: Finished difference. Result has 164 places, 116 transitions, 964 flow [2025-03-04 02:30:54,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=964, PETRI_PLACES=164, PETRI_TRANSITIONS=116} [2025-03-04 02:30:54,932 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 135 predicate places. [2025-03-04 02:30:54,932 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 116 transitions, 964 flow [2025-03-04 02:30:54,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:54,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:54,932 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:54,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 02:30:55,133 WARN L453 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-03-04 02:30:55,133 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:30:55,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:55,134 INFO L85 PathProgramCache]: Analyzing trace with hash -622120857, now seen corresponding path program 3 times [2025-03-04 02:30:55,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:55,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421834799] [2025-03-04 02:30:55,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:30:55,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:55,139 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-03-04 02:30:55,142 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 12 of 20 statements. [2025-03-04 02:30:55,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:30:55,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:55,217 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:30:55,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:55,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421834799] [2025-03-04 02:30:55,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421834799] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:30:55,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018697471] [2025-03-04 02:30:55,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:30:55,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:55,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:55,219 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-03-04 02:30:55,221 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-03-04 02:30:55,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-03-04 02:30:55,259 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 12 of 20 statements. [2025-03-04 02:30:55,259 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:30:55,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:55,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:30:55,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:30:55,291 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:30:55,291 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:30:55,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018697471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:55,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:30:55,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-03-04 02:30:55,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953079661] [2025-03-04 02:30:55,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:55,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:30:55,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:55,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:30:55,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:30:55,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2025-03-04 02:30:55,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 116 transitions, 964 flow. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:55,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:55,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2025-03-04 02:30:55,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:55,868 INFO L124 PetriNetUnfolderBase]: 2581/4529 cut-off events. [2025-03-04 02:30:55,868 INFO L125 PetriNetUnfolderBase]: For 116732/116732 co-relation queries the response was YES. [2025-03-04 02:30:55,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20556 conditions, 4529 events. 2581/4529 cut-off events. For 116732/116732 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 25933 event pairs, 680 based on Foata normal form. 89/4616 useless extension candidates. Maximal degree in co-relation 19253. Up to 1677 conditions per place. [2025-03-04 02:30:55,888 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 104 selfloop transitions, 7 changer transitions 145/261 dead transitions. [2025-03-04 02:30:55,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 261 transitions, 2776 flow [2025-03-04 02:30:55,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:30:55,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:30:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2025-03-04 02:30:55,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5296296296296297 [2025-03-04 02:30:55,889 INFO L175 Difference]: Start difference. First operand has 164 places, 116 transitions, 964 flow. Second operand 9 states and 143 transitions. [2025-03-04 02:30:55,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 261 transitions, 2776 flow [2025-03-04 02:30:56,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 261 transitions, 2322 flow, removed 220 selfloop flow, removed 2 redundant places. [2025-03-04 02:30:56,096 INFO L231 Difference]: Finished difference. Result has 174 places, 72 transitions, 519 flow [2025-03-04 02:30:56,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=519, PETRI_PLACES=174, PETRI_TRANSITIONS=72} [2025-03-04 02:30:56,097 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 145 predicate places. [2025-03-04 02:30:56,097 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 72 transitions, 519 flow [2025-03-04 02:30:56,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:56,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:56,097 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:56,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 02:30:56,297 WARN L453 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-03-04 02:30:56,298 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:30:56,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:56,298 INFO L85 PathProgramCache]: Analyzing trace with hash 665101296, now seen corresponding path program 3 times [2025-03-04 02:30:56,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:56,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063268656] [2025-03-04 02:30:56,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:30:56,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:56,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-03-04 02:30:56,305 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:30:56,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 02:30:56,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:56,462 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:56,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:56,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063268656] [2025-03-04 02:30:56,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063268656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:30:56,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057385137] [2025-03-04 02:30:56,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:30:56,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:56,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:56,464 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-03-04 02:30:56,465 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-03-04 02:30:56,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-03-04 02:30:56,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:30:56,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 02:30:56,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:56,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 02:30:56,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:30:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:56,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:30:56,862 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:56,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057385137] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:30:56,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:30:56,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 40 [2025-03-04 02:30:56,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64963463] [2025-03-04 02:30:56,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:30:56,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-04 02:30:56,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:56,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-04 02:30:56,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=1075, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 02:30:56,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-04 02:30:56,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 72 transitions, 519 flow. Second operand has 41 states, 41 states have (on average 9.268292682926829) internal successors, (380), 41 states have internal predecessors, (380), 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-03-04 02:30:56,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:56,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-04 02:30:56,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:57,621 INFO L124 PetriNetUnfolderBase]: 1771/3205 cut-off events. [2025-03-04 02:30:57,621 INFO L125 PetriNetUnfolderBase]: For 67140/67140 co-relation queries the response was YES. [2025-03-04 02:30:57,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14164 conditions, 3205 events. 1771/3205 cut-off events. For 67140/67140 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 16184 event pairs, 421 based on Foata normal form. 336/3541 useless extension candidates. Maximal degree in co-relation 14092. Up to 1020 conditions per place. [2025-03-04 02:30:57,643 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 385 selfloop transitions, 28 changer transitions 15/434 dead transitions. [2025-03-04 02:30:57,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 434 transitions, 4558 flow [2025-03-04 02:30:57,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 02:30:57,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-04 02:30:57,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 395 transitions. [2025-03-04 02:30:57,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4876543209876543 [2025-03-04 02:30:57,644 INFO L175 Difference]: Start difference. First operand has 174 places, 72 transitions, 519 flow. Second operand 27 states and 395 transitions. [2025-03-04 02:30:57,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 434 transitions, 4558 flow [2025-03-04 02:30:57,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 434 transitions, 3461 flow, removed 524 selfloop flow, removed 16 redundant places. [2025-03-04 02:30:57,694 INFO L231 Difference]: Finished difference. Result has 171 places, 84 transitions, 644 flow [2025-03-04 02:30:57,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=644, PETRI_PLACES=171, PETRI_TRANSITIONS=84} [2025-03-04 02:30:57,694 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 142 predicate places. [2025-03-04 02:30:57,694 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 84 transitions, 644 flow [2025-03-04 02:30:57,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 9.268292682926829) internal successors, (380), 41 states have internal predecessors, (380), 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-03-04 02:30:57,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:57,695 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:57,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 02:30:57,895 WARN L453 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-03-04 02:30:57,895 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:30:57,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:57,896 INFO L85 PathProgramCache]: Analyzing trace with hash 861664358, now seen corresponding path program 3 times [2025-03-04 02:30:57,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:57,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653218538] [2025-03-04 02:30:57,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:30:57,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:57,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-03-04 02:30:57,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:30:57,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 02:30:57,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:58,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:58,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653218538] [2025-03-04 02:30:58,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653218538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:30:58,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132430524] [2025-03-04 02:30:58,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:30:58,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:58,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:58,051 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-03-04 02:30:58,052 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-03-04 02:30:58,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-03-04 02:30:58,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:30:58,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 02:30:58,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:58,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 02:30:58,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:30:58,220 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:58,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:30:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:58,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132430524] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:30:58,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:30:58,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 40 [2025-03-04 02:30:58,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537896539] [2025-03-04 02:30:58,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:30:58,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-04 02:30:58,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:58,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-04 02:30:58,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=1075, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 02:30:58,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-04 02:30:58,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 84 transitions, 644 flow. Second operand has 41 states, 41 states have (on average 9.268292682926829) internal successors, (380), 41 states have internal predecessors, (380), 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-03-04 02:30:58,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:58,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-04 02:30:58,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:59,254 INFO L124 PetriNetUnfolderBase]: 2287/4074 cut-off events. [2025-03-04 02:30:59,255 INFO L125 PetriNetUnfolderBase]: For 36013/36013 co-relation queries the response was YES. [2025-03-04 02:30:59,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17035 conditions, 4074 events. 2287/4074 cut-off events. For 36013/36013 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 20957 event pairs, 693 based on Foata normal form. 348/4422 useless extension candidates. Maximal degree in co-relation 16965. Up to 1836 conditions per place. [2025-03-04 02:30:59,282 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 423 selfloop transitions, 28 changer transitions 14/471 dead transitions. [2025-03-04 02:30:59,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 471 transitions, 3778 flow [2025-03-04 02:30:59,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 02:30:59,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-04 02:30:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 420 transitions. [2025-03-04 02:30:59,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-03-04 02:30:59,283 INFO L175 Difference]: Start difference. First operand has 171 places, 84 transitions, 644 flow. Second operand 27 states and 420 transitions. [2025-03-04 02:30:59,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 471 transitions, 3778 flow [2025-03-04 02:30:59,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 471 transitions, 3618 flow, removed 61 selfloop flow, removed 14 redundant places. [2025-03-04 02:30:59,355 INFO L231 Difference]: Finished difference. Result has 195 places, 96 transitions, 716 flow [2025-03-04 02:30:59,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=716, PETRI_PLACES=195, PETRI_TRANSITIONS=96} [2025-03-04 02:30:59,355 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 166 predicate places. [2025-03-04 02:30:59,355 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 96 transitions, 716 flow [2025-03-04 02:30:59,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 9.268292682926829) internal successors, (380), 41 states have internal predecessors, (380), 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-03-04 02:30:59,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:59,356 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:59,362 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-03-04 02:30:59,556 WARN L453 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-03-04 02:30:59,556 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:30:59,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:59,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1778728026, now seen corresponding path program 4 times [2025-03-04 02:30:59,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:59,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241367727] [2025-03-04 02:30:59,557 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:30:59,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:59,560 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-04 02:30:59,565 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:30:59,565 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:30:59,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:31:00,024 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:31:00,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:31:00,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241367727] [2025-03-04 02:31:00,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241367727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:31:00,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223451321] [2025-03-04 02:31:00,024 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:31:00,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:31:00,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:31:00,027 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-03-04 02:31:00,029 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-03-04 02:31:00,063 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-04 02:31:00,076 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:31:00,077 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:31:00,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:31:00,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 02:31:00,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:31:00,409 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:31:00,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:31:01,046 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:31:01,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223451321] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:31:01,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:31:01,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 76 [2025-03-04 02:31:01,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285035094] [2025-03-04 02:31:01,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:31:01,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2025-03-04 02:31:01,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:31:01,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2025-03-04 02:31:01,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2247, Invalid=3605, Unknown=0, NotChecked=0, Total=5852 [2025-03-04 02:31:01,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-04 02:31:01,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 96 transitions, 716 flow. Second operand has 77 states, 77 states have (on average 9.142857142857142) internal successors, (704), 77 states have internal predecessors, (704), 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-03-04 02:31:01,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:31:01,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-04 02:31:01,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:31:02,895 INFO L124 PetriNetUnfolderBase]: 3295/5752 cut-off events. [2025-03-04 02:31:02,896 INFO L125 PetriNetUnfolderBase]: For 187596/187596 co-relation queries the response was YES. [2025-03-04 02:31:02,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23864 conditions, 5752 events. 3295/5752 cut-off events. For 187596/187596 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 28377 event pairs, 745 based on Foata normal form. 672/6424 useless extension candidates. Maximal degree in co-relation 23782. Up to 1884 conditions per place. [2025-03-04 02:31:02,930 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 757 selfloop transitions, 52 changer transitions 15/830 dead transitions. [2025-03-04 02:31:02,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 830 transitions, 6813 flow [2025-03-04 02:31:02,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-04 02:31:02,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2025-03-04 02:31:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 743 transitions. [2025-03-04 02:31:02,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48562091503267973 [2025-03-04 02:31:02,932 INFO L175 Difference]: Start difference. First operand has 195 places, 96 transitions, 716 flow. Second operand 51 states and 743 transitions. [2025-03-04 02:31:02,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 830 transitions, 6813 flow [2025-03-04 02:31:03,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 830 transitions, 6653 flow, removed 61 selfloop flow, removed 14 redundant places. [2025-03-04 02:31:03,085 INFO L231 Difference]: Finished difference. Result has 255 places, 120 transitions, 1004 flow [2025-03-04 02:31:03,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=1004, PETRI_PLACES=255, PETRI_TRANSITIONS=120} [2025-03-04 02:31:03,088 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 226 predicate places. [2025-03-04 02:31:03,088 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 120 transitions, 1004 flow [2025-03-04 02:31:03,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 9.142857142857142) internal successors, (704), 77 states have internal predecessors, (704), 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-03-04 02:31:03,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:31:03,089 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:31:03,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 02:31:03,289 WARN L453 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-03-04 02:31:03,290 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:31:03,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:31:03,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1815213468, now seen corresponding path program 4 times [2025-03-04 02:31:03,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:31:03,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807937884] [2025-03-04 02:31:03,291 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:31:03,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:31:03,296 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-04 02:31:03,302 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:31:03,303 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:31:03,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:31:03,741 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:31:03,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:31:03,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807937884] [2025-03-04 02:31:03,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807937884] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:31:03,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463414371] [2025-03-04 02:31:03,742 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:31:03,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:31:03,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:31:03,744 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-03-04 02:31:03,745 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-03-04 02:31:03,774 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-04 02:31:03,788 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:31:03,788 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:31:03,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:31:03,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 02:31:03,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:31:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:31:04,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:31:04,666 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:31:04,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463414371] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:31:04,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:31:04,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 77 [2025-03-04 02:31:04,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792538101] [2025-03-04 02:31:04,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:31:04,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2025-03-04 02:31:04,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:31:04,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2025-03-04 02:31:04,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2253, Invalid=3753, Unknown=0, NotChecked=0, Total=6006 [2025-03-04 02:31:04,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-04 02:31:04,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 120 transitions, 1004 flow. Second operand has 78 states, 78 states have (on average 9.166666666666666) internal successors, (715), 78 states have internal predecessors, (715), 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-03-04 02:31:04,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:31:04,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-04 02:31:04,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:31:07,029 INFO L124 PetriNetUnfolderBase]: 4327/7482 cut-off events. [2025-03-04 02:31:07,029 INFO L125 PetriNetUnfolderBase]: For 219479/219479 co-relation queries the response was YES. [2025-03-04 02:31:07,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32071 conditions, 7482 events. 4327/7482 cut-off events. For 219479/219479 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 38123 event pairs, 1317 based on Foata normal form. 696/8178 useless extension candidates. Maximal degree in co-relation 31965. Up to 3516 conditions per place. [2025-03-04 02:31:07,086 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 831 selfloop transitions, 52 changer transitions 14/903 dead transitions. [2025-03-04 02:31:07,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 903 transitions, 7258 flow [2025-03-04 02:31:07,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-04 02:31:07,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2025-03-04 02:31:07,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 792 transitions. [2025-03-04 02:31:07,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5176470588235295 [2025-03-04 02:31:07,088 INFO L175 Difference]: Start difference. First operand has 255 places, 120 transitions, 1004 flow. Second operand 51 states and 792 transitions. [2025-03-04 02:31:07,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 903 transitions, 7258 flow [2025-03-04 02:31:07,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 903 transitions, 6954 flow, removed 121 selfloop flow, removed 26 redundant places. [2025-03-04 02:31:07,308 INFO L231 Difference]: Finished difference. Result has 303 places, 144 transitions, 1148 flow [2025-03-04 02:31:07,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=1148, PETRI_PLACES=303, PETRI_TRANSITIONS=144} [2025-03-04 02:31:07,309 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 274 predicate places. [2025-03-04 02:31:07,309 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 144 transitions, 1148 flow [2025-03-04 02:31:07,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 9.166666666666666) internal successors, (715), 78 states have internal predecessors, (715), 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-03-04 02:31:07,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:31:07,309 INFO L206 CegarLoopForPetriNet]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:31:07,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 02:31:07,509 WARN L453 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-03-04 02:31:07,510 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:31:07,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:31:07,510 INFO L85 PathProgramCache]: Analyzing trace with hash -492020058, now seen corresponding path program 5 times [2025-03-04 02:31:07,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:31:07,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057294016] [2025-03-04 02:31:07,511 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:31:07,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:31:07,516 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 24 equivalence classes. [2025-03-04 02:31:07,530 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 02:31:07,530 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-03-04 02:31:07,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:31:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:31:08,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:31:08,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057294016] [2025-03-04 02:31:08,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057294016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:31:08,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113206792] [2025-03-04 02:31:08,668 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:31:08,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:31:08,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:31:08,670 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-03-04 02:31:08,671 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-03-04 02:31:08,705 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 24 equivalence classes. [2025-03-04 02:31:08,732 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 02:31:08,733 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-03-04 02:31:08,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:31:08,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 02:31:08,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:31:09,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:31:09,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:31:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:31:12,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113206792] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:31:12,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:31:12,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 148 [2025-03-04 02:31:12,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117233130] [2025-03-04 02:31:12,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:31:12,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 149 states [2025-03-04 02:31:12,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:31:12,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2025-03-04 02:31:12,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9087, Invalid=12965, Unknown=0, NotChecked=0, Total=22052 [2025-03-04 02:31:12,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-04 02:31:12,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 144 transitions, 1148 flow. Second operand has 149 states, 149 states have (on average 9.073825503355705) internal successors, (1352), 149 states have internal predecessors, (1352), 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-03-04 02:31:12,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:31:12,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-04 02:31:12,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:31:19,347 INFO L124 PetriNetUnfolderBase]: 6343/10840 cut-off events. [2025-03-04 02:31:19,347 INFO L125 PetriNetUnfolderBase]: For 1486186/1486186 co-relation queries the response was YES. [2025-03-04 02:31:19,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45728 conditions, 10840 events. 6343/10840 cut-off events. For 1486186/1486186 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 52542 event pairs, 1393 based on Foata normal form. 1344/12184 useless extension candidates. Maximal degree in co-relation 45598. Up to 3612 conditions per place. [2025-03-04 02:31:19,515 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 1501 selfloop transitions, 100 changer transitions 15/1622 dead transitions. [2025-03-04 02:31:19,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 1622 transitions, 13341 flow [2025-03-04 02:31:19,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-03-04 02:31:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2025-03-04 02:31:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 1439 transitions. [2025-03-04 02:31:19,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4845117845117845 [2025-03-04 02:31:19,518 INFO L175 Difference]: Start difference. First operand has 303 places, 144 transitions, 1148 flow. Second operand 99 states and 1439 transitions. [2025-03-04 02:31:19,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 1622 transitions, 13341 flow [2025-03-04 02:31:19,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 1622 transitions, 13037 flow, removed 121 selfloop flow, removed 26 redundant places. [2025-03-04 02:31:19,964 INFO L231 Difference]: Finished difference. Result has 423 places, 192 transitions, 1724 flow [2025-03-04 02:31:19,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=99, PETRI_FLOW=1724, PETRI_PLACES=423, PETRI_TRANSITIONS=192} [2025-03-04 02:31:19,964 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 394 predicate places. [2025-03-04 02:31:19,964 INFO L471 AbstractCegarLoop]: Abstraction has has 423 places, 192 transitions, 1724 flow [2025-03-04 02:31:19,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 149 states, 149 states have (on average 9.073825503355705) internal successors, (1352), 149 states have internal predecessors, (1352), 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-03-04 02:31:19,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:31:19,965 INFO L206 CegarLoopForPetriNet]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:31:19,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 02:31:20,166 WARN L453 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-03-04 02:31:20,166 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:31:20,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:31:20,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1361437542, now seen corresponding path program 5 times [2025-03-04 02:31:20,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:31:20,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91906901] [2025-03-04 02:31:20,167 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:31:20,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:31:20,171 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 24 equivalence classes. [2025-03-04 02:31:20,184 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 02:31:20,184 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-03-04 02:31:20,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:31:21,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:31:21,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:31:21,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91906901] [2025-03-04 02:31:21,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91906901] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:31:21,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996991964] [2025-03-04 02:31:21,611 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:31:21,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:31:21,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:31:21,613 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-03-04 02:31:21,615 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-03-04 02:31:21,645 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 24 equivalence classes. [2025-03-04 02:31:21,665 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 02:31:21,665 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-03-04 02:31:21,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:31:21,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 02:31:21,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:31:22,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:31:22,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:31:24,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:31:24,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996991964] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:31:24,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:31:24,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 148 [2025-03-04 02:31:24,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381310804] [2025-03-04 02:31:24,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:31:24,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 149 states [2025-03-04 02:31:24,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:31:24,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2025-03-04 02:31:24,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9087, Invalid=12965, Unknown=0, NotChecked=0, Total=22052 [2025-03-04 02:31:24,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-04 02:31:24,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 192 transitions, 1724 flow. Second operand has 149 states, 149 states have (on average 9.073825503355705) internal successors, (1352), 149 states have internal predecessors, (1352), 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-03-04 02:31:24,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:31:24,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-04 02:31:24,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:31:33,380 INFO L124 PetriNetUnfolderBase]: 8407/14298 cut-off events. [2025-03-04 02:31:33,380 INFO L125 PetriNetUnfolderBase]: For 1637099/1637099 co-relation queries the response was YES. [2025-03-04 02:31:33,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62143 conditions, 14298 events. 8407/14298 cut-off events. For 1637099/1637099 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 72419 event pairs, 2565 based on Foata normal form. 1392/15690 useless extension candidates. Maximal degree in co-relation 61965. Up to 6876 conditions per place. [2025-03-04 02:31:33,597 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 1647 selfloop transitions, 100 changer transitions 14/1767 dead transitions. [2025-03-04 02:31:33,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 1767 transitions, 14218 flow [2025-03-04 02:31:33,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-03-04 02:31:33,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2025-03-04 02:31:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 1536 transitions. [2025-03-04 02:31:33,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5171717171717172 [2025-03-04 02:31:33,604 INFO L175 Difference]: Start difference. First operand has 423 places, 192 transitions, 1724 flow. Second operand 99 states and 1536 transitions. [2025-03-04 02:31:33,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 1767 transitions, 14218 flow [2025-03-04 02:31:34,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 1767 transitions, 13626 flow, removed 241 selfloop flow, removed 50 redundant places. [2025-03-04 02:31:34,632 INFO L231 Difference]: Finished difference. Result has 519 places, 240 transitions, 2012 flow [2025-03-04 02:31:34,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=99, PETRI_FLOW=2012, PETRI_PLACES=519, PETRI_TRANSITIONS=240} [2025-03-04 02:31:34,633 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 490 predicate places. [2025-03-04 02:31:34,633 INFO L471 AbstractCegarLoop]: Abstraction has has 519 places, 240 transitions, 2012 flow [2025-03-04 02:31:34,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 149 states, 149 states have (on average 9.073825503355705) internal successors, (1352), 149 states have internal predecessors, (1352), 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-03-04 02:31:34,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:31:34,634 INFO L206 CegarLoopForPetriNet]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:31:34,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 02:31:34,834 WARN L453 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-03-04 02:31:34,835 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:31:34,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:31:34,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1041460058, now seen corresponding path program 6 times [2025-03-04 02:31:34,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:31:34,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142794938] [2025-03-04 02:31:34,836 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:31:34,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:31:34,843 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 106 statements into 48 equivalence classes. [2025-03-04 02:31:34,868 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 02:31:34,869 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-03-04 02:31:34,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:31:38,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:31:38,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:31:38,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142794938] [2025-03-04 02:31:38,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142794938] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:31:38,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805439774] [2025-03-04 02:31:38,345 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:31:38,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:31:38,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:31:38,347 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-03-04 02:31:38,347 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-03-04 02:31:38,387 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 106 statements into 48 equivalence classes. [2025-03-04 02:31:38,434 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 02:31:38,434 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-03-04 02:31:38,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:31:38,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-03-04 02:31:38,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:31:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:31:41,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:31:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:31:45,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805439774] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:31:45,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:31:45,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 203 [2025-03-04 02:31:45,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353900624] [2025-03-04 02:31:45,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:31:45,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 204 states [2025-03-04 02:31:45,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:31:45,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2025-03-04 02:31:45,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=26265, Unknown=0, NotChecked=0, Total=41412 [2025-03-04 02:31:45,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-04 02:31:45,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 240 transitions, 2012 flow. Second operand has 204 states, 204 states have (on average 9.058823529411764) internal successors, (1848), 204 states have internal predecessors, (1848), 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-03-04 02:31:45,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:31:45,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-04 02:31:45,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:31:56,799 INFO L124 PetriNetUnfolderBase]: 8701/14786 cut-off events. [2025-03-04 02:31:56,799 INFO L125 PetriNetUnfolderBase]: For 1157486/1157486 co-relation queries the response was YES. [2025-03-04 02:31:56,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61866 conditions, 14786 events. 8701/14786 cut-off events. For 1157486/1157486 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 74749 event pairs, 2689 based on Foata normal form. 196/14982 useless extension candidates. Maximal degree in co-relation 61640. Up to 7068 conditions per place. [2025-03-04 02:31:56,997 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 1654 selfloop transitions, 107 changer transitions 15/1782 dead transitions. [2025-03-04 02:31:56,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 1782 transitions, 14738 flow [2025-03-04 02:31:56,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-03-04 02:31:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2025-03-04 02:31:56,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 1496 transitions. [2025-03-04 02:31:56,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47044025157232705 [2025-03-04 02:31:56,999 INFO L175 Difference]: Start difference. First operand has 519 places, 240 transitions, 2012 flow. Second operand 106 states and 1496 transitions. [2025-03-04 02:31:56,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 1782 transitions, 14738 flow [2025-03-04 02:31:58,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 1782 transitions, 14146 flow, removed 241 selfloop flow, removed 50 redundant places. [2025-03-04 02:31:58,524 INFO L231 Difference]: Finished difference. Result has 581 places, 247 transitions, 1740 flow [2025-03-04 02:31:58,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=106, PETRI_FLOW=1740, PETRI_PLACES=581, PETRI_TRANSITIONS=247} [2025-03-04 02:31:58,525 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 552 predicate places. [2025-03-04 02:31:58,525 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 247 transitions, 1740 flow [2025-03-04 02:31:58,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 204 states, 204 states have (on average 9.058823529411764) internal successors, (1848), 204 states have internal predecessors, (1848), 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-03-04 02:31:58,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:31:58,526 INFO L206 CegarLoopForPetriNet]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:31:58,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 02:31:58,730 WARN L453 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-03-04 02:31:58,730 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:31:58,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:31:58,731 INFO L85 PathProgramCache]: Analyzing trace with hash -365987994, now seen corresponding path program 6 times [2025-03-04 02:31:58,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:31:58,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568293030] [2025-03-04 02:31:58,732 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:31:58,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:31:58,737 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 106 statements into 48 equivalence classes. [2025-03-04 02:31:58,765 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 02:31:58,765 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-03-04 02:31:58,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:32:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:32:02,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:32:02,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568293030] [2025-03-04 02:32:02,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568293030] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:32:02,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914494876] [2025-03-04 02:32:02,143 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:32:02,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:32:02,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:32:02,145 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-03-04 02:32:02,146 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-03-04 02:32:02,184 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 106 statements into 48 equivalence classes. [2025-03-04 02:32:02,225 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 02:32:02,225 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-03-04 02:32:02,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:32:02,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-03-04 02:32:02,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:32:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:32:05,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:32:08,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:32:08,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914494876] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:32:08,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:32:08,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 202 [2025-03-04 02:32:08,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954950339] [2025-03-04 02:32:08,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:32:08,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 203 states [2025-03-04 02:32:08,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:32:08,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2025-03-04 02:32:08,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14950, Invalid=26056, Unknown=0, NotChecked=0, Total=41006 [2025-03-04 02:32:08,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-04 02:32:08,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 247 transitions, 1740 flow. Second operand has 203 states, 203 states have (on average 9.05911330049261) internal successors, (1839), 203 states have internal predecessors, (1839), 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-03-04 02:32:08,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:32:08,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-04 02:32:08,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand