./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/29_conditionals_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/29_conditionals_vs.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 c3f647420f42d7fdb333957b618cdd528a4c5a4cecdb35105a1a2630df70b3d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:56:51,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:56:51,577 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 00:56:51,581 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:56:51,581 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:56:51,606 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:56:51,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:56:51,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:56:51,608 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:56:51,608 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:56:51,609 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:56:51,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:56:51,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:56:51,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:56:51,610 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:56:51,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:56:51,611 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:56:51,611 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 00:56:51,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:56:51,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 00:56:51,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:56:51,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:56:51,611 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:56:51,611 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:56:51,611 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 00:56:51,612 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:56:51,612 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:56:51,612 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:56:51,612 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:56:51,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:56:51,612 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:56:51,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:56:51,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:56:51,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:56:51,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:56:51,612 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:56:51,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:56:51,612 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:56:51,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:56:51,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:56:51,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:56:51,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:56:51,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:56:51,613 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-jdk21/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 -> c3f647420f42d7fdb333957b618cdd528a4c5a4cecdb35105a1a2630df70b3d6 [2025-02-08 00:56:51,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:56:51,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:56:51,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:56:51,918 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:56:51,919 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:56:51,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/29_conditionals_vs.i [2025-02-08 00:56:53,300 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fe2ae38c1/556ab286ec524a23ab8ecaf897b158d9/FLAG250864a99 [2025-02-08 00:56:53,600 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:56:53,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/29_conditionals_vs.i [2025-02-08 00:56:53,614 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fe2ae38c1/556ab286ec524a23ab8ecaf897b158d9/FLAG250864a99 [2025-02-08 00:56:53,634 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fe2ae38c1/556ab286ec524a23ab8ecaf897b158d9 [2025-02-08 00:56:53,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:56:53,638 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:56:53,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:56:53,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:56:53,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:56:53,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:56:53" (1/1) ... [2025-02-08 00:56:53,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a1f8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:53, skipping insertion in model container [2025-02-08 00:56:53,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:56:53" (1/1) ... [2025-02-08 00:56:53,680 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:56:53,933 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/29_conditionals_vs.i[30422,30435] [2025-02-08 00:56:53,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:56:53,949 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:56:54,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/29_conditionals_vs.i[30422,30435] [2025-02-08 00:56:54,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:56:54,037 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:56:54,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:54 WrapperNode [2025-02-08 00:56:54,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:56:54,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:56:54,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:56:54,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:56:54,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:54" (1/1) ... [2025-02-08 00:56:54,058 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:54" (1/1) ... [2025-02-08 00:56:54,075 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 55 [2025-02-08 00:56:54,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:56:54,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:56:54,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:56:54,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:56:54,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:54" (1/1) ... [2025-02-08 00:56:54,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:54" (1/1) ... [2025-02-08 00:56:54,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:54" (1/1) ... [2025-02-08 00:56:54,108 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-02-08 00:56:54,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:54" (1/1) ... [2025-02-08 00:56:54,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:54" (1/1) ... [2025-02-08 00:56:54,112 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:54" (1/1) ... [2025-02-08 00:56:54,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:54" (1/1) ... [2025-02-08 00:56:54,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:54" (1/1) ... [2025-02-08 00:56:54,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:54" (1/1) ... [2025-02-08 00:56:54,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:56:54,123 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:56:54,123 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:56:54,123 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:56:54,124 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:54" (1/1) ... [2025-02-08 00:56:54,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:56:54,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:56:54,157 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:56:54,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:56:54,181 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 00:56:54,181 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 00:56:54,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:56:54,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:56:54,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:56:54,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:56:54,183 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 00:56:54,275 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:56:54,276 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:56:54,432 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 00:56:54,436 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:56:54,542 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:56:54,542 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:56:54,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:56:54 BoogieIcfgContainer [2025-02-08 00:56:54,543 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:56:54,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:56:54,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:56:54,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:56:54,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:56:53" (1/3) ... [2025-02-08 00:56:54,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e3275b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:56:54, skipping insertion in model container [2025-02-08 00:56:54,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:54" (2/3) ... [2025-02-08 00:56:54,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e3275b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:56:54, skipping insertion in model container [2025-02-08 00:56:54,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:56:54" (3/3) ... [2025-02-08 00:56:54,554 INFO L128 eAbstractionObserver]: Analyzing ICFG 29_conditionals_vs.i [2025-02-08 00:56:54,570 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:56:54,572 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 29_conditionals_vs.i that has 2 procedures, 17 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:56:54,572 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 00:56:54,621 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:56:54,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 19 transitions, 42 flow [2025-02-08 00:56:54,685 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2025-02-08 00:56:54,690 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 00:56:54,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 21 events. 2/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 16. Up to 3 conditions per place. [2025-02-08 00:56:54,696 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 19 transitions, 42 flow [2025-02-08 00:56:54,698 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 19 transitions, 42 flow [2025-02-08 00:56:54,708 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:56:54,720 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;@6c004fda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:56:54,721 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-08 00:56:54,729 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:56:54,730 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-02-08 00:56:54,730 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 00:56:54,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:56:54,732 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 00:56:54,732 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:56:54,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:56:54,737 INFO L85 PathProgramCache]: Analyzing trace with hash 121248863, now seen corresponding path program 1 times [2025-02-08 00:56:54,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:56:54,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479033132] [2025-02-08 00:56:54,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:56:54,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:56:54,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 00:56:54,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 00:56:54,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:56:54,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:56:54,839 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:56:54,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 00:56:54,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 00:56:54,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:56:54,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:56:54,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:56:54,877 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:56:54,878 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-02-08 00:56:54,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-02-08 00:56:54,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-02-08 00:56:54,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:56:54,881 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-02-08 00:56:54,887 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 00:56:54,887 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 00:56:54,918 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:56:54,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 76 flow [2025-02-08 00:56:54,937 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2025-02-08 00:56:54,937 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 00:56:54,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 38 events. 4/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 77 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 29. Up to 3 conditions per place. [2025-02-08 00:56:54,938 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 33 transitions, 76 flow [2025-02-08 00:56:54,938 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 33 transitions, 76 flow [2025-02-08 00:56:54,939 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:56:54,940 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;@6c004fda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:56:54,940 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 00:56:54,946 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:56:54,947 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2025-02-08 00:56:54,947 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 00:56:54,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:56:54,947 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:56:54,947 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-08 00:56:54,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:56:54,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1950245792, now seen corresponding path program 1 times [2025-02-08 00:56:54,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:56:54,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398407996] [2025-02-08 00:56:54,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:56:54,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:56:54,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 00:56:54,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 00:56:54,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:56:54,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:56:55,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:56:55,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:56:55,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398407996] [2025-02-08 00:56:55,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398407996] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:56:55,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:56:55,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:56:55,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742162562] [2025-02-08 00:56:55,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:56:55,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:56:55,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:56:55,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:56:55,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:56:55,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2025-02-08 00:56:55,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-02-08 00:56:55,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:56:55,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2025-02-08 00:56:55,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:56:55,486 INFO L124 PetriNetUnfolderBase]: 379/711 cut-off events. [2025-02-08 00:56:55,486 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-02-08 00:56:55,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1401 conditions, 711 events. 379/711 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3472 event pairs, 70 based on Foata normal form. 36/675 useless extension candidates. Maximal degree in co-relation 975. Up to 255 conditions per place. [2025-02-08 00:56:55,500 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 35 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2025-02-08 00:56:55,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 46 transitions, 188 flow [2025-02-08 00:56:55,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:56:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 00:56:55,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2025-02-08 00:56:55,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-02-08 00:56:55,515 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 76 flow. Second operand 4 states and 81 transitions. [2025-02-08 00:56:55,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 46 transitions, 188 flow [2025-02-08 00:56:55,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 00:56:55,524 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 72 flow [2025-02-08 00:56:55,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2025-02-08 00:56:55,531 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2025-02-08 00:56:55,531 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 72 flow [2025-02-08 00:56:55,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-02-08 00:56:55,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:56:55,532 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-02-08 00:56:55,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:56:55,533 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-08 00:56:55,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:56:55,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1071407544, now seen corresponding path program 1 times [2025-02-08 00:56:55,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:56:55,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585446093] [2025-02-08 00:56:55,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:56:55,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:56:55,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 00:56:55,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 00:56:55,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:56:55,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:56:55,558 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:56:55,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 00:56:55,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 00:56:55,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:56:55,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:56:55,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:56:55,574 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:56:55,574 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-02-08 00:56:55,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-02-08 00:56:55,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-02-08 00:56:55,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-02-08 00:56:55,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:56:55,575 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 00:56:55,576 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 00:56:55,576 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 00:56:55,596 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:56:55,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 47 transitions, 112 flow [2025-02-08 00:56:55,608 INFO L124 PetriNetUnfolderBase]: 6/55 cut-off events. [2025-02-08 00:56:55,608 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 00:56:55,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 6/55 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 132 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2025-02-08 00:56:55,610 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 47 transitions, 112 flow [2025-02-08 00:56:55,610 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 47 transitions, 112 flow [2025-02-08 00:56:55,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:56:55,612 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;@6c004fda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:56:55,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 00:56:55,616 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:56:55,616 INFO L124 PetriNetUnfolderBase]: 2/26 cut-off events. [2025-02-08 00:56:55,616 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 00:56:55,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:56:55,616 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:56:55,616 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 00:56:55,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:56:55,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2013007516, now seen corresponding path program 1 times [2025-02-08 00:56:55,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:56:55,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420572023] [2025-02-08 00:56:55,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:56:55,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:56:55,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 00:56:55,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 00:56:55,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:56:55,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:56:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:56:55,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:56:55,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420572023] [2025-02-08 00:56:55,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420572023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:56:55,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:56:55,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:56:55,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877579863] [2025-02-08 00:56:55,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:56:55,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:56:55,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:56:55,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:56:55,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:56:55,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2025-02-08 00:56:55,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-02-08 00:56:55,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:56:55,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2025-02-08 00:56:55,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:56:56,483 INFO L124 PetriNetUnfolderBase]: 3679/5745 cut-off events. [2025-02-08 00:56:56,484 INFO L125 PetriNetUnfolderBase]: For 521/521 co-relation queries the response was YES. [2025-02-08 00:56:56,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11398 conditions, 5745 events. 3679/5745 cut-off events. For 521/521 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 34571 event pairs, 736 based on Foata normal form. 453/5697 useless extension candidates. Maximal degree in co-relation 5088. Up to 2085 conditions per place. [2025-02-08 00:56:56,531 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 53 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2025-02-08 00:56:56,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 296 flow [2025-02-08 00:56:56,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:56:56,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 00:56:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2025-02-08 00:56:56,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6914893617021277 [2025-02-08 00:56:56,534 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 112 flow. Second operand 4 states and 130 transitions. [2025-02-08 00:56:56,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 296 flow [2025-02-08 00:56:56,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 71 transitions, 290 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 00:56:56,538 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 104 flow [2025-02-08 00:56:56,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2025-02-08 00:56:56,540 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2025-02-08 00:56:56,540 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 104 flow [2025-02-08 00:56:56,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-02-08 00:56:56,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:56:56,542 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-02-08 00:56:56,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:56:56,542 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 00:56:56,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:56:56,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1817735074, now seen corresponding path program 1 times [2025-02-08 00:56:56,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:56:56,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354410578] [2025-02-08 00:56:56,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:56:56,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:56:56,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 00:56:56,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 00:56:56,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:56:56,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:56:56,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:56:56,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 00:56:56,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 00:56:56,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:56:56,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:56:56,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:56:56,593 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:56:56,593 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-08 00:56:56,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-02-08 00:56:56,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-02-08 00:56:56,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-02-08 00:56:56,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-02-08 00:56:56,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:56:56,594 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 00:56:56,595 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 00:56:56,595 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 00:56:56,632 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:56:56,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 61 transitions, 150 flow [2025-02-08 00:56:56,644 INFO L124 PetriNetUnfolderBase]: 8/72 cut-off events. [2025-02-08 00:56:56,644 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 00:56:56,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 72 events. 8/72 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 182 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 67. Up to 5 conditions per place. [2025-02-08 00:56:56,645 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 61 transitions, 150 flow [2025-02-08 00:56:56,645 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 61 transitions, 150 flow [2025-02-08 00:56:56,647 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:56:56,648 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;@6c004fda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:56:56,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 00:56:56,651 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:56:56,651 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2025-02-08 00:56:56,652 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 00:56:56,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:56:56,652 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:56:56,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-08 00:56:56,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:56:56,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1509654406, now seen corresponding path program 1 times [2025-02-08 00:56:56,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:56:56,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439136442] [2025-02-08 00:56:56,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:56:56,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:56:56,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 00:56:56,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 00:56:56,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:56:56,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:56:56,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:56:56,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:56:56,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439136442] [2025-02-08 00:56:56,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439136442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:56:56,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:56:56,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:56:56,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608922659] [2025-02-08 00:56:56,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:56:56,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:56:56,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:56:56,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:56:56,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:56:56,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-02-08 00:56:56,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-02-08 00:56:56,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:56:56,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-02-08 00:56:56,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:57:00,078 INFO L124 PetriNetUnfolderBase]: 30490/42906 cut-off events. [2025-02-08 00:57:00,079 INFO L125 PetriNetUnfolderBase]: For 5408/5408 co-relation queries the response was YES. [2025-02-08 00:57:00,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85820 conditions, 42906 events. 30490/42906 cut-off events. For 5408/5408 co-relation queries the response was YES. Maximal size of possible extension queue 1580. Compared 287036 event pairs, 6352 based on Foata normal form. 4352/44203 useless extension candidates. Maximal degree in co-relation 11739. Up to 15765 conditions per place. [2025-02-08 00:57:00,413 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 71 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2025-02-08 00:57:00,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 96 transitions, 410 flow [2025-02-08 00:57:00,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:57:00,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 00:57:00,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2025-02-08 00:57:00,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7336065573770492 [2025-02-08 00:57:00,415 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 150 flow. Second operand 4 states and 179 transitions. [2025-02-08 00:57:00,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 96 transitions, 410 flow [2025-02-08 00:57:00,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 96 transitions, 392 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-02-08 00:57:00,422 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 136 flow [2025-02-08 00:57:00,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2025-02-08 00:57:00,424 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2025-02-08 00:57:00,424 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 136 flow [2025-02-08 00:57:00,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-02-08 00:57:00,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:57:00,425 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:57:00,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:57:00,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-08 00:57:00,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:57:00,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1375951513, now seen corresponding path program 1 times [2025-02-08 00:57:00,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:57:00,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174334737] [2025-02-08 00:57:00,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:57:00,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:57:00,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 00:57:00,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 00:57:00,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:57:00,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:57:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:57:00,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:57:00,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174334737] [2025-02-08 00:57:00,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174334737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:57:00,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:57:00,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:57:00,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154159491] [2025-02-08 00:57:00,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:57:00,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:57:00,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:57:00,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:57:00,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:57:00,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-02-08 00:57:00,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-02-08 00:57:00,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:57:00,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-02-08 00:57:00,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:57:03,360 INFO L124 PetriNetUnfolderBase]: 41185/57753 cut-off events. [2025-02-08 00:57:03,360 INFO L125 PetriNetUnfolderBase]: For 4271/4271 co-relation queries the response was YES. [2025-02-08 00:57:03,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115785 conditions, 57753 events. 41185/57753 cut-off events. For 4271/4271 co-relation queries the response was YES. Maximal size of possible extension queue 2263. Compared 400026 event pairs, 8611 based on Foata normal form. 0/52062 useless extension candidates. Maximal degree in co-relation 86256. Up to 21195 conditions per place. [2025-02-08 00:57:03,684 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 69 selfloop transitions, 3 changer transitions 0/92 dead transitions. [2025-02-08 00:57:03,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 92 transitions, 380 flow [2025-02-08 00:57:03,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:57:03,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 00:57:03,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2025-02-08 00:57:03,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6762295081967213 [2025-02-08 00:57:03,687 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 136 flow. Second operand 4 states and 165 transitions. [2025-02-08 00:57:03,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 92 transitions, 380 flow [2025-02-08 00:57:03,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 92 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 00:57:03,699 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 134 flow [2025-02-08 00:57:03,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2025-02-08 00:57:03,700 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2025-02-08 00:57:03,701 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 134 flow [2025-02-08 00:57:03,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-02-08 00:57:03,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:57:03,701 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2025-02-08 00:57:03,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:57:03,702 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-08 00:57:03,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:57:03,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1647969571, now seen corresponding path program 1 times [2025-02-08 00:57:03,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:57:03,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803379063] [2025-02-08 00:57:03,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:57:03,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:57:03,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 00:57:03,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 00:57:03,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:57:03,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:57:03,722 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:57:03,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 00:57:03,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 00:57:03,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:57:03,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:57:03,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:57:03,741 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:57:03,742 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-08 00:57:03,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-02-08 00:57:03,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-02-08 00:57:03,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-02-08 00:57:03,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-02-08 00:57:03,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-02-08 00:57:03,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:57:03,743 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 00:57:03,743 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 00:57:03,744 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-02-08 00:57:03,776 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:57:03,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 75 transitions, 190 flow [2025-02-08 00:57:03,783 INFO L124 PetriNetUnfolderBase]: 10/89 cut-off events. [2025-02-08 00:57:03,783 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-08 00:57:03,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 89 events. 10/89 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 253 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 90. Up to 6 conditions per place. [2025-02-08 00:57:03,784 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 75 transitions, 190 flow [2025-02-08 00:57:03,785 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 75 transitions, 190 flow [2025-02-08 00:57:03,786 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:57:03,786 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;@6c004fda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:57:03,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-08 00:57:03,788 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:57:03,788 INFO L124 PetriNetUnfolderBase]: 2/26 cut-off events. [2025-02-08 00:57:03,788 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 00:57:03,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:57:03,788 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:57:03,788 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-08 00:57:03,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:57:03,789 INFO L85 PathProgramCache]: Analyzing trace with hash -713568322, now seen corresponding path program 1 times [2025-02-08 00:57:03,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:57:03,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36038882] [2025-02-08 00:57:03,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:57:03,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:57:03,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 00:57:03,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 00:57:03,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:57:03,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:57:03,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:57:03,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:57:03,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36038882] [2025-02-08 00:57:03,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36038882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:57:03,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:57:03,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:57:03,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397281660] [2025-02-08 00:57:03,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:57:03,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:57:03,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:57:03,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:57:03,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:57:03,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 75 [2025-02-08 00:57:03,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 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-02-08 00:57:03,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:57:03,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 75 [2025-02-08 00:57:03,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:57:19,853 INFO L124 PetriNetUnfolderBase]: 233476/308001 cut-off events. [2025-02-08 00:57:19,853 INFO L125 PetriNetUnfolderBase]: For 49733/49733 co-relation queries the response was YES. [2025-02-08 00:57:20,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619404 conditions, 308001 events. 233476/308001 cut-off events. For 49733/49733 co-relation queries the response was YES. Maximal size of possible extension queue 9289. Compared 2186998 event pairs, 49768 based on Foata normal form. 36180/325812 useless extension candidates. Maximal degree in co-relation 85769. Up to 114045 conditions per place. [2025-02-08 00:57:22,054 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 89 selfloop transitions, 3 changer transitions 0/121 dead transitions. [2025-02-08 00:57:22,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 121 transitions, 530 flow [2025-02-08 00:57:22,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:57:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 00:57:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2025-02-08 00:57:22,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.76 [2025-02-08 00:57:22,056 INFO L175 Difference]: Start difference. First operand has 76 places, 75 transitions, 190 flow. Second operand 4 states and 228 transitions. [2025-02-08 00:57:22,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 121 transitions, 530 flow [2025-02-08 00:57:22,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 121 transitions, 494 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-02-08 00:57:22,082 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 168 flow [2025-02-08 00:57:22,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2025-02-08 00:57:22,083 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 0 predicate places. [2025-02-08 00:57:22,083 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 168 flow [2025-02-08 00:57:22,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 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-02-08 00:57:22,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:57:22,084 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:57:22,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 00:57:22,084 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-08 00:57:22,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:57:22,084 INFO L85 PathProgramCache]: Analyzing trace with hash -722792473, now seen corresponding path program 1 times [2025-02-08 00:57:22,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:57:22,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481397976] [2025-02-08 00:57:22,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:57:22,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:57:22,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 00:57:22,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 00:57:22,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:57:22,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:57:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:57:22,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:57:22,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481397976] [2025-02-08 00:57:22,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481397976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:57:22,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:57:22,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:57:22,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306990322] [2025-02-08 00:57:22,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:57:22,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:57:22,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:57:22,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:57:22,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:57:22,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 75 [2025-02-08 00:57:22,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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-02-08 00:57:22,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:57:22,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 75 [2025-02-08 00:57:22,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand