./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 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/weaver/parallel-misc-2.wvr.c -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 c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:45:07,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:45:07,667 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:45:07,672 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:45:07,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:45:07,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:45:07,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:45:07,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:45:07,695 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:45:07,695 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:45:07,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:45:07,695 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:45:07,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:45:07,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:45:07,695 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:45:07,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:45:07,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:45:07,695 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:45:07,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:45:07,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:45:07,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:45:07,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:45:07,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:45:07,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:45:07,696 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:45:07,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:45:07,696 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:45:07,696 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:45:07,696 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:45:07,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:45:07,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:45:07,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:45:07,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:45:07,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:45:07,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:45:07,696 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:45:07,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:45:07,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:45:07,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:45:07,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:45:07,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:45:07,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:45:07,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:45:07,697 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 -> c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf [2025-03-13 21:45:07,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:45:07,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:45:07,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:45:07,941 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:45:07,941 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:45:07,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2025-03-13 21:45:09,056 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/902f8cb0d/af607578c2204b5f9f1d117e3b8120f2/FLAGd7219afe7 [2025-03-13 21:45:09,278 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:45:09,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2025-03-13 21:45:09,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/902f8cb0d/af607578c2204b5f9f1d117e3b8120f2/FLAGd7219afe7 [2025-03-13 21:45:09,617 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/902f8cb0d/af607578c2204b5f9f1d117e3b8120f2 [2025-03-13 21:45:09,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:45:09,620 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:45:09,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:45:09,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:45:09,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:45:09,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:45:09" (1/1) ... [2025-03-13 21:45:09,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f65a6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:09, skipping insertion in model container [2025-03-13 21:45:09,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:45:09" (1/1) ... [2025-03-13 21:45:09,634 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:45:09,750 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/weaver/parallel-misc-2.wvr.c[2249,2262] [2025-03-13 21:45:09,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:45:09,760 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:45:09,777 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/weaver/parallel-misc-2.wvr.c[2249,2262] [2025-03-13 21:45:09,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:45:09,793 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:45:09,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:09 WrapperNode [2025-03-13 21:45:09,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:45:09,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:45:09,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:45:09,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:45:09,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:09" (1/1) ... [2025-03-13 21:45:09,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:09" (1/1) ... [2025-03-13 21:45:09,824 INFO L138 Inliner]: procedures = 18, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-03-13 21:45:09,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:45:09,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:45:09,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:45:09,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:45:09,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:09" (1/1) ... [2025-03-13 21:45:09,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:09" (1/1) ... [2025-03-13 21:45:09,834 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:09" (1/1) ... [2025-03-13 21:45:09,843 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-13 21:45:09,844 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:09" (1/1) ... [2025-03-13 21:45:09,844 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:09" (1/1) ... [2025-03-13 21:45:09,846 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:09" (1/1) ... [2025-03-13 21:45:09,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:09" (1/1) ... [2025-03-13 21:45:09,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:09" (1/1) ... [2025-03-13 21:45:09,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:09" (1/1) ... [2025-03-13 21:45:09,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:45:09,849 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:45:09,850 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:45:09,850 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:45:09,851 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:09" (1/1) ... [2025-03-13 21:45:09,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:45:09,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:45:09,876 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-13 21:45:09,878 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-13 21:45:09,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:45:09,893 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:45:09,893 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:45:09,893 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:45:09,893 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:45:09,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:45:09,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:45:09,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:45:09,894 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:45:09,946 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:45:09,947 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:45:10,091 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:45:10,092 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:45:10,092 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:45:10,208 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:45:10,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:45:10 BoogieIcfgContainer [2025-03-13 21:45:10,209 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:45:10,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:45:10,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:45:10,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:45:10,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:45:09" (1/3) ... [2025-03-13 21:45:10,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e0e1c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:45:10, skipping insertion in model container [2025-03-13 21:45:10,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:09" (2/3) ... [2025-03-13 21:45:10,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e0e1c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:45:10, skipping insertion in model container [2025-03-13 21:45:10,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:45:10" (3/3) ... [2025-03-13 21:45:10,217 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2025-03-13 21:45:10,229 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:45:10,231 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-2.wvr.c that has 3 procedures, 29 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-13 21:45:10,231 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:45:10,267 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:45:10,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 78 flow [2025-03-13 21:45:10,315 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-03-13 21:45:10,319 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:45:10,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 30 events. 4/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-03-13 21:45:10,321 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 78 flow [2025-03-13 21:45:10,323 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 29 transitions, 70 flow [2025-03-13 21:45:10,329 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:45:10,339 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;@67937800, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:45:10,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-13 21:45:10,350 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:45:10,350 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-03-13 21:45:10,351 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:45:10,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:10,352 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:10,353 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-13 21:45:10,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:10,358 INFO L85 PathProgramCache]: Analyzing trace with hash -123945489, now seen corresponding path program 1 times [2025-03-13 21:45:10,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:10,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883177098] [2025-03-13 21:45:10,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:45:10,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:10,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-13 21:45:10,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 21:45:10,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:45:10,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:10,610 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-13 21:45:10,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:10,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883177098] [2025-03-13 21:45:10,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883177098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:10,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:10,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:45:10,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47549488] [2025-03-13 21:45:10,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:10,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:45:10,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:10,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:45:10,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:45:10,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-03-13 21:45:10,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:10,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:10,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-03-13 21:45:10,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:10,756 INFO L124 PetriNetUnfolderBase]: 146/286 cut-off events. [2025-03-13 21:45:10,756 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-13 21:45:10,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 286 events. 146/286 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1140 event pairs, 12 based on Foata normal form. 1/254 useless extension candidates. Maximal degree in co-relation 458. Up to 186 conditions per place. [2025-03-13 21:45:10,761 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 21 selfloop transitions, 7 changer transitions 1/40 dead transitions. [2025-03-13 21:45:10,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 159 flow [2025-03-13 21:45:10,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:45:10,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:45:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-03-13 21:45:10,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-03-13 21:45:10,769 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 70 flow. Second operand 3 states and 69 transitions. [2025-03-13 21:45:10,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 159 flow [2025-03-13 21:45:10,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 40 transitions, 145 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 21:45:10,774 INFO L231 Difference]: Finished difference. Result has 31 places, 33 transitions, 101 flow [2025-03-13 21:45:10,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=31, PETRI_TRANSITIONS=33} [2025-03-13 21:45:10,778 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2025-03-13 21:45:10,778 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 33 transitions, 101 flow [2025-03-13 21:45:10,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:10,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:10,778 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:10,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:45:10,778 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-13 21:45:10,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:10,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1666846895, now seen corresponding path program 1 times [2025-03-13 21:45:10,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:10,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983229608] [2025-03-13 21:45:10,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:45:10,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:10,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:45:10,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:45:10,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:45:10,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:10,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:10,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983229608] [2025-03-13 21:45:10,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983229608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:10,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:10,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:45:10,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058388043] [2025-03-13 21:45:10,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:10,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:45:10,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:10,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:45:10,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:45:10,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-03-13 21:45:10,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 33 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-13 21:45:10,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:10,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-03-13 21:45:10,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:11,099 INFO L124 PetriNetUnfolderBase]: 225/415 cut-off events. [2025-03-13 21:45:11,100 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-03-13 21:45:11,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 415 events. 225/415 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1866 event pairs, 26 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 322. Up to 182 conditions per place. [2025-03-13 21:45:11,103 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 45 selfloop transitions, 10 changer transitions 5/69 dead transitions. [2025-03-13 21:45:11,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 69 transitions, 326 flow [2025-03-13 21:45:11,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:45:11,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:45:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-03-13 21:45:11,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-03-13 21:45:11,104 INFO L175 Difference]: Start difference. First operand has 31 places, 33 transitions, 101 flow. Second operand 5 states and 110 transitions. [2025-03-13 21:45:11,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 69 transitions, 326 flow [2025-03-13 21:45:11,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 69 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:45:11,106 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 155 flow [2025-03-13 21:45:11,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=37, PETRI_TRANSITIONS=40} [2025-03-13 21:45:11,106 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2025-03-13 21:45:11,106 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 155 flow [2025-03-13 21:45:11,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-13 21:45:11,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:11,107 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:11,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:45:11,107 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-13 21:45:11,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:11,108 INFO L85 PathProgramCache]: Analyzing trace with hash -651606797, now seen corresponding path program 2 times [2025-03-13 21:45:11,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:11,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744069208] [2025-03-13 21:45:11,108 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:45:11,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:11,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:45:11,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:45:11,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:45:11,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:11,211 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-13 21:45:11,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:11,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744069208] [2025-03-13 21:45:11,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744069208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:11,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:11,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:45:11,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880988434] [2025-03-13 21:45:11,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:11,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:45:11,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:11,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:45:11,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:45:11,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-03-13 21:45:11,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-13 21:45:11,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:11,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-03-13 21:45:11,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:11,328 INFO L124 PetriNetUnfolderBase]: 213/424 cut-off events. [2025-03-13 21:45:11,328 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2025-03-13 21:45:11,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 424 events. 213/424 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1946 event pairs, 12 based on Foata normal form. 12/404 useless extension candidates. Maximal degree in co-relation 393. Up to 112 conditions per place. [2025-03-13 21:45:11,332 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 44 selfloop transitions, 12 changer transitions 4/69 dead transitions. [2025-03-13 21:45:11,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 69 transitions, 382 flow [2025-03-13 21:45:11,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:45:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:45:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-03-13 21:45:11,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66875 [2025-03-13 21:45:11,333 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 155 flow. Second operand 5 states and 107 transitions. [2025-03-13 21:45:11,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 69 transitions, 382 flow [2025-03-13 21:45:11,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 69 transitions, 382 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:45:11,335 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 241 flow [2025-03-13 21:45:11,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2025-03-13 21:45:11,335 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2025-03-13 21:45:11,336 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 241 flow [2025-03-13 21:45:11,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-13 21:45:11,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:11,336 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:11,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:45:11,337 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-13 21:45:11,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:11,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1067980211, now seen corresponding path program 1 times [2025-03-13 21:45:11,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:11,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757458408] [2025-03-13 21:45:11,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:45:11,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:11,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:45:11,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:45:11,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:45:11,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:11,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:11,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757458408] [2025-03-13 21:45:11,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757458408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:11,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:11,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:45:11,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865930358] [2025-03-13 21:45:11,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:11,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:45:11,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:11,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:45:11,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:45:11,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-03-13 21:45:11,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-13 21:45:11,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:11,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-03-13 21:45:11,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:11,559 INFO L124 PetriNetUnfolderBase]: 212/413 cut-off events. [2025-03-13 21:45:11,560 INFO L125 PetriNetUnfolderBase]: For 644/644 co-relation queries the response was YES. [2025-03-13 21:45:11,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 413 events. 212/413 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1937 event pairs, 22 based on Foata normal form. 2/380 useless extension candidates. Maximal degree in co-relation 668. Up to 191 conditions per place. [2025-03-13 21:45:11,563 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 52 selfloop transitions, 9 changer transitions 2/72 dead transitions. [2025-03-13 21:45:11,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 72 transitions, 482 flow [2025-03-13 21:45:11,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:45:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:45:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-03-13 21:45:11,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6625 [2025-03-13 21:45:11,564 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 241 flow. Second operand 5 states and 106 transitions. [2025-03-13 21:45:11,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 72 transitions, 482 flow [2025-03-13 21:45:11,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 72 transitions, 478 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-13 21:45:11,570 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 292 flow [2025-03-13 21:45:11,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2025-03-13 21:45:11,571 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2025-03-13 21:45:11,571 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 292 flow [2025-03-13 21:45:11,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-13 21:45:11,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:11,572 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:11,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:45:11,572 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:45:11,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:11,573 INFO L85 PathProgramCache]: Analyzing trace with hash -465607505, now seen corresponding path program 2 times [2025-03-13 21:45:11,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:11,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945845702] [2025-03-13 21:45:11,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:45:11,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:11,579 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:45:11,587 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:45:11,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:45:11,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:11,669 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-13 21:45:11,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:11,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945845702] [2025-03-13 21:45:11,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945845702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:11,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:11,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:45:11,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869099025] [2025-03-13 21:45:11,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:11,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:45:11,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:11,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:45:11,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:45:11,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-03-13 21:45:11,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 292 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-13 21:45:11,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:11,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-03-13 21:45:11,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:11,775 INFO L124 PetriNetUnfolderBase]: 201/418 cut-off events. [2025-03-13 21:45:11,775 INFO L125 PetriNetUnfolderBase]: For 835/835 co-relation queries the response was YES. [2025-03-13 21:45:11,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 418 events. 201/418 cut-off events. For 835/835 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1834 event pairs, 10 based on Foata normal form. 17/401 useless extension candidates. Maximal degree in co-relation 896. Up to 117 conditions per place. [2025-03-13 21:45:11,778 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 50 selfloop transitions, 12 changer transitions 1/72 dead transitions. [2025-03-13 21:45:11,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 534 flow [2025-03-13 21:45:11,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:45:11,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:45:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-03-13 21:45:11,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64375 [2025-03-13 21:45:11,779 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 292 flow. Second operand 5 states and 103 transitions. [2025-03-13 21:45:11,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 534 flow [2025-03-13 21:45:11,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 518 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 21:45:11,784 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 355 flow [2025-03-13 21:45:11,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=355, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2025-03-13 21:45:11,784 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 25 predicate places. [2025-03-13 21:45:11,785 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 355 flow [2025-03-13 21:45:11,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-13 21:45:11,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:11,785 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:11,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:45:11,785 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:45:11,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:11,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1065239863, now seen corresponding path program 1 times [2025-03-13 21:45:11,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:11,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569186357] [2025-03-13 21:45:11,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:45:11,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:11,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:45:11,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:45:11,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:45:11,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:11,996 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-13 21:45:11,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:11,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569186357] [2025-03-13 21:45:11,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569186357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:11,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:11,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:45:11,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798626422] [2025-03-13 21:45:11,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:11,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:45:11,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:11,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:45:11,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:45:12,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-13 21:45:12,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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-13 21:45:12,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:12,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-13 21:45:12,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:12,126 INFO L124 PetriNetUnfolderBase]: 251/511 cut-off events. [2025-03-13 21:45:12,126 INFO L125 PetriNetUnfolderBase]: For 1446/1494 co-relation queries the response was YES. [2025-03-13 21:45:12,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1794 conditions, 511 events. 251/511 cut-off events. For 1446/1494 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2388 event pairs, 14 based on Foata normal form. 20/470 useless extension candidates. Maximal degree in co-relation 712. Up to 163 conditions per place. [2025-03-13 21:45:12,130 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 47 selfloop transitions, 23 changer transitions 0/84 dead transitions. [2025-03-13 21:45:12,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 694 flow [2025-03-13 21:45:12,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:45:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:45:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2025-03-13 21:45:12,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640625 [2025-03-13 21:45:12,132 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 355 flow. Second operand 6 states and 123 transitions. [2025-03-13 21:45:12,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 694 flow [2025-03-13 21:45:12,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 84 transitions, 679 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 21:45:12,139 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 490 flow [2025-03-13 21:45:12,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=490, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2025-03-13 21:45:12,139 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 31 predicate places. [2025-03-13 21:45:12,140 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 490 flow [2025-03-13 21:45:12,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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-13 21:45:12,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:12,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:12,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:45:12,140 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:45:12,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:12,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1321531165, now seen corresponding path program 2 times [2025-03-13 21:45:12,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:12,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235198179] [2025-03-13 21:45:12,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:45:12,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:12,147 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-13 21:45:12,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 24 statements. [2025-03-13 21:45:12,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:45:12,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:12,267 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-13 21:45:12,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:12,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235198179] [2025-03-13 21:45:12,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235198179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:12,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:12,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:45:12,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998669865] [2025-03-13 21:45:12,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:12,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:45:12,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:12,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:45:12,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:45:12,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-13 21:45:12,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 490 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-13 21:45:12,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:12,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-13 21:45:12,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:12,383 INFO L124 PetriNetUnfolderBase]: 299/616 cut-off events. [2025-03-13 21:45:12,383 INFO L125 PetriNetUnfolderBase]: For 2110/2158 co-relation queries the response was YES. [2025-03-13 21:45:12,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2278 conditions, 616 events. 299/616 cut-off events. For 2110/2158 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2969 event pairs, 32 based on Foata normal form. 8/554 useless extension candidates. Maximal degree in co-relation 928. Up to 172 conditions per place. [2025-03-13 21:45:12,388 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 56 selfloop transitions, 17 changer transitions 0/87 dead transitions. [2025-03-13 21:45:12,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 812 flow [2025-03-13 21:45:12,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:45:12,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:45:12,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-03-13 21:45:12,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6625 [2025-03-13 21:45:12,389 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 490 flow. Second operand 5 states and 106 transitions. [2025-03-13 21:45:12,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 812 flow [2025-03-13 21:45:12,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 87 transitions, 799 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 21:45:12,396 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 589 flow [2025-03-13 21:45:12,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=589, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2025-03-13 21:45:12,397 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 36 predicate places. [2025-03-13 21:45:12,398 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 589 flow [2025-03-13 21:45:12,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-13 21:45:12,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:12,399 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:12,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:45:12,399 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:45:12,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:12,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1258490189, now seen corresponding path program 3 times [2025-03-13 21:45:12,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:12,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978218947] [2025-03-13 21:45:12,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:45:12,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:12,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-03-13 21:45:12,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 29 statements. [2025-03-13 21:45:12,425 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:45:12,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:12,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:45:12,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:12,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978218947] [2025-03-13 21:45:12,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978218947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:12,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:12,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:45:12,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285871292] [2025-03-13 21:45:12,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:12,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:45:12,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:12,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:45:12,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:45:12,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-03-13 21:45:12,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 589 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-13 21:45:12,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:12,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-03-13 21:45:12,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:12,704 INFO L124 PetriNetUnfolderBase]: 419/807 cut-off events. [2025-03-13 21:45:12,704 INFO L125 PetriNetUnfolderBase]: For 3730/3730 co-relation queries the response was YES. [2025-03-13 21:45:12,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3229 conditions, 807 events. 419/807 cut-off events. For 3730/3730 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3894 event pairs, 31 based on Foata normal form. 19/772 useless extension candidates. Maximal degree in co-relation 2024. Up to 268 conditions per place. [2025-03-13 21:45:12,709 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 67 selfloop transitions, 22 changer transitions 0/98 dead transitions. [2025-03-13 21:45:12,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 98 transitions, 1054 flow [2025-03-13 21:45:12,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:45:12,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:45:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2025-03-13 21:45:12,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5982142857142857 [2025-03-13 21:45:12,711 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 589 flow. Second operand 7 states and 134 transitions. [2025-03-13 21:45:12,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 98 transitions, 1054 flow [2025-03-13 21:45:12,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 98 transitions, 1020 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-13 21:45:12,718 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 693 flow [2025-03-13 21:45:12,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=693, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2025-03-13 21:45:12,720 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 43 predicate places. [2025-03-13 21:45:12,720 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 693 flow [2025-03-13 21:45:12,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-13 21:45:12,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:12,720 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:12,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:45:12,721 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:45:12,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:12,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1517696591, now seen corresponding path program 4 times [2025-03-13 21:45:12,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:12,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676444636] [2025-03-13 21:45:12,722 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:45:12,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:12,727 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-13 21:45:12,737 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:45:12,738 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:45:12,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:12,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:12,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:12,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676444636] [2025-03-13 21:45:12,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676444636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:12,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:12,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:45:12,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902179079] [2025-03-13 21:45:12,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:12,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:45:12,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:12,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:45:12,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:45:12,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-03-13 21:45:12,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 693 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-13 21:45:12,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:12,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-03-13 21:45:12,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:12,943 INFO L124 PetriNetUnfolderBase]: 572/1133 cut-off events. [2025-03-13 21:45:12,943 INFO L125 PetriNetUnfolderBase]: For 5997/6044 co-relation queries the response was YES. [2025-03-13 21:45:12,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4861 conditions, 1133 events. 572/1133 cut-off events. For 5997/6044 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6083 event pairs, 57 based on Foata normal form. 5/1048 useless extension candidates. Maximal degree in co-relation 2768. Up to 405 conditions per place. [2025-03-13 21:45:12,949 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 65 selfloop transitions, 24 changer transitions 0/113 dead transitions. [2025-03-13 21:45:12,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 113 transitions, 1333 flow [2025-03-13 21:45:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:45:12,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:45:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-03-13 21:45:12,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6796875 [2025-03-13 21:45:12,950 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 693 flow. Second operand 4 states and 87 transitions. [2025-03-13 21:45:12,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 113 transitions, 1333 flow [2025-03-13 21:45:12,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 113 transitions, 1311 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-13 21:45:12,961 INFO L231 Difference]: Finished difference. Result has 78 places, 80 transitions, 943 flow [2025-03-13 21:45:12,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=943, PETRI_PLACES=78, PETRI_TRANSITIONS=80} [2025-03-13 21:45:12,961 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 46 predicate places. [2025-03-13 21:45:12,961 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 80 transitions, 943 flow [2025-03-13 21:45:12,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-13 21:45:12,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:12,962 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:12,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:45:12,962 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:45:12,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:12,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1088200312, now seen corresponding path program 1 times [2025-03-13 21:45:12,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:12,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991707363] [2025-03-13 21:45:12,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:45:12,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:12,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:45:12,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:45:12,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:45:12,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:13,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:45:13,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:13,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991707363] [2025-03-13 21:45:13,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991707363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:13,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:13,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:45:13,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548806125] [2025-03-13 21:45:13,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:13,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:45:13,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:13,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:45:13,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:45:13,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-03-13 21:45:13,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 80 transitions, 943 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-13 21:45:13,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:13,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-03-13 21:45:13,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:13,269 INFO L124 PetriNetUnfolderBase]: 840/1613 cut-off events. [2025-03-13 21:45:13,269 INFO L125 PetriNetUnfolderBase]: For 11970/11970 co-relation queries the response was YES. [2025-03-13 21:45:13,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7590 conditions, 1613 events. 840/1613 cut-off events. For 11970/11970 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9207 event pairs, 76 based on Foata normal form. 30/1552 useless extension candidates. Maximal degree in co-relation 4294. Up to 552 conditions per place. [2025-03-13 21:45:13,281 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 97 selfloop transitions, 13 changer transitions 0/121 dead transitions. [2025-03-13 21:45:13,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 121 transitions, 1599 flow [2025-03-13 21:45:13,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:45:13,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:45:13,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-03-13 21:45:13,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64375 [2025-03-13 21:45:13,282 INFO L175 Difference]: Start difference. First operand has 78 places, 80 transitions, 943 flow. Second operand 5 states and 103 transitions. [2025-03-13 21:45:13,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 121 transitions, 1599 flow [2025-03-13 21:45:13,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 121 transitions, 1599 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:45:13,298 INFO L231 Difference]: Finished difference. Result has 83 places, 85 transitions, 1055 flow [2025-03-13 21:45:13,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1055, PETRI_PLACES=83, PETRI_TRANSITIONS=85} [2025-03-13 21:45:13,299 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 51 predicate places. [2025-03-13 21:45:13,300 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 85 transitions, 1055 flow [2025-03-13 21:45:13,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-13 21:45:13,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:13,300 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:13,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:45:13,300 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:45:13,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:13,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1301337218, now seen corresponding path program 2 times [2025-03-13 21:45:13,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:13,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331531740] [2025-03-13 21:45:13,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:45:13,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:13,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-13 21:45:13,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:45:13,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:45:13,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:13,431 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:45:13,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:13,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331531740] [2025-03-13 21:45:13,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331531740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:13,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:13,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:45:13,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761523782] [2025-03-13 21:45:13,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:13,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:45:13,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:13,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:45:13,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:45:13,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-03-13 21:45:13,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 85 transitions, 1055 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-13 21:45:13,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:13,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-03-13 21:45:13,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:13,757 INFO L124 PetriNetUnfolderBase]: 1750/3382 cut-off events. [2025-03-13 21:45:13,757 INFO L125 PetriNetUnfolderBase]: For 29980/30168 co-relation queries the response was YES. [2025-03-13 21:45:13,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17009 conditions, 3382 events. 1750/3382 cut-off events. For 29980/30168 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 24473 event pairs, 573 based on Foata normal form. 24/3188 useless extension candidates. Maximal degree in co-relation 9022. Up to 1075 conditions per place. [2025-03-13 21:45:13,780 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 117 selfloop transitions, 22 changer transitions 0/165 dead transitions. [2025-03-13 21:45:13,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 165 transitions, 2530 flow [2025-03-13 21:45:13,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:45:13,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:45:13,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-03-13 21:45:13,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6953125 [2025-03-13 21:45:13,781 INFO L175 Difference]: Start difference. First operand has 83 places, 85 transitions, 1055 flow. Second operand 4 states and 89 transitions. [2025-03-13 21:45:13,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 165 transitions, 2530 flow [2025-03-13 21:45:13,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 165 transitions, 2521 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-13 21:45:13,808 INFO L231 Difference]: Finished difference. Result has 88 places, 105 transitions, 1479 flow [2025-03-13 21:45:13,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1479, PETRI_PLACES=88, PETRI_TRANSITIONS=105} [2025-03-13 21:45:13,808 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 56 predicate places. [2025-03-13 21:45:13,808 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 105 transitions, 1479 flow [2025-03-13 21:45:13,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-13 21:45:13,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:13,809 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:13,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 21:45:13,809 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:45:13,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:13,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1894127194, now seen corresponding path program 1 times [2025-03-13 21:45:13,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:13,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618203417] [2025-03-13 21:45:13,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:45:13,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:13,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 21:45:13,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:45:13,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:45:13,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:13,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:13,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618203417] [2025-03-13 21:45:13,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618203417] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:45:13,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782127574] [2025-03-13 21:45:13,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:45:13,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:45:13,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:45:13,955 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:45:13,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:45:13,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 21:45:14,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:45:14,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:45:14,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:14,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-13 21:45:14,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:45:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:14,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:45:14,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:14,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782127574] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:45:14,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:45:14,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-13 21:45:14,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013087703] [2025-03-13 21:45:14,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:45:14,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:45:14,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:14,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:45:14,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:45:14,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-03-13 21:45:14,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 105 transitions, 1479 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-13 21:45:14,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:14,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-03-13 21:45:14,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:14,755 INFO L124 PetriNetUnfolderBase]: 2356/5000 cut-off events. [2025-03-13 21:45:14,755 INFO L125 PetriNetUnfolderBase]: For 53369/53599 co-relation queries the response was YES. [2025-03-13 21:45:14,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27368 conditions, 5000 events. 2356/5000 cut-off events. For 53369/53599 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 39850 event pairs, 431 based on Foata normal form. 25/4865 useless extension candidates. Maximal degree in co-relation 11855. Up to 1928 conditions per place. [2025-03-13 21:45:14,788 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 192 selfloop transitions, 25 changer transitions 1/247 dead transitions. [2025-03-13 21:45:14,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 247 transitions, 4054 flow [2025-03-13 21:45:14,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:45:14,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:45:14,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2025-03-13 21:45:14,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2025-03-13 21:45:14,790 INFO L175 Difference]: Start difference. First operand has 88 places, 105 transitions, 1479 flow. Second operand 6 states and 148 transitions. [2025-03-13 21:45:14,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 247 transitions, 4054 flow [2025-03-13 21:45:14,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 247 transitions, 4054 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:45:14,862 INFO L231 Difference]: Finished difference. Result has 94 places, 121 transitions, 1619 flow [2025-03-13 21:45:14,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1479, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1619, PETRI_PLACES=94, PETRI_TRANSITIONS=121} [2025-03-13 21:45:14,862 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 62 predicate places. [2025-03-13 21:45:14,862 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 121 transitions, 1619 flow [2025-03-13 21:45:14,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-13 21:45:14,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:14,863 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:14,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:45:15,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-13 21:45:15,067 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:45:15,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:15,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2113144734, now seen corresponding path program 2 times [2025-03-13 21:45:15,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:15,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181466121] [2025-03-13 21:45:15,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:45:15,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:15,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-13 21:45:15,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:45:15,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:45:15,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:15,212 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:15,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:15,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181466121] [2025-03-13 21:45:15,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181466121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:45:15,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927020686] [2025-03-13 21:45:15,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:45:15,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:45:15,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:45:15,215 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:45:15,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:45:15,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-13 21:45:15,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:45:15,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:45:15,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:15,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-13 21:45:15,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:45:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:15,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:45:15,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:15,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927020686] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:45:15,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:45:15,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-13 21:45:15,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449846860] [2025-03-13 21:45:15,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:45:15,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:45:15,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:15,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:45:15,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:45:15,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-03-13 21:45:15,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 121 transitions, 1619 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-13 21:45:15,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:15,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-03-13 21:45:15,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:16,177 INFO L124 PetriNetUnfolderBase]: 3044/6579 cut-off events. [2025-03-13 21:45:16,178 INFO L125 PetriNetUnfolderBase]: For 72754/73218 co-relation queries the response was YES. [2025-03-13 21:45:16,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37704 conditions, 6579 events. 3044/6579 cut-off events. For 72754/73218 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 55757 event pairs, 573 based on Foata normal form. 36/6461 useless extension candidates. Maximal degree in co-relation 16324. Up to 3399 conditions per place. [2025-03-13 21:45:16,218 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 193 selfloop transitions, 27 changer transitions 1/250 dead transitions. [2025-03-13 21:45:16,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 250 transitions, 4008 flow [2025-03-13 21:45:16,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:45:16,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:45:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-03-13 21:45:16,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7552083333333334 [2025-03-13 21:45:16,219 INFO L175 Difference]: Start difference. First operand has 94 places, 121 transitions, 1619 flow. Second operand 6 states and 145 transitions. [2025-03-13 21:45:16,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 250 transitions, 4008 flow [2025-03-13 21:45:16,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 250 transitions, 3948 flow, removed 30 selfloop flow, removed 0 redundant places. [2025-03-13 21:45:16,269 INFO L231 Difference]: Finished difference. Result has 101 places, 138 transitions, 1769 flow [2025-03-13 21:45:16,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1587, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1769, PETRI_PLACES=101, PETRI_TRANSITIONS=138} [2025-03-13 21:45:16,270 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 69 predicate places. [2025-03-13 21:45:16,270 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 138 transitions, 1769 flow [2025-03-13 21:45:16,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-13 21:45:16,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:16,271 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:16,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-13 21:45:16,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-13 21:45:16,475 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:45:16,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:16,476 INFO L85 PathProgramCache]: Analyzing trace with hash -786983944, now seen corresponding path program 1 times [2025-03-13 21:45:16,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:16,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940536261] [2025-03-13 21:45:16,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:45:16,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:16,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 21:45:16,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:45:16,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:45:16,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:16,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:16,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940536261] [2025-03-13 21:45:16,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940536261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:16,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:16,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:45:16,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850956988] [2025-03-13 21:45:16,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:16,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:45:16,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:16,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:45:16,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:45:16,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-03-13 21:45:16,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 138 transitions, 1769 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-13 21:45:16,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:16,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-03-13 21:45:16,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:17,108 INFO L124 PetriNetUnfolderBase]: 3225/6363 cut-off events. [2025-03-13 21:45:17,108 INFO L125 PetriNetUnfolderBase]: For 72868/73216 co-relation queries the response was YES. [2025-03-13 21:45:17,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36501 conditions, 6363 events. 3225/6363 cut-off events. For 72868/73216 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 49517 event pairs, 628 based on Foata normal form. 100/6324 useless extension candidates. Maximal degree in co-relation 16587. Up to 2428 conditions per place. [2025-03-13 21:45:17,142 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 155 selfloop transitions, 22 changer transitions 0/203 dead transitions. [2025-03-13 21:45:17,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 203 transitions, 2862 flow [2025-03-13 21:45:17,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:45:17,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:45:17,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-03-13 21:45:17,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6640625 [2025-03-13 21:45:17,144 INFO L175 Difference]: Start difference. First operand has 101 places, 138 transitions, 1769 flow. Second operand 4 states and 85 transitions. [2025-03-13 21:45:17,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 203 transitions, 2862 flow [2025-03-13 21:45:17,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 203 transitions, 2840 flow, removed 11 selfloop flow, removed 0 redundant places. [2025-03-13 21:45:17,191 INFO L231 Difference]: Finished difference. Result has 106 places, 132 transitions, 1724 flow [2025-03-13 21:45:17,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1650, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1724, PETRI_PLACES=106, PETRI_TRANSITIONS=132} [2025-03-13 21:45:17,192 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 74 predicate places. [2025-03-13 21:45:17,192 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 132 transitions, 1724 flow [2025-03-13 21:45:17,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-13 21:45:17,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:17,192 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:17,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 21:45:17,192 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:45:17,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:17,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2029971472, now seen corresponding path program 3 times [2025-03-13 21:45:17,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:17,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670016616] [2025-03-13 21:45:17,193 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:45:17,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:17,197 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-03-13 21:45:17,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:45:17,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-13 21:45:17,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:17,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:45:17,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:17,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670016616] [2025-03-13 21:45:17,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670016616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:45:17,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149299906] [2025-03-13 21:45:17,352 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:45:17,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:45:17,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:45:17,354 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:45:17,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 21:45:17,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-03-13 21:45:17,401 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:45:17,402 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-13 21:45:17,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:17,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-13 21:45:17,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:45:17,472 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:45:17,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:45:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:45:17,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149299906] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:45:17,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:45:17,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-13 21:45:17,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091138016] [2025-03-13 21:45:17,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:45:17,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:45:17,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:17,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:45:17,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:45:17,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-03-13 21:45:17,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 132 transitions, 1724 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:17,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:17,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-03-13 21:45:17,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:18,214 INFO L124 PetriNetUnfolderBase]: 2724/6012 cut-off events. [2025-03-13 21:45:18,214 INFO L125 PetriNetUnfolderBase]: For 78998/79288 co-relation queries the response was YES. [2025-03-13 21:45:18,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36081 conditions, 6012 events. 2724/6012 cut-off events. For 78998/79288 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 50464 event pairs, 527 based on Foata normal form. 76/5935 useless extension candidates. Maximal degree in co-relation 18127. Up to 3885 conditions per place. [2025-03-13 21:45:18,259 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 151 selfloop transitions, 27 changer transitions 1/209 dead transitions. [2025-03-13 21:45:18,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 209 transitions, 3096 flow [2025-03-13 21:45:18,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:45:18,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:45:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2025-03-13 21:45:18,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75625 [2025-03-13 21:45:18,263 INFO L175 Difference]: Start difference. First operand has 106 places, 132 transitions, 1724 flow. Second operand 5 states and 121 transitions. [2025-03-13 21:45:18,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 209 transitions, 3096 flow [2025-03-13 21:45:18,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 209 transitions, 3096 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:45:18,325 INFO L231 Difference]: Finished difference. Result has 113 places, 150 transitions, 1962 flow [2025-03-13 21:45:18,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1724, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1962, PETRI_PLACES=113, PETRI_TRANSITIONS=150} [2025-03-13 21:45:18,326 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 81 predicate places. [2025-03-13 21:45:18,326 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 150 transitions, 1962 flow [2025-03-13 21:45:18,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:18,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:18,326 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:18,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-13 21:45:18,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:45:18,527 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:45:18,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:18,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1082140676, now seen corresponding path program 4 times [2025-03-13 21:45:18,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:18,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500439161] [2025-03-13 21:45:18,528 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:45:18,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:18,533 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-13 21:45:18,541 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:45:18,541 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:45:18,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:18,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:18,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:18,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500439161] [2025-03-13 21:45:18,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500439161] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:45:18,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484714977] [2025-03-13 21:45:18,679 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:45:18,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:45:18,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:45:18,681 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:45:18,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 21:45:18,712 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-13 21:45:18,725 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:45:18,726 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:45:18,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:18,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-13 21:45:18,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:45:18,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:18,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:45:18,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:18,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484714977] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:45:18,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:45:18,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-13 21:45:18,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005862480] [2025-03-13 21:45:18,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:45:18,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:45:18,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:18,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:45:18,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:45:18,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-03-13 21:45:18,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 150 transitions, 1962 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-13 21:45:18,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:18,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-03-13 21:45:18,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:19,652 INFO L124 PetriNetUnfolderBase]: 3417/7530 cut-off events. [2025-03-13 21:45:19,652 INFO L125 PetriNetUnfolderBase]: For 104196/104652 co-relation queries the response was YES. [2025-03-13 21:45:19,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46809 conditions, 7530 events. 3417/7530 cut-off events. For 104196/104652 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 65862 event pairs, 583 based on Foata normal form. 166/7523 useless extension candidates. Maximal degree in co-relation 26296. Up to 2691 conditions per place. [2025-03-13 21:45:19,694 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 206 selfloop transitions, 61 changer transitions 1/298 dead transitions. [2025-03-13 21:45:19,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 298 transitions, 4880 flow [2025-03-13 21:45:19,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:45:19,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:45:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2025-03-13 21:45:19,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.765625 [2025-03-13 21:45:19,696 INFO L175 Difference]: Start difference. First operand has 113 places, 150 transitions, 1962 flow. Second operand 6 states and 147 transitions. [2025-03-13 21:45:19,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 298 transitions, 4880 flow [2025-03-13 21:45:19,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 298 transitions, 4872 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-03-13 21:45:19,762 INFO L231 Difference]: Finished difference. Result has 122 places, 172 transitions, 2392 flow [2025-03-13 21:45:19,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1954, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2392, PETRI_PLACES=122, PETRI_TRANSITIONS=172} [2025-03-13 21:45:19,763 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 90 predicate places. [2025-03-13 21:45:19,763 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 172 transitions, 2392 flow [2025-03-13 21:45:19,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-13 21:45:19,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:19,763 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:19,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 21:45:19,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-13 21:45:19,964 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:45:19,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:19,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1253868370, now seen corresponding path program 5 times [2025-03-13 21:45:19,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:19,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103104972] [2025-03-13 21:45:19,964 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:45:19,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:19,972 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-13 21:45:19,984 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:45:19,984 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:45:19,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:20,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:20,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103104972] [2025-03-13 21:45:20,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103104972] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:45:20,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540549883] [2025-03-13 21:45:20,080 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:45:20,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:45:20,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:45:20,082 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:45:20,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 21:45:20,113 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-13 21:45:20,126 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:45:20,126 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:45:20,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:20,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-13 21:45:20,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:45:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:20,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:45:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:20,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540549883] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:45:20,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:45:20,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-13 21:45:20,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184082700] [2025-03-13 21:45:20,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:45:20,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:45:20,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:20,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:45:20,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:45:20,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-03-13 21:45:20,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 172 transitions, 2392 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-13 21:45:20,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:20,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-03-13 21:45:20,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:21,138 INFO L124 PetriNetUnfolderBase]: 3628/8076 cut-off events. [2025-03-13 21:45:21,138 INFO L125 PetriNetUnfolderBase]: For 118501/119093 co-relation queries the response was YES. [2025-03-13 21:45:21,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52080 conditions, 8076 events. 3628/8076 cut-off events. For 118501/119093 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 71798 event pairs, 716 based on Foata normal form. 145/8020 useless extension candidates. Maximal degree in co-relation 31469. Up to 4182 conditions per place. [2025-03-13 21:45:21,190 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 230 selfloop transitions, 33 changer transitions 1/294 dead transitions. [2025-03-13 21:45:21,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 294 transitions, 4943 flow [2025-03-13 21:45:21,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:45:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:45:21,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-03-13 21:45:21,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7552083333333334 [2025-03-13 21:45:21,191 INFO L175 Difference]: Start difference. First operand has 122 places, 172 transitions, 2392 flow. Second operand 6 states and 145 transitions. [2025-03-13 21:45:21,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 294 transitions, 4943 flow [2025-03-13 21:45:21,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 294 transitions, 4895 flow, removed 24 selfloop flow, removed 0 redundant places. [2025-03-13 21:45:21,300 INFO L231 Difference]: Finished difference. Result has 130 places, 182 transitions, 2566 flow [2025-03-13 21:45:21,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2360, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2566, PETRI_PLACES=130, PETRI_TRANSITIONS=182} [2025-03-13 21:45:21,301 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 98 predicate places. [2025-03-13 21:45:21,301 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 182 transitions, 2566 flow [2025-03-13 21:45:21,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-13 21:45:21,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:21,301 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:21,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-13 21:45:21,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-13 21:45:21,502 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:45:21,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:21,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1152053356, now seen corresponding path program 6 times [2025-03-13 21:45:21,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:21,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048671794] [2025-03-13 21:45:21,502 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:45:21,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:21,507 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 3 equivalence classes. [2025-03-13 21:45:21,530 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 21:45:21,532 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-13 21:45:21,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:21,741 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:21,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:21,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048671794] [2025-03-13 21:45:21,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048671794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:45:21,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758000255] [2025-03-13 21:45:21,742 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:45:21,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:45:21,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:45:21,744 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:45:21,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-13 21:45:21,775 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 3 equivalence classes. [2025-03-13 21:45:21,817 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 21:45:21,817 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-13 21:45:21,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:21,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-13 21:45:21,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:45:22,069 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:22,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:45:22,383 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:22,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758000255] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:45:22,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:45:22,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-03-13 21:45:22,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775149296] [2025-03-13 21:45:22,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:45:22,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-13 21:45:22,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:22,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-13 21:45:22,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-13 21:45:22,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-03-13 21:45:22,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 182 transitions, 2566 flow. Second operand has 20 states, 20 states have (on average 14.5) internal successors, (290), 20 states have internal predecessors, (290), 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-13 21:45:22,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:22,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-03-13 21:45:22,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:31,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:45:36,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:45:40,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:45:42,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:46:03,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:46:04,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:46:29,700 INFO L124 PetriNetUnfolderBase]: 20996/42164 cut-off events. [2025-03-13 21:46:29,700 INFO L125 PetriNetUnfolderBase]: For 608279/608279 co-relation queries the response was YES. [2025-03-13 21:46:30,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272526 conditions, 42164 events. 20996/42164 cut-off events. For 608279/608279 co-relation queries the response was YES. Maximal size of possible extension queue 1535. Compared 419129 event pairs, 519 based on Foata normal form. 2206/44369 useless extension candidates. Maximal degree in co-relation 179531. Up to 7718 conditions per place. [2025-03-13 21:46:30,265 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 1676 selfloop transitions, 334 changer transitions 1/2024 dead transitions. [2025-03-13 21:46:30,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 2024 transitions, 28373 flow [2025-03-13 21:46:30,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-13 21:46:30,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2025-03-13 21:46:30,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 1127 transitions. [2025-03-13 21:46:30,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.596927966101695 [2025-03-13 21:46:30,271 INFO L175 Difference]: Start difference. First operand has 130 places, 182 transitions, 2566 flow. Second operand 59 states and 1127 transitions. [2025-03-13 21:46:30,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 2024 transitions, 28373 flow [2025-03-13 21:46:31,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 2024 transitions, 27738 flow, removed 291 selfloop flow, removed 1 redundant places. [2025-03-13 21:46:31,126 INFO L231 Difference]: Finished difference. Result has 221 places, 481 transitions, 9456 flow [2025-03-13 21:46:31,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2526, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=9456, PETRI_PLACES=221, PETRI_TRANSITIONS=481} [2025-03-13 21:46:31,126 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 189 predicate places. [2025-03-13 21:46:31,126 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 481 transitions, 9456 flow [2025-03-13 21:46:31,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 14.5) internal successors, (290), 20 states have internal predecessors, (290), 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-13 21:46:31,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:31,127 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:31,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-13 21:46:31,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-13 21:46:31,331 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:46:31,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:31,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1057385026, now seen corresponding path program 7 times [2025-03-13 21:46:31,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:31,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379420341] [2025-03-13 21:46:31,332 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:46:31,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:31,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-13 21:46:31,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 21:46:31,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:31,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:46:31,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:31,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379420341] [2025-03-13 21:46:31,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379420341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:46:31,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454978510] [2025-03-13 21:46:31,561 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:46:31,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:46:31,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:46:31,563 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:46:31,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-13 21:46:31,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-13 21:46:31,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 21:46:31,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:31,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:31,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-13 21:46:31,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:46:31,967 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:46:31,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:46:32,200 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:46:32,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454978510] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:46:32,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:46:32,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2025-03-13 21:46:32,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842533449] [2025-03-13 21:46:32,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:46:32,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-13 21:46:32,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:32,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-13 21:46:32,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-03-13 21:46:32,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-03-13 21:46:32,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 481 transitions, 9456 flow. Second operand has 21 states, 21 states have (on average 14.428571428571429) internal successors, (303), 21 states have internal predecessors, (303), 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-13 21:46:32,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:32,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-03-13 21:46:32,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:42,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:46:48,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []