./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 8fc3dc66 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-ext/29_conditionals_vs.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 c3f647420f42d7fdb333957b618cdd528a4c5a4cecdb35105a1a2630df70b3d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:21:13,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:21:13,820 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:21:13,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:21:13,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:21:13,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:21:13,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:21:13,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:21:13,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:21:13,853 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:21:13,853 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:21:13,853 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:21:13,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:21:13,853 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:21:13,853 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:21:13,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:21:13,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:21:13,854 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:21:13,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:21:13,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:21:13,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:21:13,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:21:13,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:21:13,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:21:13,855 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:21:13,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:21:13,855 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:21:13,855 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:21:13,855 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:21:13,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:21:13,856 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:21:13,856 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:21:13,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:21:13,856 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:21:13,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:21:13,856 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:21:13,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:21:13,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:21:13,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:21:13,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:21:13,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:21:13,856 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:21:13,856 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:21:13,856 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 -> c3f647420f42d7fdb333957b618cdd528a4c5a4cecdb35105a1a2630df70b3d6 [2025-03-17 06:21:14,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:21:14,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:21:14,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:21:14,096 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:21:14,096 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:21:14,098 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/29_conditionals_vs.i [2025-03-17 06:21:15,284 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3ce8d51f/a5be40699ea546aeb6b9cf5b72072d92/FLAG9050b4869 [2025-03-17 06:21:15,633 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:21:15,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/29_conditionals_vs.i [2025-03-17 06:21:15,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3ce8d51f/a5be40699ea546aeb6b9cf5b72072d92/FLAG9050b4869 [2025-03-17 06:21:15,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3ce8d51f/a5be40699ea546aeb6b9cf5b72072d92 [2025-03-17 06:21:15,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:21:15,669 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:21:15,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:21:15,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:21:15,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:21:15,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:21:15" (1/1) ... [2025-03-17 06:21:15,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@377b5731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:15, skipping insertion in model container [2025-03-17 06:21:15,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:21:15" (1/1) ... [2025-03-17 06:21:15,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:21:15,915 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-ext/29_conditionals_vs.i[30422,30435] [2025-03-17 06:21:15,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:21:15,929 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:21:15,956 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-ext/29_conditionals_vs.i[30422,30435] [2025-03-17 06:21:15,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:21:15,984 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:21:15,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:15 WrapperNode [2025-03-17 06:21:15,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:21:15,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:21:15,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:21:15,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:21:15,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:15" (1/1) ... [2025-03-17 06:21:16,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:15" (1/1) ... [2025-03-17 06:21:16,013 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 55 [2025-03-17 06:21:16,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:21:16,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:21:16,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:21:16,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:21:16,019 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:15" (1/1) ... [2025-03-17 06:21:16,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:15" (1/1) ... [2025-03-17 06:21:16,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:15" (1/1) ... [2025-03-17 06:21:16,027 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-17 06:21:16,032 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:15" (1/1) ... [2025-03-17 06:21:16,032 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:15" (1/1) ... [2025-03-17 06:21:16,035 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:15" (1/1) ... [2025-03-17 06:21:16,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:15" (1/1) ... [2025-03-17 06:21:16,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:15" (1/1) ... [2025-03-17 06:21:16,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:15" (1/1) ... [2025-03-17 06:21:16,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:21:16,039 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:21:16,039 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:21:16,039 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:21:16,040 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:15" (1/1) ... [2025-03-17 06:21:16,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:21:16,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:21:16,074 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-17 06:21:16,078 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-17 06:21:16,092 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-17 06:21:16,093 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-17 06:21:16,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:21:16,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:21:16,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:21:16,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:21:16,094 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 06:21:16,181 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:21:16,183 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:21:16,275 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 06:21:16,275 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:21:16,332 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:21:16,332 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:21:16,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:21:16 BoogieIcfgContainer [2025-03-17 06:21:16,332 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:21:16,334 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:21:16,334 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:21:16,337 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:21:16,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:21:15" (1/3) ... [2025-03-17 06:21:16,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25fb9468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:21:16, skipping insertion in model container [2025-03-17 06:21:16,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:15" (2/3) ... [2025-03-17 06:21:16,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25fb9468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:21:16, skipping insertion in model container [2025-03-17 06:21:16,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:21:16" (3/3) ... [2025-03-17 06:21:16,339 INFO L128 eAbstractionObserver]: Analyzing ICFG 29_conditionals_vs.i [2025-03-17 06:21:16,357 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:21:16,358 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 29_conditionals_vs.i that has 2 procedures, 16 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:21:16,358 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 06:21:16,395 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 06:21:16,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 19 transitions, 42 flow [2025-03-17 06:21:16,447 INFO L124 PetriNetUnfolderBase]: 3/21 cut-off events. [2025-03-17 06:21:16,452 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 06:21:16,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 21 events. 3/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 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-03-17 06:21:16,455 INFO L82 GeneralOperation]: Start removeDead. Operand has 19 places, 19 transitions, 42 flow [2025-03-17 06:21:16,457 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 19 transitions, 42 flow [2025-03-17 06:21:16,463 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:21:16,472 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;@45ba915f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:21:16,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-17 06:21:16,478 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:21:16,479 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-17 06:21:16,479 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 06:21:16,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:21:16,480 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 06:21:16,480 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:21:16,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:21:16,485 INFO L85 PathProgramCache]: Analyzing trace with hash 121248863, now seen corresponding path program 1 times [2025-03-17 06:21:16,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:21:16,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288013147] [2025-03-17 06:21:16,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:21:16,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:21:16,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 06:21:16,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 06:21:16,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:21:16,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:21:16,573 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:21:16,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 06:21:16,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 06:21:16,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:21:16,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:21:16,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:21:16,607 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:21:16,608 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-03-17 06:21:16,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-17 06:21:16,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-03-17 06:21:16,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:21:16,611 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-17 06:21:16,618 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 06:21:16,618 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 06:21:16,647 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 06:21:16,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 33 transitions, 76 flow [2025-03-17 06:21:16,668 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2025-03-17 06:21:16,668 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 06:21:16,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 38 events. 6/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 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-03-17 06:21:16,668 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 33 transitions, 76 flow [2025-03-17 06:21:16,669 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 33 transitions, 76 flow [2025-03-17 06:21:16,673 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:21:16,673 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;@45ba915f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:21:16,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-17 06:21:16,680 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:21:16,681 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2025-03-17 06:21:16,681 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 06:21:16,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:21:16,682 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:21:16,682 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 06:21:16,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:21:16,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1950244768, now seen corresponding path program 1 times [2025-03-17 06:21:16,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:21:16,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921697579] [2025-03-17 06:21:16,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:21:16,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:21:16,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 06:21:16,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 06:21:16,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:21:16,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:21:16,852 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-17 06:21:16,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:21:16,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921697579] [2025-03-17 06:21:16,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921697579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:21:16,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:21:16,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:21:16,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854376342] [2025-03-17 06:21:16,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:21:16,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:21:16,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:21:16,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:21:16,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:21:16,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-03-17 06:21:16,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-17 06:21:16,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:21:16,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-03-17 06:21:16,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:21:17,119 INFO L124 PetriNetUnfolderBase]: 358/702 cut-off events. [2025-03-17 06:21:17,119 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-17 06:21:17,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 702 events. 358/702 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3506 event pairs, 70 based on Foata normal form. 57/711 useless extension candidates. Maximal degree in co-relation 921. Up to 255 conditions per place. [2025-03-17 06:21:17,125 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 34 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2025-03-17 06:21:17,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 47 transitions, 188 flow [2025-03-17 06:21:17,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:21:17,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:21:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-03-17 06:21:17,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6439393939393939 [2025-03-17 06:21:17,137 INFO L175 Difference]: Start difference. First operand has 32 places, 33 transitions, 76 flow. Second operand 4 states and 85 transitions. [2025-03-17 06:21:17,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 47 transitions, 188 flow [2025-03-17 06:21:17,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 47 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 06:21:17,144 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 74 flow [2025-03-17 06:21:17,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2025-03-17 06:21:17,147 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2025-03-17 06:21:17,147 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 74 flow [2025-03-17 06:21:17,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-17 06:21:17,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:21:17,148 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-17 06:21:17,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:21:17,148 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-03-17 06:21:17,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:21:17,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1071407544, now seen corresponding path program 1 times [2025-03-17 06:21:17,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:21:17,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071261838] [2025-03-17 06:21:17,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:21:17,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:21:17,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 06:21:17,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 06:21:17,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:21:17,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:21:17,163 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:21:17,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 06:21:17,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 06:21:17,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:21:17,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:21:17,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:21:17,184 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:21:17,184 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-17 06:21:17,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-17 06:21:17,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-03-17 06:21:17,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-17 06:21:17,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:21:17,184 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 06:21:17,185 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 06:21:17,185 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 06:21:17,205 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 06:21:17,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 47 transitions, 112 flow [2025-03-17 06:21:17,213 INFO L124 PetriNetUnfolderBase]: 9/55 cut-off events. [2025-03-17 06:21:17,213 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 06:21:17,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 9/55 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 118 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-03-17 06:21:17,214 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 47 transitions, 112 flow [2025-03-17 06:21:17,215 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 47 transitions, 112 flow [2025-03-17 06:21:17,216 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:21:17,216 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;@45ba915f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:21:17,216 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-17 06:21:17,220 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:21:17,220 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2025-03-17 06:21:17,220 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 06:21:17,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:21:17,220 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:21:17,220 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-17 06:21:17,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:21:17,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2013006492, now seen corresponding path program 1 times [2025-03-17 06:21:17,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:21:17,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038371218] [2025-03-17 06:21:17,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:21:17,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:21:17,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 06:21:17,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 06:21:17,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:21:17,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:21:17,299 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-17 06:21:17,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:21:17,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038371218] [2025-03-17 06:21:17,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038371218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:21:17,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:21:17,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:21:17,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536202586] [2025-03-17 06:21:17,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:21:17,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:21:17,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:21:17,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:21:17,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:21:17,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2025-03-17 06:21:17,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:21:17,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:21:17,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2025-03-17 06:21:17,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:21:17,770 INFO L124 PetriNetUnfolderBase]: 3454/5586 cut-off events. [2025-03-17 06:21:17,770 INFO L125 PetriNetUnfolderBase]: For 482/482 co-relation queries the response was YES. [2025-03-17 06:21:17,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10795 conditions, 5586 events. 3454/5586 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 34820 event pairs, 736 based on Foata normal form. 564/5799 useless extension candidates. Maximal degree in co-relation 4764. Up to 2085 conditions per place. [2025-03-17 06:21:17,803 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 52 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2025-03-17 06:21:17,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 72 transitions, 296 flow [2025-03-17 06:21:17,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:21:17,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:21:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-03-17 06:21:17,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7127659574468085 [2025-03-17 06:21:17,806 INFO L175 Difference]: Start difference. First operand has 45 places, 47 transitions, 112 flow. Second operand 4 states and 134 transitions. [2025-03-17 06:21:17,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 72 transitions, 296 flow [2025-03-17 06:21:17,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 72 transitions, 290 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-17 06:21:17,808 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 106 flow [2025-03-17 06:21:17,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2025-03-17 06:21:17,813 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2025-03-17 06:21:17,814 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 106 flow [2025-03-17 06:21:17,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:21:17,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:21:17,814 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:21:17,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:21:17,814 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-17 06:21:17,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:21:17,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2013007515, now seen corresponding path program 1 times [2025-03-17 06:21:17,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:21:17,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343804037] [2025-03-17 06:21:17,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:21:17,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:21:17,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 06:21:17,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 06:21:17,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:21:17,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:21:17,864 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-17 06:21:17,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:21:17,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343804037] [2025-03-17 06:21:17,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343804037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:21:17,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:21:17,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:21:17,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493288999] [2025-03-17 06:21:17,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:21:17,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:21:17,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:21:17,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:21:17,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:21:17,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2025-03-17 06:21:17,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 106 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-03-17 06:21:17,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:21:17,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2025-03-17 06:21:17,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:21:18,293 INFO L124 PetriNetUnfolderBase]: 3454/5328 cut-off events. [2025-03-17 06:21:18,293 INFO L125 PetriNetUnfolderBase]: For 395/395 co-relation queries the response was YES. [2025-03-17 06:21:18,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10724 conditions, 5328 events. 3454/5328 cut-off events. For 395/395 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 31020 event pairs, 736 based on Foata normal form. 129/5214 useless extension candidates. Maximal degree in co-relation 8547. Up to 2085 conditions per place. [2025-03-17 06:21:18,337 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 53 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2025-03-17 06:21:18,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 290 flow [2025-03-17 06:21:18,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:21:18,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:21:18,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-03-17 06:21:18,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6382978723404256 [2025-03-17 06:21:18,339 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 106 flow. Second operand 4 states and 120 transitions. [2025-03-17 06:21:18,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 290 flow [2025-03-17 06:21:18,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:21:18,341 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 101 flow [2025-03-17 06:21:18,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2025-03-17 06:21:18,342 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2025-03-17 06:21:18,342 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 101 flow [2025-03-17 06:21:18,342 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-03-17 06:21:18,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:21:18,343 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-03-17 06:21:18,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:21:18,343 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-17 06:21:18,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:21:18,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1817735074, now seen corresponding path program 1 times [2025-03-17 06:21:18,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:21:18,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030813519] [2025-03-17 06:21:18,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:21:18,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:21:18,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 06:21:18,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 06:21:18,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:21:18,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:21:18,352 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:21:18,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 06:21:18,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 06:21:18,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:21:18,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:21:18,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:21:18,364 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:21:18,364 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-17 06:21:18,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-17 06:21:18,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-17 06:21:18,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-17 06:21:18,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-17 06:21:18,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:21:18,365 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 06:21:18,365 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 06:21:18,365 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-17 06:21:18,402 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 06:21:18,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 61 transitions, 150 flow [2025-03-17 06:21:18,414 INFO L124 PetriNetUnfolderBase]: 12/72 cut-off events. [2025-03-17 06:21:18,415 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-17 06:21:18,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 72 events. 12/72 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 164 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-03-17 06:21:18,416 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 61 transitions, 150 flow [2025-03-17 06:21:18,418 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 61 transitions, 150 flow [2025-03-17 06:21:18,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:21:18,420 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;@45ba915f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:21:18,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 06:21:18,423 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:21:18,423 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2025-03-17 06:21:18,423 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 06:21:18,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:21:18,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:21:18,424 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-17 06:21:18,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:21:18,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1509653382, now seen corresponding path program 1 times [2025-03-17 06:21:18,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:21:18,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314675994] [2025-03-17 06:21:18,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:21:18,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:21:18,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 06:21:18,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 06:21:18,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:21:18,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:21:18,475 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-17 06:21:18,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:21:18,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314675994] [2025-03-17 06:21:18,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314675994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:21:18,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:21:18,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:21:18,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773289086] [2025-03-17 06:21:18,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:21:18,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:21:18,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:21:18,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:21:18,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:21:18,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 61 [2025-03-17 06:21:18,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 61 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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-17 06:21:18,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:21:18,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 61 [2025-03-17 06:21:18,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:21:20,890 INFO L124 PetriNetUnfolderBase]: 28492/41307 cut-off events. [2025-03-17 06:21:20,890 INFO L125 PetriNetUnfolderBase]: For 5009/5009 co-relation queries the response was YES. [2025-03-17 06:21:21,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80861 conditions, 41307 events. 28492/41307 cut-off events. For 5009/5009 co-relation queries the response was YES. Maximal size of possible extension queue 1557. Compared 288777 event pairs, 6352 based on Foata normal form. 4892/44047 useless extension candidates. Maximal degree in co-relation 10947. Up to 15765 conditions per place. [2025-03-17 06:21:21,274 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 70 selfloop transitions, 3 changer transitions 0/97 dead transitions. [2025-03-17 06:21:21,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 97 transitions, 410 flow [2025-03-17 06:21:21,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:21:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:21:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2025-03-17 06:21:21,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-03-17 06:21:21,278 INFO L175 Difference]: Start difference. First operand has 58 places, 61 transitions, 150 flow. Second operand 4 states and 183 transitions. [2025-03-17 06:21:21,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 97 transitions, 410 flow [2025-03-17 06:21:21,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 97 transitions, 392 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-17 06:21:21,286 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 138 flow [2025-03-17 06:21:21,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2025-03-17 06:21:21,287 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2025-03-17 06:21:21,288 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 138 flow [2025-03-17 06:21:21,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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-17 06:21:21,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:21:21,288 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:21:21,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:21:21,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-17 06:21:21,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:21:21,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1509654405, now seen corresponding path program 1 times [2025-03-17 06:21:21,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:21:21,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010427154] [2025-03-17 06:21:21,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:21:21,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:21:21,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 06:21:21,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 06:21:21,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:21:21,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:21:21,345 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-17 06:21:21,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:21:21,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010427154] [2025-03-17 06:21:21,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010427154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:21:21,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:21:21,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:21:21,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044807446] [2025-03-17 06:21:21,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:21:21,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:21:21,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:21:21,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:21:21,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:21:21,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-17 06:21:21,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 138 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-03-17 06:21:21,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:21:21,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-17 06:21:21,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:21:23,504 INFO L124 PetriNetUnfolderBase]: 28492/39753 cut-off events. [2025-03-17 06:21:23,504 INFO L125 PetriNetUnfolderBase]: For 2564/2564 co-relation queries the response was YES. [2025-03-17 06:21:23,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79926 conditions, 39753 events. 28492/39753 cut-off events. For 2564/2564 co-relation queries the response was YES. Maximal size of possible extension queue 1427. Compared 258600 event pairs, 6352 based on Foata normal form. 777/39029 useless extension candidates. Maximal degree in co-relation 65082. Up to 15765 conditions per place. [2025-03-17 06:21:23,746 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 71 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2025-03-17 06:21:23,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 95 transitions, 392 flow [2025-03-17 06:21:23,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:21:23,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:21:23,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2025-03-17 06:21:23,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680327868852459 [2025-03-17 06:21:23,748 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 138 flow. Second operand 4 states and 166 transitions. [2025-03-17 06:21:23,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 95 transitions, 392 flow [2025-03-17 06:21:23,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 95 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:21:23,755 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 133 flow [2025-03-17 06:21:23,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2025-03-17 06:21:23,755 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2025-03-17 06:21:23,755 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 133 flow [2025-03-17 06:21:23,756 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-03-17 06:21:23,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:21:23,756 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:21:23,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:21:23,756 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-17 06:21:23,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:21:23,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1375952537, now seen corresponding path program 1 times [2025-03-17 06:21:23,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:21:23,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381751740] [2025-03-17 06:21:23,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:21:23,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:21:23,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 06:21:23,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 06:21:23,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:21:23,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:21:23,806 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-17 06:21:23,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:21:23,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381751740] [2025-03-17 06:21:23,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381751740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:21:23,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:21:23,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:21:23,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461953267] [2025-03-17 06:21:23,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:21:23,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:21:23,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:21:23,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:21:23,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:21:23,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 61 [2025-03-17 06:21:23,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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-17 06:21:23,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:21:23,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 61 [2025-03-17 06:21:23,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:21:26,322 INFO L124 PetriNetUnfolderBase]: 38482/55572 cut-off events. [2025-03-17 06:21:26,322 INFO L125 PetriNetUnfolderBase]: For 3974/3974 co-relation queries the response was YES. [2025-03-17 06:21:26,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109068 conditions, 55572 events. 38482/55572 cut-off events. For 3974/3974 co-relation queries the response was YES. Maximal size of possible extension queue 2215. Compared 402386 event pairs, 8611 based on Foata normal form. 0/51210 useless extension candidates. Maximal degree in co-relation 81252. Up to 21195 conditions per place. [2025-03-17 06:21:26,792 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 68 selfloop transitions, 3 changer transitions 0/92 dead transitions. [2025-03-17 06:21:26,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 92 transitions, 377 flow [2025-03-17 06:21:26,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:21:26,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:21:26,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2025-03-17 06:21:26,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6885245901639344 [2025-03-17 06:21:26,794 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 133 flow. Second operand 4 states and 168 transitions. [2025-03-17 06:21:26,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 92 transitions, 377 flow [2025-03-17 06:21:26,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 92 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:21:26,802 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 134 flow [2025-03-17 06:21:26,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=60, PETRI_TRANSITIONS=52} [2025-03-17 06:21:26,802 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2025-03-17 06:21:26,803 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 134 flow [2025-03-17 06:21:26,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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-17 06:21:26,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:21:26,803 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:21:26,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:21:26,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-17 06:21:26,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:21:26,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1375951514, now seen corresponding path program 1 times [2025-03-17 06:21:26,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:21:26,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051636994] [2025-03-17 06:21:26,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:21:26,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:21:26,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 06:21:26,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 06:21:26,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:21:26,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:21:26,858 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-17 06:21:26,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:21:26,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051636994] [2025-03-17 06:21:26,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051636994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:21:26,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:21:26,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:21:26,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247047879] [2025-03-17 06:21:26,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:21:26,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:21:26,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:21:26,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:21:26,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:21:26,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-17 06:21:26,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 134 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-03-17 06:21:26,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:21:26,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-17 06:21:26,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:21:29,167 INFO L124 PetriNetUnfolderBase]: 38482/53508 cut-off events. [2025-03-17 06:21:29,167 INFO L125 PetriNetUnfolderBase]: For 3440/3440 co-relation queries the response was YES. [2025-03-17 06:21:29,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107517 conditions, 53508 events. 38482/53508 cut-off events. For 3440/3440 co-relation queries the response was YES. Maximal size of possible extension queue 2042. Compared 360259 event pairs, 8611 based on Foata normal form. 1032/51036 useless extension candidates. Maximal degree in co-relation 79704. Up to 21195 conditions per place. [2025-03-17 06:21:29,704 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 69 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2025-03-17 06:21:29,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 90 transitions, 370 flow [2025-03-17 06:21:29,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:21:29,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:21:29,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2025-03-17 06:21:29,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6721311475409836 [2025-03-17 06:21:29,706 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 134 flow. Second operand 4 states and 164 transitions. [2025-03-17 06:21:29,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 90 transitions, 370 flow [2025-03-17 06:21:29,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 90 transitions, 367 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:21:29,717 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 129 flow [2025-03-17 06:21:29,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2025-03-17 06:21:29,722 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2025-03-17 06:21:29,722 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 129 flow [2025-03-17 06:21:29,722 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-03-17 06:21:29,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:21:29,722 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2025-03-17 06:21:29,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:21:29,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-17 06:21:29,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:21:29,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1647969571, now seen corresponding path program 1 times [2025-03-17 06:21:29,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:21:29,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132408697] [2025-03-17 06:21:29,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:21:29,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:21:29,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 06:21:29,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 06:21:29,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:21:29,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:21:29,732 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:21:29,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 06:21:29,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 06:21:29,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:21:29,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:21:29,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:21:29,740 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:21:29,740 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-17 06:21:29,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-17 06:21:29,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-03-17 06:21:29,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-03-17 06:21:29,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-03-17 06:21:29,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-17 06:21:29,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 06:21:29,742 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 06:21:29,743 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 06:21:29,743 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-17 06:21:29,769 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 06:21:29,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 75 transitions, 190 flow [2025-03-17 06:21:29,779 INFO L124 PetriNetUnfolderBase]: 15/89 cut-off events. [2025-03-17 06:21:29,780 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-17 06:21:29,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 89 events. 15/89 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 228 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-03-17 06:21:29,780 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 75 transitions, 190 flow [2025-03-17 06:21:29,781 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 75 transitions, 190 flow [2025-03-17 06:21:29,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:21:29,782 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;@45ba915f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:21:29,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 06:21:29,784 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:21:29,784 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2025-03-17 06:21:29,784 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 06:21:29,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:21:29,784 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:21:29,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-17 06:21:29,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:21:29,784 INFO L85 PathProgramCache]: Analyzing trace with hash -713569346, now seen corresponding path program 1 times [2025-03-17 06:21:29,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:21:29,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811039940] [2025-03-17 06:21:29,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:21:29,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:21:29,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 06:21:29,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 06:21:29,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:21:29,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:21:29,835 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-17 06:21:29,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:21:29,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811039940] [2025-03-17 06:21:29,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811039940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:21:29,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:21:29,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:21:29,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289707231] [2025-03-17 06:21:29,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:21:29,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:21:29,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:21:29,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:21:29,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:21:29,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-03-17 06:21:29,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 75 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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-17 06:21:29,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:21:29,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-03-17 06:21:29,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:21:46,074 INFO L124 PetriNetUnfolderBase]: 217600/294522 cut-off events. [2025-03-17 06:21:46,075 INFO L125 PetriNetUnfolderBase]: For 46094/46094 co-relation queries the response was YES. [2025-03-17 06:21:47,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581613 conditions, 294522 events. 217600/294522 cut-off events. For 46094/46094 co-relation queries the response was YES. Maximal size of possible extension queue 9086. Compared 2200460 event pairs, 49768 based on Foata normal form. 38646/320220 useless extension candidates. Maximal degree in co-relation 80810. Up to 114045 conditions per place. [2025-03-17 06:21:48,728 INFO L140 encePairwiseOnDemand]: 65/75 looper letters, 88 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2025-03-17 06:21:48,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 122 transitions, 530 flow [2025-03-17 06:21:48,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:21:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:21:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2025-03-17 06:21:48,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7733333333333333 [2025-03-17 06:21:48,730 INFO L175 Difference]: Start difference. First operand has 71 places, 75 transitions, 190 flow. Second operand 4 states and 232 transitions. [2025-03-17 06:21:48,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 122 transitions, 530 flow [2025-03-17 06:21:48,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 122 transitions, 494 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-17 06:21:48,746 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 170 flow [2025-03-17 06:21:48,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2025-03-17 06:21:48,746 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 2 predicate places. [2025-03-17 06:21:48,746 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 170 flow [2025-03-17 06:21:48,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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-17 06:21:48,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:21:48,747 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:21:48,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 06:21:48,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-17 06:21:48,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:21:48,747 INFO L85 PathProgramCache]: Analyzing trace with hash -713568323, now seen corresponding path program 1 times [2025-03-17 06:21:48,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:21:48,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131999304] [2025-03-17 06:21:48,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:21:48,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:21:48,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 06:21:48,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 06:21:48,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:21:48,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:21:48,798 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-17 06:21:48,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:21:48,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131999304] [2025-03-17 06:21:48,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131999304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:21:48,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:21:48,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:21:48,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138627074] [2025-03-17 06:21:48,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:21:48,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:21:48,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:21:48,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:21:48,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:21:48,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 75 [2025-03-17 06:21:48,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 170 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-03-17 06:21:48,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:21:48,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 75 [2025-03-17 06:21:48,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand