./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/exponential-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-theta/exponential-4.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 6e0717c26865b2b98bbf38ebc229049821d555def6fcecec3e56a64fb6f63f98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:41:25,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:41:25,789 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:41:25,793 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:41:25,793 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:41:25,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:41:25,816 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:41:25,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:41:25,816 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:41:25,816 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:41:25,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:41:25,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:41:25,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:41:25,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:41:25,817 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:41:25,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:41:25,817 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:41:25,817 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:41:25,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:41:25,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:41:25,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:41:25,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:41:25,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:41:25,817 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:41:25,817 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:41:25,819 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:41:25,819 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:41:25,819 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:41:25,819 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:41:25,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:41:25,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:41:25,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:41:25,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:41:25,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:41:25,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:41:25,820 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:41:25,820 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:41:25,820 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:41:25,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:41:25,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:41:25,820 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:41:25,820 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:41:25,820 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:41:25,820 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 -> 6e0717c26865b2b98bbf38ebc229049821d555def6fcecec3e56a64fb6f63f98 [2025-03-08 17:41:26,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:41:26,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:41:26,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:41:26,039 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:41:26,039 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:41:26,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/exponential-4.i [2025-03-08 17:41:27,179 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b85ed41ab/804e7ba805284fd48e37dd3aeebe22a3/FLAG9b04d060f [2025-03-08 17:41:27,480 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:41:27,482 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/exponential-4.i [2025-03-08 17:41:27,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b85ed41ab/804e7ba805284fd48e37dd3aeebe22a3/FLAG9b04d060f [2025-03-08 17:41:27,747 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b85ed41ab/804e7ba805284fd48e37dd3aeebe22a3 [2025-03-08 17:41:27,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:41:27,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:41:27,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:41:27,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:41:27,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:41:27,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:41:27" (1/1) ... [2025-03-08 17:41:27,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1298cda7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:27, skipping insertion in model container [2025-03-08 17:41:27,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:41:27" (1/1) ... [2025-03-08 17:41:27,780 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:41:28,058 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/exponential-4.i[33030,33043] [2025-03-08 17:41:28,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:41:28,081 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:41:28,109 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/exponential-4.i[33030,33043] [2025-03-08 17:41:28,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:41:28,139 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:41:28,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:28 WrapperNode [2025-03-08 17:41:28,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:41:28,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:41:28,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:41:28,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:41:28,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:28" (1/1) ... [2025-03-08 17:41:28,150 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:28" (1/1) ... [2025-03-08 17:41:28,160 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2025-03-08 17:41:28,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:41:28,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:41:28,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:41:28,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:41:28,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:28" (1/1) ... [2025-03-08 17:41:28,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:28" (1/1) ... [2025-03-08 17:41:28,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:28" (1/1) ... [2025-03-08 17:41:28,178 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-08 17:41:28,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:28" (1/1) ... [2025-03-08 17:41:28,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:28" (1/1) ... [2025-03-08 17:41:28,182 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:28" (1/1) ... [2025-03-08 17:41:28,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:28" (1/1) ... [2025-03-08 17:41:28,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:28" (1/1) ... [2025-03-08 17:41:28,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:28" (1/1) ... [2025-03-08 17:41:28,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:41:28,187 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:41:28,187 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:41:28,187 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:41:28,188 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:28" (1/1) ... [2025-03-08 17:41:28,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:41:28,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:41:28,212 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-08 17:41:28,215 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-08 17:41:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:41:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-08 17:41:28,232 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-08 17:41:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-08 17:41:28,232 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-08 17:41:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:41:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:41:28,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:41:28,234 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:41:28,317 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:41:28,319 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:41:28,434 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:41:28,434 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:41:28,518 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:41:28,519 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:41:28,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:41:28 BoogieIcfgContainer [2025-03-08 17:41:28,519 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:41:28,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:41:28,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:41:28,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:41:28,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:41:27" (1/3) ... [2025-03-08 17:41:28,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf1bee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:41:28, skipping insertion in model container [2025-03-08 17:41:28,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:28" (2/3) ... [2025-03-08 17:41:28,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf1bee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:41:28, skipping insertion in model container [2025-03-08 17:41:28,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:41:28" (3/3) ... [2025-03-08 17:41:28,526 INFO L128 eAbstractionObserver]: Analyzing ICFG exponential-4.i [2025-03-08 17:41:28,537 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:41:28,538 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG exponential-4.i that has 3 procedures, 20 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 17:41:28,539 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:41:28,572 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 17:41:28,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 22 transitions, 52 flow [2025-03-08 17:41:28,618 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-03-08 17:41:28,623 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:41:28,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 4/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 20. Up to 4 conditions per place. [2025-03-08 17:41:28,627 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 22 transitions, 52 flow [2025-03-08 17:41:28,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 43 flow [2025-03-08 17:41:28,638 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:41:28,649 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;@25430288, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:41:28,650 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-08 17:41:28,654 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:41:28,657 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2025-03-08 17:41:28,658 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:41:28,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:28,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 17:41:28,659 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:41:28,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:28,664 INFO L85 PathProgramCache]: Analyzing trace with hash 159710309, now seen corresponding path program 1 times [2025-03-08 17:41:28,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:28,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952512544] [2025-03-08 17:41:28,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:28,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:28,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 17:41:28,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 17:41:28,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:28,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:41:28,812 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-08 17:41:28,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:41:28,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952512544] [2025-03-08 17:41:28,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952512544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:41:28,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:41:28,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:41:28,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10118429] [2025-03-08 17:41:28,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:41:28,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:41:28,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:41:28,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:41:28,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:41:28,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 22 [2025-03-08 17:41:28,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 43 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-08 17:41:28,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:41:28,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 22 [2025-03-08 17:41:28,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:41:28,924 INFO L124 PetriNetUnfolderBase]: 65/136 cut-off events. [2025-03-08 17:41:28,924 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:41:28,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 136 events. 65/136 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 469 event pairs, 26 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 251. Up to 94 conditions per place. [2025-03-08 17:41:28,926 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 16 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2025-03-08 17:41:28,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 23 transitions, 89 flow [2025-03-08 17:41:28,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:41:28,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:41:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2025-03-08 17:41:28,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-03-08 17:41:28,950 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 43 flow. Second operand 3 states and 40 transitions. [2025-03-08 17:41:28,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 23 transitions, 89 flow [2025-03-08 17:41:28,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 23 transitions, 88 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:41:28,956 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 50 flow [2025-03-08 17:41:28,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2025-03-08 17:41:28,960 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2025-03-08 17:41:28,960 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 50 flow [2025-03-08 17:41:28,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-08 17:41:28,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:28,961 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-08 17:41:28,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:41:28,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:41:28,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:28,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1369598466, now seen corresponding path program 1 times [2025-03-08 17:41:28,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:28,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871561421] [2025-03-08 17:41:28,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:28,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:28,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 17:41:28,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 17:41:28,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:28,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:41:28,990 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:41:28,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 17:41:28,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 17:41:28,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:28,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:41:29,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:41:29,012 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:41:29,013 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-03-08 17:41:29,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-08 17:41:29,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-08 17:41:29,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:41:29,015 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 17:41:29,017 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 17:41:29,017 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 17:41:29,033 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 17:41:29,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 80 flow [2025-03-08 17:41:29,043 INFO L124 PetriNetUnfolderBase]: 6/49 cut-off events. [2025-03-08 17:41:29,043 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:41:29,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 49 events. 6/49 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2025-03-08 17:41:29,043 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 30 transitions, 80 flow [2025-03-08 17:41:29,044 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 26 transitions, 70 flow [2025-03-08 17:41:29,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:41:29,045 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;@25430288, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:41:29,045 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-08 17:41:29,047 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:41:29,047 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2025-03-08 17:41:29,047 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:41:29,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:29,047 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 17:41:29,047 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:41:29,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:29,048 INFO L85 PathProgramCache]: Analyzing trace with hash 188339459, now seen corresponding path program 1 times [2025-03-08 17:41:29,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:29,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094174108] [2025-03-08 17:41:29,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:29,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:29,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 17:41:29,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 17:41:29,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:29,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:41:29,080 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-08 17:41:29,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:41:29,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094174108] [2025-03-08 17:41:29,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094174108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:41:29,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:41:29,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:41:29,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001413505] [2025-03-08 17:41:29,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:41:29,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:41:29,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:41:29,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:41:29,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:41:29,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2025-03-08 17:41:29,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-08 17:41:29,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:41:29,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2025-03-08 17:41:29,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:41:29,304 INFO L124 PetriNetUnfolderBase]: 1262/1930 cut-off events. [2025-03-08 17:41:29,304 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-03-08 17:41:29,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3826 conditions, 1930 events. 1262/1930 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9703 event pairs, 512 based on Foata normal form. 0/1740 useless extension candidates. Maximal degree in co-relation 1044. Up to 1750 conditions per place. [2025-03-08 17:41:29,319 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 24 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2025-03-08 17:41:29,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 136 flow [2025-03-08 17:41:29,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:41:29,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:41:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-03-08 17:41:29,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-08 17:41:29,321 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 70 flow. Second operand 3 states and 54 transitions. [2025-03-08 17:41:29,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 136 flow [2025-03-08 17:41:29,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 33 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:41:29,324 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 81 flow [2025-03-08 17:41:29,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2025-03-08 17:41:29,326 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2025-03-08 17:41:29,327 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 81 flow [2025-03-08 17:41:29,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-08 17:41:29,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:29,327 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:41:29,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:41:29,328 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:41:29,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:29,328 INFO L85 PathProgramCache]: Analyzing trace with hash 60449949, now seen corresponding path program 1 times [2025-03-08 17:41:29,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:29,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753012014] [2025-03-08 17:41:29,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:29,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:29,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 17:41:29,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 17:41:29,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:29,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:41:29,408 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-08 17:41:29,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:41:29,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753012014] [2025-03-08 17:41:29,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753012014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:41:29,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:41:29,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:41:29,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209086985] [2025-03-08 17:41:29,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:41:29,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:41:29,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:41:29,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:41:29,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:41:29,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2025-03-08 17:41:29,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:41:29,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:41:29,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2025-03-08 17:41:29,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:41:29,624 INFO L124 PetriNetUnfolderBase]: 1490/2245 cut-off events. [2025-03-08 17:41:29,625 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2025-03-08 17:41:29,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4650 conditions, 2245 events. 1490/2245 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11678 event pairs, 1172 based on Foata normal form. 0/2145 useless extension candidates. Maximal degree in co-relation 1278. Up to 1774 conditions per place. [2025-03-08 17:41:29,639 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 26 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2025-03-08 17:41:29,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 157 flow [2025-03-08 17:41:29,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:41:29,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:41:29,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-03-08 17:41:29,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-08 17:41:29,642 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 81 flow. Second operand 4 states and 65 transitions. [2025-03-08 17:41:29,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 157 flow [2025-03-08 17:41:29,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 36 transitions, 155 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:41:29,644 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 93 flow [2025-03-08 17:41:29,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2025-03-08 17:41:29,644 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2025-03-08 17:41:29,644 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 93 flow [2025-03-08 17:41:29,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:41:29,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:29,646 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:41:29,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:41:29,646 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:41:29,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:29,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1873925709, now seen corresponding path program 1 times [2025-03-08 17:41:29,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:29,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083566849] [2025-03-08 17:41:29,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:29,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:29,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 17:41:29,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 17:41:29,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:29,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:41:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:41:29,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:41:29,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083566849] [2025-03-08 17:41:29,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083566849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:41:29,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:41:29,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:41:29,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533984322] [2025-03-08 17:41:29,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:41:29,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:41:29,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:41:29,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:41:29,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:41:29,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2025-03-08 17:41:29,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-08 17:41:29,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:41:29,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2025-03-08 17:41:29,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:41:29,864 INFO L124 PetriNetUnfolderBase]: 1445/2293 cut-off events. [2025-03-08 17:41:29,864 INFO L125 PetriNetUnfolderBase]: For 260/260 co-relation queries the response was YES. [2025-03-08 17:41:29,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5015 conditions, 2293 events. 1445/2293 cut-off events. For 260/260 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 12626 event pairs, 80 based on Foata normal form. 9/2211 useless extension candidates. Maximal degree in co-relation 2415. Up to 1567 conditions per place. [2025-03-08 17:41:29,878 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 33 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2025-03-08 17:41:29,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 195 flow [2025-03-08 17:41:29,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:41:29,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:41:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-03-08 17:41:29,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-08 17:41:29,879 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 93 flow. Second operand 4 states and 72 transitions. [2025-03-08 17:41:29,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 195 flow [2025-03-08 17:41:29,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 189 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-08 17:41:29,889 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 97 flow [2025-03-08 17:41:29,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2025-03-08 17:41:29,890 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-03-08 17:41:29,891 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 97 flow [2025-03-08 17:41:29,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-08 17:41:29,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:29,891 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-08 17:41:29,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:41:29,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:41:29,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:29,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1026755260, now seen corresponding path program 1 times [2025-03-08 17:41:29,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:29,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088708645] [2025-03-08 17:41:29,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:29,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:29,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 17:41:29,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 17:41:29,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:29,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:41:29,908 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:41:29,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 17:41:29,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 17:41:29,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:29,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:41:29,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:41:29,923 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:41:29,923 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-03-08 17:41:29,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-08 17:41:29,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-08 17:41:29,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:41:29,924 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 17:41:29,924 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 17:41:29,924 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-08 17:41:29,943 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 17:41:29,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 38 transitions, 112 flow [2025-03-08 17:41:29,948 INFO L124 PetriNetUnfolderBase]: 8/68 cut-off events. [2025-03-08 17:41:29,948 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-08 17:41:29,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 68 events. 8/68 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 144 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 70. Up to 8 conditions per place. [2025-03-08 17:41:29,948 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 38 transitions, 112 flow [2025-03-08 17:41:29,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 34 transitions, 101 flow [2025-03-08 17:41:29,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:41:29,949 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;@25430288, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:41:29,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-08 17:41:29,950 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:41:29,951 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2025-03-08 17:41:29,951 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:41:29,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:29,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 17:41:29,951 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:41:29,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:29,951 INFO L85 PathProgramCache]: Analyzing trace with hash 224603049, now seen corresponding path program 1 times [2025-03-08 17:41:29,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:29,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665819073] [2025-03-08 17:41:29,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:29,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:29,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 17:41:29,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 17:41:29,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:29,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:41:29,969 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-08 17:41:29,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:41:29,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665819073] [2025-03-08 17:41:29,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665819073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:41:29,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:41:29,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:41:29,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201612818] [2025-03-08 17:41:29,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:41:29,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:41:29,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:41:29,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:41:29,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:41:29,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-03-08 17:41:29,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:41:29,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:41:29,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-03-08 17:41:29,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:41:31,426 INFO L124 PetriNetUnfolderBase]: 17543/23521 cut-off events. [2025-03-08 17:41:31,426 INFO L125 PetriNetUnfolderBase]: For 2497/2497 co-relation queries the response was YES. [2025-03-08 17:41:31,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47127 conditions, 23521 events. 17543/23521 cut-off events. For 2497/2497 co-relation queries the response was YES. Maximal size of possible extension queue 1046. Compared 133679 event pairs, 13634 based on Foata normal form. 0/21609 useless extension candidates. Maximal degree in co-relation 13641. Up to 22162 conditions per place. [2025-03-08 17:41:31,547 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 30 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2025-03-08 17:41:31,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 41 transitions, 179 flow [2025-03-08 17:41:31,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:41:31,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:41:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-03-08 17:41:31,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2025-03-08 17:41:31,549 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 101 flow. Second operand 3 states and 66 transitions. [2025-03-08 17:41:31,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 41 transitions, 179 flow [2025-03-08 17:41:31,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 41 transitions, 174 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-08 17:41:31,557 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 108 flow [2025-03-08 17:41:31,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2025-03-08 17:41:31,558 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2025-03-08 17:41:31,558 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 108 flow [2025-03-08 17:41:31,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:41:31,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:31,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:41:31,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:41:31,558 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:41:31,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:31,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1297487312, now seen corresponding path program 1 times [2025-03-08 17:41:31,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:31,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713150930] [2025-03-08 17:41:31,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:31,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:31,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 17:41:31,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 17:41:31,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:31,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:41:31,612 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-08 17:41:31,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:41:31,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713150930] [2025-03-08 17:41:31,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713150930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:41:31,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:41:31,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:41:31,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888987887] [2025-03-08 17:41:31,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:41:31,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:41:31,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:41:31,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:41:31,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:41:31,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-03-08 17:41:31,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-08 17:41:31,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:41:31,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-03-08 17:41:31,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:41:33,091 INFO L124 PetriNetUnfolderBase]: 20687/27454 cut-off events. [2025-03-08 17:41:33,092 INFO L125 PetriNetUnfolderBase]: For 2441/2441 co-relation queries the response was YES. [2025-03-08 17:41:33,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56348 conditions, 27454 events. 20687/27454 cut-off events. For 2441/2441 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 156785 event pairs, 16724 based on Foata normal form. 0/26380 useless extension candidates. Maximal degree in co-relation 16350. Up to 22186 conditions per place. [2025-03-08 17:41:33,256 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 36 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2025-03-08 17:41:33,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 212 flow [2025-03-08 17:41:33,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:41:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:41:33,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-03-08 17:41:33,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5460526315789473 [2025-03-08 17:41:33,258 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 108 flow. Second operand 4 states and 83 transitions. [2025-03-08 17:41:33,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 212 flow [2025-03-08 17:41:33,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 48 transitions, 210 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:41:33,264 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 120 flow [2025-03-08 17:41:33,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2025-03-08 17:41:33,265 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places. [2025-03-08 17:41:33,267 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 120 flow [2025-03-08 17:41:33,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-08 17:41:33,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:33,268 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:41:33,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:41:33,268 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:41:33,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:33,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1567423680, now seen corresponding path program 1 times [2025-03-08 17:41:33,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:33,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578842070] [2025-03-08 17:41:33,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:33,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:33,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 17:41:33,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 17:41:33,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:33,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:41:33,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:41:33,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:41:33,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578842070] [2025-03-08 17:41:33,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578842070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:41:33,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:41:33,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:41:33,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513687340] [2025-03-08 17:41:33,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:41:33,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:41:33,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:41:33,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:41:33,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:41:33,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-03-08 17:41:33,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:41:33,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:41:33,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-03-08 17:41:33,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:41:34,773 INFO L124 PetriNetUnfolderBase]: 20642/27967 cut-off events. [2025-03-08 17:41:34,773 INFO L125 PetriNetUnfolderBase]: For 4874/4874 co-relation queries the response was YES. [2025-03-08 17:41:34,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60823 conditions, 27967 events. 20642/27967 cut-off events. For 4874/4874 co-relation queries the response was YES. Maximal size of possible extension queue 1191. Compared 165514 event pairs, 5684 based on Foata normal form. 9/27072 useless extension candidates. Maximal degree in co-relation 29547. Up to 25624 conditions per place. [2025-03-08 17:41:34,896 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 41 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2025-03-08 17:41:34,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 244 flow [2025-03-08 17:41:34,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:41:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:41:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2025-03-08 17:41:34,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2025-03-08 17:41:34,898 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 120 flow. Second operand 4 states and 88 transitions. [2025-03-08 17:41:34,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 244 flow [2025-03-08 17:41:35,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 53 transitions, 238 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-08 17:41:35,035 INFO L231 Difference]: Finished difference. Result has 54 places, 37 transitions, 130 flow [2025-03-08 17:41:35,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2025-03-08 17:41:35,036 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2025-03-08 17:41:35,036 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 37 transitions, 130 flow [2025-03-08 17:41:35,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:41:35,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:35,036 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:41:35,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 17:41:35,036 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:41:35,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:35,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1239886537, now seen corresponding path program 1 times [2025-03-08 17:41:35,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:35,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962912834] [2025-03-08 17:41:35,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:35,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:35,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 17:41:35,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 17:41:35,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:35,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:41:35,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:41:35,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:41:35,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962912834] [2025-03-08 17:41:35,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962912834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:41:35,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:41:35,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:41:35,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783115092] [2025-03-08 17:41:35,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:41:35,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:41:35,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:41:35,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:41:35,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:41:35,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-03-08 17:41:35,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 37 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-08 17:41:35,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:41:35,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-03-08 17:41:35,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:41:36,093 INFO L124 PetriNetUnfolderBase]: 19913/27565 cut-off events. [2025-03-08 17:41:36,094 INFO L125 PetriNetUnfolderBase]: For 4522/4522 co-relation queries the response was YES. [2025-03-08 17:41:36,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59135 conditions, 27565 events. 19913/27565 cut-off events. For 4522/4522 co-relation queries the response was YES. Maximal size of possible extension queue 1222. Compared 170451 event pairs, 728 based on Foata normal form. 81/26826 useless extension candidates. Maximal degree in co-relation 30693. Up to 18955 conditions per place. [2025-03-08 17:41:36,229 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 53 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2025-03-08 17:41:36,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 302 flow [2025-03-08 17:41:36,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:41:36,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:41:36,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2025-03-08 17:41:36,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5894736842105263 [2025-03-08 17:41:36,231 INFO L175 Difference]: Start difference. First operand has 54 places, 37 transitions, 130 flow. Second operand 5 states and 112 transitions. [2025-03-08 17:41:36,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 302 flow [2025-03-08 17:41:36,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 296 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-08 17:41:36,327 INFO L231 Difference]: Finished difference. Result has 57 places, 37 transitions, 136 flow [2025-03-08 17:41:36,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=57, PETRI_TRANSITIONS=37} [2025-03-08 17:41:36,327 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 10 predicate places. [2025-03-08 17:41:36,327 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 37 transitions, 136 flow [2025-03-08 17:41:36,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-08 17:41:36,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:36,328 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:41:36,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:41:36,328 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:41:36,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:36,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1829709968, now seen corresponding path program 1 times [2025-03-08 17:41:36,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:36,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759737967] [2025-03-08 17:41:36,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:36,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:36,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 17:41:36,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 17:41:36,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:36,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:41:36,338 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:41:36,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 17:41:36,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 17:41:36,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:36,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:41:36,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:41:36,345 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:41:36,345 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-03-08 17:41:36,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-08 17:41:36,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-08 17:41:36,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 17:41:36,346 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 17:41:36,346 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 17:41:36,346 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-08 17:41:36,363 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 17:41:36,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 46 transitions, 148 flow [2025-03-08 17:41:36,369 INFO L124 PetriNetUnfolderBase]: 10/87 cut-off events. [2025-03-08 17:41:36,369 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-08 17:41:36,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 87 events. 10/87 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 175 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 99. Up to 10 conditions per place. [2025-03-08 17:41:36,369 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 46 transitions, 148 flow [2025-03-08 17:41:36,370 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 42 transitions, 136 flow [2025-03-08 17:41:36,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:41:36,371 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;@25430288, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:41:36,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-08 17:41:36,372 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:41:36,372 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2025-03-08 17:41:36,373 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:41:36,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:36,373 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 17:41:36,373 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:41:36,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:36,373 INFO L85 PathProgramCache]: Analyzing trace with hash 268501079, now seen corresponding path program 1 times [2025-03-08 17:41:36,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:36,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763735883] [2025-03-08 17:41:36,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:36,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:36,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 17:41:36,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 17:41:36,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:36,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:41:36,393 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-08 17:41:36,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:41:36,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763735883] [2025-03-08 17:41:36,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763735883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:41:36,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:41:36,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:41:36,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509740057] [2025-03-08 17:41:36,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:41:36,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:41:36,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:41:36,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:41:36,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:41:36,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-08 17:41:36,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-08 17:41:36,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:41:36,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-08 17:41:36,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:41:48,978 INFO L124 PetriNetUnfolderBase]: 213644/267142 cut-off events. [2025-03-08 17:41:48,978 INFO L125 PetriNetUnfolderBase]: For 43039/43039 co-relation queries the response was YES. [2025-03-08 17:41:49,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538610 conditions, 267142 events. 213644/267142 cut-off events. For 43039/43039 co-relation queries the response was YES. Maximal size of possible extension queue 8581. Compared 1593027 event pairs, 150524 based on Foata normal form. 0/249942 useless extension candidates. Maximal degree in co-relation 160944. Up to 255442 conditions per place. [2025-03-08 17:41:50,403 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 36 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2025-03-08 17:41:50,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 49 transitions, 226 flow [2025-03-08 17:41:50,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:41:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:41:50,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2025-03-08 17:41:50,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2025-03-08 17:41:50,404 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 136 flow. Second operand 3 states and 78 transitions. [2025-03-08 17:41:50,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 49 transitions, 226 flow [2025-03-08 17:41:50,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 49 transitions, 213 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-08 17:41:50,796 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 135 flow [2025-03-08 17:41:50,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2025-03-08 17:41:50,796 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 2 predicate places. [2025-03-08 17:41:50,796 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 135 flow [2025-03-08 17:41:50,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-08 17:41:50,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:50,797 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:41:50,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 17:41:50,797 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:41:50,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:50,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1702955837, now seen corresponding path program 1 times [2025-03-08 17:41:50,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:50,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084028873] [2025-03-08 17:41:50,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:50,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:50,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 17:41:50,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 17:41:50,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:50,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:41:50,836 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-08 17:41:50,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:41:50,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084028873] [2025-03-08 17:41:50,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084028873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:41:50,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:41:50,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:41:50,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346703015] [2025-03-08 17:41:50,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:41:50,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:41:50,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:41:50,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:41:50,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:41:50,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-08 17:41:50,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-08 17:41:50,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:41:50,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-08 17:41:50,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand