./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/mult-flipped-dist.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 7cfd33ca5f647adf12592c5e71401ab9da35a49d8f2ec6d0757ea2cc237974cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:20:16,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:20:16,856 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:20:16,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:20:16,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:20:16,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:20:16,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:20:16,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:20:16,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:20:16,876 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:20:16,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:20:16,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:20:16,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:20:16,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:20:16,876 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:20:16,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:20:16,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:20:16,876 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:20:16,877 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:20:16,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:20:16,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:20:16,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:20:16,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:20:16,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:20:16,877 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:20:16,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:20:16,877 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:20:16,877 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:20:16,878 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:20:16,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:20:16,878 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:20:16,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:20:16,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:20:16,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:20:16,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:20:16,878 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:20:16,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:20:16,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:20:16,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:20:16,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:20:16,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:20:16,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:20:16,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:20:16,879 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 -> 7cfd33ca5f647adf12592c5e71401ab9da35a49d8f2ec6d0757ea2cc237974cc [2025-03-04 02:20:17,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:20:17,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:20:17,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:20:17,142 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:20:17,142 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:20:17,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c [2025-03-04 02:20:18,946 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6e8da36b/20e1cc63f6244fb9a81df1caf174d164/FLAG56f204d81 [2025-03-04 02:20:19,194 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:20:19,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c [2025-03-04 02:20:19,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6e8da36b/20e1cc63f6244fb9a81df1caf174d164/FLAG56f204d81 [2025-03-04 02:20:19,223 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6e8da36b/20e1cc63f6244fb9a81df1caf174d164 [2025-03-04 02:20:19,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:20:19,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:20:19,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:20:19,228 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:20:19,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:20:19,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:20:19" (1/1) ... [2025-03-04 02:20:19,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@427923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:19, skipping insertion in model container [2025-03-04 02:20:19,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:20:19" (1/1) ... [2025-03-04 02:20:19,246 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:20:19,369 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/mult-flipped-dist.wvr.c[2174,2187] [2025-03-04 02:20:19,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:20:19,381 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:20:19,397 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/mult-flipped-dist.wvr.c[2174,2187] [2025-03-04 02:20:19,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:20:19,411 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:20:19,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:19 WrapperNode [2025-03-04 02:20:19,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:20:19,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:20:19,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:20:19,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:20:19,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:19" (1/1) ... [2025-03-04 02:20:19,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:19" (1/1) ... [2025-03-04 02:20:19,436 INFO L138 Inliner]: procedures = 21, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2025-03-04 02:20:19,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:20:19,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:20:19,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:20:19,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:20:19,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:19" (1/1) ... [2025-03-04 02:20:19,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:19" (1/1) ... [2025-03-04 02:20:19,447 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:19" (1/1) ... [2025-03-04 02:20:19,462 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 02:20:19,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:19" (1/1) ... [2025-03-04 02:20:19,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:19" (1/1) ... [2025-03-04 02:20:19,465 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:19" (1/1) ... [2025-03-04 02:20:19,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:19" (1/1) ... [2025-03-04 02:20:19,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:19" (1/1) ... [2025-03-04 02:20:19,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:19" (1/1) ... [2025-03-04 02:20:19,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:20:19,468 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:20:19,468 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:20:19,468 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:20:19,469 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:19" (1/1) ... [2025-03-04 02:20:19,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:20:19,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:19,491 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:20:19,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:20:19,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:20:19,508 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:20:19,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:20:19,508 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:20:19,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:20:19,508 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:20:19,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:20:19,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:20:19,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:20:19,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:20:19,509 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:20:19,566 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:20:19,567 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:20:19,674 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:20:19,674 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:20:19,758 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:20:19,758 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:20:19,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:20:19 BoogieIcfgContainer [2025-03-04 02:20:19,759 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:20:19,761 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:20:19,762 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:20:19,765 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:20:19,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:20:19" (1/3) ... [2025-03-04 02:20:19,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2539c422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:20:19, skipping insertion in model container [2025-03-04 02:20:19,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:19" (2/3) ... [2025-03-04 02:20:19,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2539c422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:20:19, skipping insertion in model container [2025-03-04 02:20:19,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:20:19" (3/3) ... [2025-03-04 02:20:19,768 INFO L128 eAbstractionObserver]: Analyzing ICFG mult-flipped-dist.wvr.c [2025-03-04 02:20:19,780 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:20:19,781 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mult-flipped-dist.wvr.c that has 4 procedures, 23 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-04 02:20:19,781 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:20:19,831 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 02:20:19,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 71 flow [2025-03-04 02:20:19,884 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-03-04 02:20:19,885 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:20:19,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 3/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-03-04 02:20:19,887 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 25 transitions, 71 flow [2025-03-04 02:20:19,889 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 21 transitions, 60 flow [2025-03-04 02:20:19,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:20:19,913 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;@5f8db939, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:20:19,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:20:19,925 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:20:19,928 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-03-04 02:20:19,928 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:20:19,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:19,929 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:19,929 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:19,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:19,933 INFO L85 PathProgramCache]: Analyzing trace with hash 739378441, now seen corresponding path program 1 times [2025-03-04 02:20:19,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:19,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548889617] [2025-03-04 02:20:19,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:19,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:19,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:20:20,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:20:20,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:20,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:20,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:20,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:20,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548889617] [2025-03-04 02:20:20,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548889617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:20,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:20,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:20:20,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806184870] [2025-03-04 02:20:20,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:20,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:20:20,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:20,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:20:20,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:20:20,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:20,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:20,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:20,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:20,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:20,543 INFO L124 PetriNetUnfolderBase]: 386/565 cut-off events. [2025-03-04 02:20:20,543 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-04 02:20:20,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 565 events. 386/565 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1775 event pairs, 124 based on Foata normal form. 1/416 useless extension candidates. Maximal degree in co-relation 1030. Up to 349 conditions per place. [2025-03-04 02:20:20,551 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 32 selfloop transitions, 4 changer transitions 1/38 dead transitions. [2025-03-04 02:20:20,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 38 transitions, 183 flow [2025-03-04 02:20:20,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:20:20,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:20:20,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-03-04 02:20:20,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 02:20:20,564 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 60 flow. Second operand 3 states and 50 transitions. [2025-03-04 02:20:20,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 38 transitions, 183 flow [2025-03-04 02:20:20,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 38 transitions, 161 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 02:20:20,574 INFO L231 Difference]: Finished difference. Result has 25 places, 24 transitions, 74 flow [2025-03-04 02:20:20,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=25, PETRI_TRANSITIONS=24} [2025-03-04 02:20:20,579 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -3 predicate places. [2025-03-04 02:20:20,579 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 24 transitions, 74 flow [2025-03-04 02:20:20,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:20,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:20,579 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-04 02:20:20,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:20:20,580 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:20,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:20,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1829869085, now seen corresponding path program 1 times [2025-03-04 02:20:20,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:20,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886437708] [2025-03-04 02:20:20,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:20,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:20,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:20:20,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:20:20,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:20,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:20,717 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-04 02:20:20,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:20,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886437708] [2025-03-04 02:20:20,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886437708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:20,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:20,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:20,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824290946] [2025-03-04 02:20:20,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:20,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:20,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:20,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:20,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:20,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:20,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 24 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:20,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:20,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:20,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:20,905 INFO L124 PetriNetUnfolderBase]: 520/743 cut-off events. [2025-03-04 02:20:20,906 INFO L125 PetriNetUnfolderBase]: For 146/146 co-relation queries the response was YES. [2025-03-04 02:20:20,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1823 conditions, 743 events. 520/743 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2461 event pairs, 203 based on Foata normal form. 16/759 useless extension candidates. Maximal degree in co-relation 529. Up to 536 conditions per place. [2025-03-04 02:20:20,910 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 45 selfloop transitions, 12 changer transitions 0/58 dead transitions. [2025-03-04 02:20:20,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 58 transitions, 287 flow [2025-03-04 02:20:20,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:20:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:20:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-03-04 02:20:20,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.568 [2025-03-04 02:20:20,911 INFO L175 Difference]: Start difference. First operand has 25 places, 24 transitions, 74 flow. Second operand 5 states and 71 transitions. [2025-03-04 02:20:20,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 58 transitions, 287 flow [2025-03-04 02:20:20,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 58 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:20:20,915 INFO L231 Difference]: Finished difference. Result has 31 places, 34 transitions, 156 flow [2025-03-04 02:20:20,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=31, PETRI_TRANSITIONS=34} [2025-03-04 02:20:20,915 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2025-03-04 02:20:20,915 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 34 transitions, 156 flow [2025-03-04 02:20:20,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:20,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:20,917 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-04 02:20:20,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:20:20,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:20,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:20,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1531330841, now seen corresponding path program 1 times [2025-03-04 02:20:20,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:20,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285146108] [2025-03-04 02:20:20,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:20,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:20,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:20:20,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:20:20,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:20,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:21,005 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-04 02:20:21,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:21,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285146108] [2025-03-04 02:20:21,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285146108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:21,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:21,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:21,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903458135] [2025-03-04 02:20:21,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:21,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:21,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:21,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:21,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:21,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:21,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 34 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:21,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:21,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:21,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:21,179 INFO L124 PetriNetUnfolderBase]: 546/820 cut-off events. [2025-03-04 02:20:21,179 INFO L125 PetriNetUnfolderBase]: For 761/761 co-relation queries the response was YES. [2025-03-04 02:20:21,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2528 conditions, 820 events. 546/820 cut-off events. For 761/761 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3115 event pairs, 144 based on Foata normal form. 65/885 useless extension candidates. Maximal degree in co-relation 2002. Up to 373 conditions per place. [2025-03-04 02:20:21,196 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 50 selfloop transitions, 10 changer transitions 5/66 dead transitions. [2025-03-04 02:20:21,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 66 transitions, 385 flow [2025-03-04 02:20:21,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:20:21,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:20:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2025-03-04 02:20:21,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.616 [2025-03-04 02:20:21,198 INFO L175 Difference]: Start difference. First operand has 31 places, 34 transitions, 156 flow. Second operand 5 states and 77 transitions. [2025-03-04 02:20:21,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 66 transitions, 385 flow [2025-03-04 02:20:21,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 66 transitions, 373 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-04 02:20:21,203 INFO L231 Difference]: Finished difference. Result has 37 places, 36 transitions, 199 flow [2025-03-04 02:20:21,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=37, PETRI_TRANSITIONS=36} [2025-03-04 02:20:21,203 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 9 predicate places. [2025-03-04 02:20:21,203 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 36 transitions, 199 flow [2025-03-04 02:20:21,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:21,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:21,204 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-04 02:20:21,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:20:21,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:21,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:21,204 INFO L85 PathProgramCache]: Analyzing trace with hash 670134517, now seen corresponding path program 2 times [2025-03-04 02:20:21,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:21,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409808168] [2025-03-04 02:20:21,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:21,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:21,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:20:21,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:20:21,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:21,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:21,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:21,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:21,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409808168] [2025-03-04 02:20:21,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409808168] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:21,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986838294] [2025-03-04 02:20:21,425 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:21,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:21,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:21,431 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:21,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:20:21,469 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:20:21,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:20:21,485 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:21,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:21,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:20:21,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:21,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:21,587 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-04 02:20:21,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986838294] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:21,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:20:21,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 8 [2025-03-04 02:20:21,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627323930] [2025-03-04 02:20:21,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:21,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:20:21,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:21,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:20:21,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:20:21,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:21,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:21,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:21,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:21,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:21,737 INFO L124 PetriNetUnfolderBase]: 623/934 cut-off events. [2025-03-04 02:20:21,737 INFO L125 PetriNetUnfolderBase]: For 2046/2046 co-relation queries the response was YES. [2025-03-04 02:20:21,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3449 conditions, 934 events. 623/934 cut-off events. For 2046/2046 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3526 event pairs, 151 based on Foata normal form. 43/977 useless extension candidates. Maximal degree in co-relation 2452. Up to 520 conditions per place. [2025-03-04 02:20:21,743 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 49 selfloop transitions, 9 changer transitions 12/71 dead transitions. [2025-03-04 02:20:21,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 71 transitions, 514 flow [2025-03-04 02:20:21,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:20:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:20:21,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-03-04 02:20:21,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-03-04 02:20:21,744 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 199 flow. Second operand 4 states and 65 transitions. [2025-03-04 02:20:21,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 71 transitions, 514 flow [2025-03-04 02:20:21,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 71 transitions, 482 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:21,751 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 241 flow [2025-03-04 02:20:21,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=241, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2025-03-04 02:20:21,752 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 12 predicate places. [2025-03-04 02:20:21,752 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 241 flow [2025-03-04 02:20:21,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:21,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:21,753 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-04 02:20:21,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:20:21,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:21,957 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:21,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:21,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1529351921, now seen corresponding path program 3 times [2025-03-04 02:20:21,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:21,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860840778] [2025-03-04 02:20:21,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:21,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:21,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:20:21,978 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:20:21,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:20:21,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:22,020 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-04 02:20:22,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:22,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860840778] [2025-03-04 02:20:22,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860840778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:22,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:22,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:20:22,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942362575] [2025-03-04 02:20:22,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:22,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:20:22,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:22,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:20:22,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:20:22,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:22,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:22,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:22,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:22,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:22,170 INFO L124 PetriNetUnfolderBase]: 705/1076 cut-off events. [2025-03-04 02:20:22,171 INFO L125 PetriNetUnfolderBase]: For 3165/3165 co-relation queries the response was YES. [2025-03-04 02:20:22,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4164 conditions, 1076 events. 705/1076 cut-off events. For 3165/3165 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4348 event pairs, 213 based on Foata normal form. 34/1110 useless extension candidates. Maximal degree in co-relation 2957. Up to 548 conditions per place. [2025-03-04 02:20:22,180 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 53 selfloop transitions, 12 changer transitions 0/66 dead transitions. [2025-03-04 02:20:22,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 66 transitions, 503 flow [2025-03-04 02:20:22,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:20:22,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:20:22,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-03-04 02:20:22,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61 [2025-03-04 02:20:22,182 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 241 flow. Second operand 4 states and 61 transitions. [2025-03-04 02:20:22,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 66 transitions, 503 flow [2025-03-04 02:20:22,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 66 transitions, 494 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:20:22,190 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 306 flow [2025-03-04 02:20:22,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=306, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2025-03-04 02:20:22,192 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 15 predicate places. [2025-03-04 02:20:22,193 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 306 flow [2025-03-04 02:20:22,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:22,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:22,193 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-04 02:20:22,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:20:22,193 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:22,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:22,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1437533193, now seen corresponding path program 2 times [2025-03-04 02:20:22,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:22,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452802673] [2025-03-04 02:20:22,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:22,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:22,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:20:22,206 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:20:22,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:22,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:22,262 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-04 02:20:22,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:22,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452802673] [2025-03-04 02:20:22,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452802673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:22,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:22,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:20:22,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374049232] [2025-03-04 02:20:22,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:22,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:20:22,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:22,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:20:22,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:20:22,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:22,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:22,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:22,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:22,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:22,435 INFO L124 PetriNetUnfolderBase]: 773/1176 cut-off events. [2025-03-04 02:20:22,435 INFO L125 PetriNetUnfolderBase]: For 4802/4802 co-relation queries the response was YES. [2025-03-04 02:20:22,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5219 conditions, 1176 events. 773/1176 cut-off events. For 4802/4802 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4785 event pairs, 207 based on Foata normal form. 36/1212 useless extension candidates. Maximal degree in co-relation 3576. Up to 807 conditions per place. [2025-03-04 02:20:22,444 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 53 selfloop transitions, 8 changer transitions 9/71 dead transitions. [2025-03-04 02:20:22,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 71 transitions, 648 flow [2025-03-04 02:20:22,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:20:22,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:20:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-03-04 02:20:22,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64 [2025-03-04 02:20:22,445 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 306 flow. Second operand 4 states and 64 transitions. [2025-03-04 02:20:22,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 71 transitions, 648 flow [2025-03-04 02:20:22,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 71 transitions, 602 flow, removed 14 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:22,453 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 332 flow [2025-03-04 02:20:22,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=332, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2025-03-04 02:20:22,453 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 18 predicate places. [2025-03-04 02:20:22,453 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 332 flow [2025-03-04 02:20:22,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:22,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:22,454 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-04 02:20:22,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:20:22,454 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:22,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:22,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1851188505, now seen corresponding path program 4 times [2025-03-04 02:20:22,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:22,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586469283] [2025-03-04 02:20:22,454 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:22,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:22,464 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:20:22,468 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:20:22,469 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:20:22,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:22,549 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-04 02:20:22,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:22,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586469283] [2025-03-04 02:20:22,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586469283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:22,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:22,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:22,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66509575] [2025-03-04 02:20:22,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:22,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:22,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:22,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:22,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:22,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:22,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 332 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:22,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:22,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:22,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:22,774 INFO L124 PetriNetUnfolderBase]: 925/1388 cut-off events. [2025-03-04 02:20:22,774 INFO L125 PetriNetUnfolderBase]: For 6234/6234 co-relation queries the response was YES. [2025-03-04 02:20:22,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6091 conditions, 1388 events. 925/1388 cut-off events. For 6234/6234 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5902 event pairs, 228 based on Foata normal form. 32/1420 useless extension candidates. Maximal degree in co-relation 3921. Up to 648 conditions per place. [2025-03-04 02:20:22,783 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 76 selfloop transitions, 25 changer transitions 11/113 dead transitions. [2025-03-04 02:20:22,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 113 transitions, 1094 flow [2025-03-04 02:20:22,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:20:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:20:22,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2025-03-04 02:20:22,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5657142857142857 [2025-03-04 02:20:22,784 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 332 flow. Second operand 7 states and 99 transitions. [2025-03-04 02:20:22,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 113 transitions, 1094 flow [2025-03-04 02:20:22,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 113 transitions, 1082 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:20:22,790 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 544 flow [2025-03-04 02:20:22,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=544, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2025-03-04 02:20:22,792 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 28 predicate places. [2025-03-04 02:20:22,792 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 544 flow [2025-03-04 02:20:22,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:22,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:22,792 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-04 02:20:22,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:20:22,792 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:22,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:22,792 INFO L85 PathProgramCache]: Analyzing trace with hash 685415831, now seen corresponding path program 1 times [2025-03-04 02:20:22,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:22,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740883622] [2025-03-04 02:20:22,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:22,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:22,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:20:22,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:20:22,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:22,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:22,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:22,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:22,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740883622] [2025-03-04 02:20:22,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740883622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:22,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441636624] [2025-03-04 02:20:22,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:22,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:22,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:22,871 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:22,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:20:22,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:20:22,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:20:22,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:22,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:22,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:20:22,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:22,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:22,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:22,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441636624] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:22,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:22,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-04 02:20:22,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333329591] [2025-03-04 02:20:22,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:22,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:20:22,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:22,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:20:22,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:20:22,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:22,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 544 flow. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:22,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:22,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:22,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:23,185 INFO L124 PetriNetUnfolderBase]: 1023/1501 cut-off events. [2025-03-04 02:20:23,186 INFO L125 PetriNetUnfolderBase]: For 10170/10170 co-relation queries the response was YES. [2025-03-04 02:20:23,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8200 conditions, 1501 events. 1023/1501 cut-off events. For 10170/10170 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6124 event pairs, 298 based on Foata normal form. 64/1565 useless extension candidates. Maximal degree in co-relation 5986. Up to 937 conditions per place. [2025-03-04 02:20:23,198 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 75 selfloop transitions, 41 changer transitions 14/131 dead transitions. [2025-03-04 02:20:23,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 131 transitions, 1511 flow [2025-03-04 02:20:23,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:20:23,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:20:23,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2025-03-04 02:20:23,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-03-04 02:20:23,200 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 544 flow. Second operand 6 states and 85 transitions. [2025-03-04 02:20:23,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 131 transitions, 1511 flow [2025-03-04 02:20:23,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 131 transitions, 1445 flow, removed 33 selfloop flow, removed 0 redundant places. [2025-03-04 02:20:23,217 INFO L231 Difference]: Finished difference. Result has 64 places, 83 transitions, 990 flow [2025-03-04 02:20:23,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=990, PETRI_PLACES=64, PETRI_TRANSITIONS=83} [2025-03-04 02:20:23,217 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 36 predicate places. [2025-03-04 02:20:23,217 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 83 transitions, 990 flow [2025-03-04 02:20:23,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:23,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:23,219 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-04 02:20:23,225 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-04 02:20:23,423 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,SelfDestructingSolverStorable7 [2025-03-04 02:20:23,423 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:23,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:23,423 INFO L85 PathProgramCache]: Analyzing trace with hash 975412601, now seen corresponding path program 3 times [2025-03-04 02:20:23,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:23,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167433664] [2025-03-04 02:20:23,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:23,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:23,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:20:23,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:20:23,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:20:23,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:23,461 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-04 02:20:23,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:23,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167433664] [2025-03-04 02:20:23,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167433664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:23,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:23,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:20:23,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504550004] [2025-03-04 02:20:23,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:23,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:20:23,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:23,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:20:23,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:20:23,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:23,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 83 transitions, 990 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:23,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:23,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:23,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:23,609 INFO L124 PetriNetUnfolderBase]: 947/1364 cut-off events. [2025-03-04 02:20:23,609 INFO L125 PetriNetUnfolderBase]: For 11413/11413 co-relation queries the response was YES. [2025-03-04 02:20:23,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8461 conditions, 1364 events. 947/1364 cut-off events. For 11413/11413 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5295 event pairs, 251 based on Foata normal form. 32/1396 useless extension candidates. Maximal degree in co-relation 6927. Up to 900 conditions per place. [2025-03-04 02:20:23,618 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 75 selfloop transitions, 41 changer transitions 5/122 dead transitions. [2025-03-04 02:20:23,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 122 transitions, 1672 flow [2025-03-04 02:20:23,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:20:23,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:20:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-03-04 02:20:23,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 02:20:23,620 INFO L175 Difference]: Start difference. First operand has 64 places, 83 transitions, 990 flow. Second operand 4 states and 60 transitions. [2025-03-04 02:20:23,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 122 transitions, 1672 flow [2025-03-04 02:20:23,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 122 transitions, 1532 flow, removed 57 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:23,640 INFO L231 Difference]: Finished difference. Result has 64 places, 96 transitions, 1216 flow [2025-03-04 02:20:23,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1216, PETRI_PLACES=64, PETRI_TRANSITIONS=96} [2025-03-04 02:20:23,641 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 36 predicate places. [2025-03-04 02:20:23,641 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 96 transitions, 1216 flow [2025-03-04 02:20:23,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:23,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:23,641 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-04 02:20:23,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:20:23,641 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:23,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:23,642 INFO L85 PathProgramCache]: Analyzing trace with hash 804046991, now seen corresponding path program 1 times [2025-03-04 02:20:23,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:23,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005131002] [2025-03-04 02:20:23,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:23,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:23,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:20:23,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:20:23,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:23,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:23,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:23,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005131002] [2025-03-04 02:20:23,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005131002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:23,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305706540] [2025-03-04 02:20:23,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:23,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:23,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:23,714 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:23,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:20:23,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:20:23,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:20:23,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:23,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:23,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:20:23,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:23,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:23,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:23,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305706540] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:23,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:20:23,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-03-04 02:20:23,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330270368] [2025-03-04 02:20:23,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:23,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:20:23,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:23,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:20:23,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:20:23,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:23,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 96 transitions, 1216 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:23,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:23,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:23,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:24,014 INFO L124 PetriNetUnfolderBase]: 1019/1444 cut-off events. [2025-03-04 02:20:24,014 INFO L125 PetriNetUnfolderBase]: For 12310/12310 co-relation queries the response was YES. [2025-03-04 02:20:24,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9513 conditions, 1444 events. 1019/1444 cut-off events. For 12310/12310 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5547 event pairs, 101 based on Foata normal form. 47/1491 useless extension candidates. Maximal degree in co-relation 8094. Up to 1126 conditions per place. [2025-03-04 02:20:24,028 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 93 selfloop transitions, 36 changer transitions 0/130 dead transitions. [2025-03-04 02:20:24,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 130 transitions, 1809 flow [2025-03-04 02:20:24,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:20:24,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:20:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-03-04 02:20:24,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59 [2025-03-04 02:20:24,030 INFO L175 Difference]: Start difference. First operand has 64 places, 96 transitions, 1216 flow. Second operand 4 states and 59 transitions. [2025-03-04 02:20:24,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 130 transitions, 1809 flow [2025-03-04 02:20:24,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 130 transitions, 1709 flow, removed 37 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:24,051 INFO L231 Difference]: Finished difference. Result has 65 places, 106 transitions, 1393 flow [2025-03-04 02:20:24,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1393, PETRI_PLACES=65, PETRI_TRANSITIONS=106} [2025-03-04 02:20:24,051 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 37 predicate places. [2025-03-04 02:20:24,052 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 106 transitions, 1393 flow [2025-03-04 02:20:24,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:24,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:24,052 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-04 02:20:24,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 02:20:24,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:24,256 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:24,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:24,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2130435849, now seen corresponding path program 2 times [2025-03-04 02:20:24,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:24,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826705654] [2025-03-04 02:20:24,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:24,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:24,262 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:20:24,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:20:24,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:24,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:24,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:24,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:24,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826705654] [2025-03-04 02:20:24,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826705654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:24,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:24,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:20:24,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073884052] [2025-03-04 02:20:24,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:24,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:20:24,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:24,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:20:24,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:20:24,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:24,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 106 transitions, 1393 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:24,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:24,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:24,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:24,521 INFO L124 PetriNetUnfolderBase]: 1173/1695 cut-off events. [2025-03-04 02:20:24,521 INFO L125 PetriNetUnfolderBase]: For 16608/16608 co-relation queries the response was YES. [2025-03-04 02:20:24,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11077 conditions, 1695 events. 1173/1695 cut-off events. For 16608/16608 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 6812 event pairs, 287 based on Foata normal form. 72/1767 useless extension candidates. Maximal degree in co-relation 9657. Up to 1056 conditions per place. [2025-03-04 02:20:24,536 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 105 selfloop transitions, 37 changer transitions 6/149 dead transitions. [2025-03-04 02:20:24,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 149 transitions, 2190 flow [2025-03-04 02:20:24,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:20:24,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:20:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-03-04 02:20:24,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.58 [2025-03-04 02:20:24,538 INFO L175 Difference]: Start difference. First operand has 65 places, 106 transitions, 1393 flow. Second operand 4 states and 58 transitions. [2025-03-04 02:20:24,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 149 transitions, 2190 flow [2025-03-04 02:20:24,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 149 transitions, 2153 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-04 02:20:24,559 INFO L231 Difference]: Finished difference. Result has 69 places, 110 transitions, 1587 flow [2025-03-04 02:20:24,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1362, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1587, PETRI_PLACES=69, PETRI_TRANSITIONS=110} [2025-03-04 02:20:24,560 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 41 predicate places. [2025-03-04 02:20:24,560 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 110 transitions, 1587 flow [2025-03-04 02:20:24,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:24,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:24,561 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-04 02:20:24,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:20:24,561 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:24,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:24,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1067010649, now seen corresponding path program 3 times [2025-03-04 02:20:24,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:24,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108962138] [2025-03-04 02:20:24,562 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:24,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:24,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:20:24,572 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:20:24,572 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:20:24,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:24,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:24,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108962138] [2025-03-04 02:20:24,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108962138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:24,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810488060] [2025-03-04 02:20:24,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:24,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:24,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:24,678 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:24,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:20:24,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:20:24,732 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:20:24,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:20:24,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:24,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:20:24,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:24,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:24,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:24,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810488060] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:24,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:24,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 10 [2025-03-04 02:20:24,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763113479] [2025-03-04 02:20:24,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:24,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:24,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:24,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:24,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:24,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:24,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 110 transitions, 1587 flow. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:24,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:24,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:24,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:25,411 INFO L124 PetriNetUnfolderBase]: 1377/1989 cut-off events. [2025-03-04 02:20:25,411 INFO L125 PetriNetUnfolderBase]: For 23279/23279 co-relation queries the response was YES. [2025-03-04 02:20:25,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14419 conditions, 1989 events. 1377/1989 cut-off events. For 23279/23279 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 8297 event pairs, 164 based on Foata normal form. 51/2040 useless extension candidates. Maximal degree in co-relation 12668. Up to 1007 conditions per place. [2025-03-04 02:20:25,429 INFO L140 encePairwiseOnDemand]: 16/25 looper letters, 106 selfloop transitions, 144 changer transitions 5/256 dead transitions. [2025-03-04 02:20:25,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 256 transitions, 3773 flow [2025-03-04 02:20:25,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 02:20:25,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 02:20:25,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 223 transitions. [2025-03-04 02:20:25,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4694736842105263 [2025-03-04 02:20:25,430 INFO L175 Difference]: Start difference. First operand has 69 places, 110 transitions, 1587 flow. Second operand 19 states and 223 transitions. [2025-03-04 02:20:25,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 256 transitions, 3773 flow [2025-03-04 02:20:25,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 256 transitions, 3631 flow, removed 43 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:25,459 INFO L231 Difference]: Finished difference. Result has 95 places, 181 transitions, 3061 flow [2025-03-04 02:20:25,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1501, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3061, PETRI_PLACES=95, PETRI_TRANSITIONS=181} [2025-03-04 02:20:25,461 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 67 predicate places. [2025-03-04 02:20:25,461 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 181 transitions, 3061 flow [2025-03-04 02:20:25,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:25,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:25,462 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-04 02:20:25,468 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-04 02:20:25,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:25,662 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:25,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:25,663 INFO L85 PathProgramCache]: Analyzing trace with hash -998983833, now seen corresponding path program 4 times [2025-03-04 02:20:25,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:25,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050570378] [2025-03-04 02:20:25,663 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:25,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:25,669 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:20:25,675 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:20:25,675 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:20:25,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:25,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:25,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050570378] [2025-03-04 02:20:25,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050570378] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:25,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175100323] [2025-03-04 02:20:25,731 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:25,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:25,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:25,733 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:25,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:20:25,763 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:20:25,774 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:20:25,775 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:20:25,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:25,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:20:25,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:25,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:25,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:25,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:25,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175100323] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:25,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:25,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 02:20:25,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389351423] [2025-03-04 02:20:25,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:25,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:20:25,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:25,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:20:25,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:20:25,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:25,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 181 transitions, 3061 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:25,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:25,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:25,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:26,152 INFO L124 PetriNetUnfolderBase]: 1389/1981 cut-off events. [2025-03-04 02:20:26,152 INFO L125 PetriNetUnfolderBase]: For 30971/30971 co-relation queries the response was YES. [2025-03-04 02:20:26,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16167 conditions, 1981 events. 1389/1981 cut-off events. For 30971/30971 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 7988 event pairs, 286 based on Foata normal form. 42/2023 useless extension candidates. Maximal degree in co-relation 15082. Up to 1203 conditions per place. [2025-03-04 02:20:26,171 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 130 selfloop transitions, 115 changer transitions 1/247 dead transitions. [2025-03-04 02:20:26,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 247 transitions, 4485 flow [2025-03-04 02:20:26,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:20:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:20:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2025-03-04 02:20:26,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5314285714285715 [2025-03-04 02:20:26,172 INFO L175 Difference]: Start difference. First operand has 95 places, 181 transitions, 3061 flow. Second operand 7 states and 93 transitions. [2025-03-04 02:20:26,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 247 transitions, 4485 flow [2025-03-04 02:20:26,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 247 transitions, 3895 flow, removed 235 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:26,242 INFO L231 Difference]: Finished difference. Result has 103 places, 205 transitions, 3355 flow [2025-03-04 02:20:26,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2599, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3355, PETRI_PLACES=103, PETRI_TRANSITIONS=205} [2025-03-04 02:20:26,243 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 75 predicate places. [2025-03-04 02:20:26,243 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 205 transitions, 3355 flow [2025-03-04 02:20:26,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:26,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:26,243 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] [2025-03-04 02:20:26,249 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-04 02:20:26,444 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,SelfDestructingSolverStorable12 [2025-03-04 02:20:26,444 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:26,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:26,445 INFO L85 PathProgramCache]: Analyzing trace with hash -722798203, now seen corresponding path program 1 times [2025-03-04 02:20:26,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:26,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246679431] [2025-03-04 02:20:26,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:26,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:26,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:20:26,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:20:26,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:26,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:26,603 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-04 02:20:26,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:26,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246679431] [2025-03-04 02:20:26,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246679431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:26,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254766163] [2025-03-04 02:20:26,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:26,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:26,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:26,605 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:26,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 02:20:26,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:20:26,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:20:26,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:26,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:26,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 02:20:26,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:26,740 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-04 02:20:26,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:27,206 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-04 02:20:27,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254766163] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:27,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:27,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2025-03-04 02:20:27,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524747009] [2025-03-04 02:20:27,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:27,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:20:27,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:27,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:20:27,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:20:27,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:27,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 205 transitions, 3355 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:27,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:27,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:27,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:27,643 INFO L124 PetriNetUnfolderBase]: 1992/2851 cut-off events. [2025-03-04 02:20:27,643 INFO L125 PetriNetUnfolderBase]: For 35085/35085 co-relation queries the response was YES. [2025-03-04 02:20:27,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21756 conditions, 2851 events. 1992/2851 cut-off events. For 35085/35085 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 12170 event pairs, 176 based on Foata normal form. 2/2853 useless extension candidates. Maximal degree in co-relation 20312. Up to 2119 conditions per place. [2025-03-04 02:20:27,662 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 236 selfloop transitions, 94 changer transitions 2/333 dead transitions. [2025-03-04 02:20:27,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 333 transitions, 5568 flow [2025-03-04 02:20:27,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:20:27,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:20:27,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 134 transitions. [2025-03-04 02:20:27,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5955555555555555 [2025-03-04 02:20:27,663 INFO L175 Difference]: Start difference. First operand has 103 places, 205 transitions, 3355 flow. Second operand 9 states and 134 transitions. [2025-03-04 02:20:27,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 333 transitions, 5568 flow [2025-03-04 02:20:27,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 333 transitions, 5249 flow, removed 84 selfloop flow, removed 4 redundant places. [2025-03-04 02:20:27,747 INFO L231 Difference]: Finished difference. Result has 110 places, 268 transitions, 4483 flow [2025-03-04 02:20:27,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=3146, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4483, PETRI_PLACES=110, PETRI_TRANSITIONS=268} [2025-03-04 02:20:27,747 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 82 predicate places. [2025-03-04 02:20:27,747 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 268 transitions, 4483 flow [2025-03-04 02:20:27,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:27,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:27,748 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] [2025-03-04 02:20:27,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 02:20:27,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:27,948 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:27,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:27,949 INFO L85 PathProgramCache]: Analyzing trace with hash -193645715, now seen corresponding path program 2 times [2025-03-04 02:20:27,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:27,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762228521] [2025-03-04 02:20:27,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:27,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:27,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:20:27,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:20:27,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:27,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:28,093 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-04 02:20:28,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:28,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762228521] [2025-03-04 02:20:28,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762228521] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:28,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026998785] [2025-03-04 02:20:28,094 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:28,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:28,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:28,096 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:28,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 02:20:28,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:20:28,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:20:28,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:28,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:28,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 02:20:28,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:28,200 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-04 02:20:28,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:28,616 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-04 02:20:28,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026998785] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:28,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:28,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 9 [2025-03-04 02:20:28,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469710895] [2025-03-04 02:20:28,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:28,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:28,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:28,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:28,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:28,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:28,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 268 transitions, 4483 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:28,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:28,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:28,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:29,017 INFO L124 PetriNetUnfolderBase]: 2288/3283 cut-off events. [2025-03-04 02:20:29,017 INFO L125 PetriNetUnfolderBase]: For 38766/38766 co-relation queries the response was YES. [2025-03-04 02:20:29,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25171 conditions, 3283 events. 2288/3283 cut-off events. For 38766/38766 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 14312 event pairs, 295 based on Foata normal form. 2/3283 useless extension candidates. Maximal degree in co-relation 24434. Up to 2669 conditions per place. [2025-03-04 02:20:29,039 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 257 selfloop transitions, 86 changer transitions 2/346 dead transitions. [2025-03-04 02:20:29,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 346 transitions, 5943 flow [2025-03-04 02:20:29,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:20:29,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:20:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2025-03-04 02:20:29,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5822222222222222 [2025-03-04 02:20:29,040 INFO L175 Difference]: Start difference. First operand has 110 places, 268 transitions, 4483 flow. Second operand 9 states and 131 transitions. [2025-03-04 02:20:29,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 346 transitions, 5943 flow [2025-03-04 02:20:29,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 346 transitions, 5669 flow, removed 137 selfloop flow, removed 0 redundant places. [2025-03-04 02:20:29,143 INFO L231 Difference]: Finished difference. Result has 121 places, 288 transitions, 4769 flow [2025-03-04 02:20:29,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=4209, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4769, PETRI_PLACES=121, PETRI_TRANSITIONS=288} [2025-03-04 02:20:29,144 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 93 predicate places. [2025-03-04 02:20:29,144 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 288 transitions, 4769 flow [2025-03-04 02:20:29,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:29,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:29,144 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] [2025-03-04 02:20:29,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 02:20:29,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:29,345 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:29,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:29,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1100426241, now seen corresponding path program 3 times [2025-03-04 02:20:29,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:29,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320472283] [2025-03-04 02:20:29,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:29,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:29,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:20:29,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:20:29,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:20:29,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:29,501 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-04 02:20:29,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:29,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320472283] [2025-03-04 02:20:29,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320472283] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:29,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367579009] [2025-03-04 02:20:29,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:29,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:29,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:29,504 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:29,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 02:20:29,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:20:29,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:20:29,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:20:29,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:29,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 02:20:29,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:29,641 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-04 02:20:29,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:30,043 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-04 02:20:30,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367579009] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:30,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:30,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2025-03-04 02:20:30,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987774476] [2025-03-04 02:20:30,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:30,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:20:30,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:30,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:20:30,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:20:30,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:30,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 288 transitions, 4769 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:30,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:30,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:30,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:30,527 INFO L124 PetriNetUnfolderBase]: 2878/4138 cut-off events. [2025-03-04 02:20:30,528 INFO L125 PetriNetUnfolderBase]: For 50846/50846 co-relation queries the response was YES. [2025-03-04 02:20:30,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31617 conditions, 4138 events. 2878/4138 cut-off events. For 50846/50846 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 18905 event pairs, 466 based on Foata normal form. 2/4138 useless extension candidates. Maximal degree in co-relation 31004. Up to 3421 conditions per place. [2025-03-04 02:20:30,564 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 313 selfloop transitions, 93 changer transitions 2/409 dead transitions. [2025-03-04 02:20:30,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 409 transitions, 7155 flow [2025-03-04 02:20:30,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:20:30,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:20:30,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2025-03-04 02:20:30,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5822222222222222 [2025-03-04 02:20:30,566 INFO L175 Difference]: Start difference. First operand has 121 places, 288 transitions, 4769 flow. Second operand 9 states and 131 transitions. [2025-03-04 02:20:30,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 409 transitions, 7155 flow [2025-03-04 02:20:30,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 409 transitions, 6885 flow, removed 81 selfloop flow, removed 3 redundant places. [2025-03-04 02:20:30,713 INFO L231 Difference]: Finished difference. Result has 130 places, 350 transitions, 6003 flow [2025-03-04 02:20:30,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=4499, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6003, PETRI_PLACES=130, PETRI_TRANSITIONS=350} [2025-03-04 02:20:30,714 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 102 predicate places. [2025-03-04 02:20:30,714 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 350 transitions, 6003 flow [2025-03-04 02:20:30,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:30,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:30,714 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] [2025-03-04 02:20:30,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 02:20:30,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 02:20:30,915 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:30,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:30,915 INFO L85 PathProgramCache]: Analyzing trace with hash -596147199, now seen corresponding path program 4 times [2025-03-04 02:20:30,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:30,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068327266] [2025-03-04 02:20:30,915 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:30,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:30,918 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:20:30,921 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:20:30,921 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:20:30,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:31,039 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-04 02:20:31,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:31,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068327266] [2025-03-04 02:20:31,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068327266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:31,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9584868] [2025-03-04 02:20:31,040 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:31,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:31,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:31,042 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:31,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 02:20:31,071 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:20:31,087 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:20:31,088 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:20:31,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:31,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 02:20:31,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:31,147 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-04 02:20:31,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:31,442 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-04 02:20:31,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9584868] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:31,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:31,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 9 [2025-03-04 02:20:31,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111141663] [2025-03-04 02:20:31,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:31,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:31,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:31,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:31,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:31,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:31,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 350 transitions, 6003 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:31,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:31,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:31,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:31,966 INFO L124 PetriNetUnfolderBase]: 3158/4546 cut-off events. [2025-03-04 02:20:31,966 INFO L125 PetriNetUnfolderBase]: For 59080/59080 co-relation queries the response was YES. [2025-03-04 02:20:31,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35437 conditions, 4546 events. 3158/4546 cut-off events. For 59080/59080 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 21112 event pairs, 578 based on Foata normal form. 2/4548 useless extension candidates. Maximal degree in co-relation 34804. Up to 3978 conditions per place. [2025-03-04 02:20:31,995 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 335 selfloop transitions, 82 changer transitions 2/420 dead transitions. [2025-03-04 02:20:31,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 420 transitions, 7613 flow [2025-03-04 02:20:31,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:20:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:20:31,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions. [2025-03-04 02:20:31,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5644444444444444 [2025-03-04 02:20:31,996 INFO L175 Difference]: Start difference. First operand has 130 places, 350 transitions, 6003 flow. Second operand 9 states and 127 transitions. [2025-03-04 02:20:31,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 420 transitions, 7613 flow [2025-03-04 02:20:32,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 420 transitions, 7202 flow, removed 190 selfloop flow, removed 1 redundant places. [2025-03-04 02:20:32,156 INFO L231 Difference]: Finished difference. Result has 140 places, 369 transitions, 6190 flow [2025-03-04 02:20:32,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=5592, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6190, PETRI_PLACES=140, PETRI_TRANSITIONS=369} [2025-03-04 02:20:32,157 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 112 predicate places. [2025-03-04 02:20:32,157 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 369 transitions, 6190 flow [2025-03-04 02:20:32,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:32,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:32,157 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] [2025-03-04 02:20:32,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 02:20:32,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 02:20:32,358 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:32,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:32,358 INFO L85 PathProgramCache]: Analyzing trace with hash 294651393, now seen corresponding path program 5 times [2025-03-04 02:20:32,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:32,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060922656] [2025-03-04 02:20:32,358 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:32,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:32,362 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:20:32,365 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:20:32,365 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:32,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:32,468 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-04 02:20:32,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:32,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060922656] [2025-03-04 02:20:32,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060922656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:32,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7664640] [2025-03-04 02:20:32,469 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:32,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:32,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:32,471 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:32,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 02:20:32,500 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:20:32,514 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:20:32,515 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:32,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:32,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 02:20:32,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:32,598 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-04 02:20:32,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:33,488 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-04 02:20:33,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7664640] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:33,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:33,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 11 [2025-03-04 02:20:33,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126253867] [2025-03-04 02:20:33,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:33,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:20:33,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:33,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:20:33,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:20:33,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:33,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 369 transitions, 6190 flow. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:33,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:33,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:33,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:34,163 INFO L124 PetriNetUnfolderBase]: 3514/5059 cut-off events. [2025-03-04 02:20:34,164 INFO L125 PetriNetUnfolderBase]: For 64557/64557 co-relation queries the response was YES. [2025-03-04 02:20:34,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38795 conditions, 5059 events. 3514/5059 cut-off events. For 64557/64557 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 23995 event pairs, 713 based on Foata normal form. 1/5060 useless extension candidates. Maximal degree in co-relation 38118. Up to 4592 conditions per place. [2025-03-04 02:20:34,206 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 375 selfloop transitions, 70 changer transitions 1/447 dead transitions. [2025-03-04 02:20:34,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 447 transitions, 8096 flow [2025-03-04 02:20:34,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:20:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:20:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2025-03-04 02:20:34,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.555 [2025-03-04 02:20:34,209 INFO L175 Difference]: Start difference. First operand has 140 places, 369 transitions, 6190 flow. Second operand 8 states and 111 transitions. [2025-03-04 02:20:34,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 447 transitions, 8096 flow [2025-03-04 02:20:34,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 447 transitions, 7817 flow, removed 103 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:34,379 INFO L231 Difference]: Finished difference. Result has 148 places, 408 transitions, 6876 flow [2025-03-04 02:20:34,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=5911, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6876, PETRI_PLACES=148, PETRI_TRANSITIONS=408} [2025-03-04 02:20:34,380 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 120 predicate places. [2025-03-04 02:20:34,380 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 408 transitions, 6876 flow [2025-03-04 02:20:34,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:34,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:34,380 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] [2025-03-04 02:20:34,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 02:20:34,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 02:20:34,584 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:34,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:34,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1533115777, now seen corresponding path program 6 times [2025-03-04 02:20:34,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:34,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382247909] [2025-03-04 02:20:34,584 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:20:34,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:34,588 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:20:34,594 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:20:34,594 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:20:34,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:34,697 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-04 02:20:34,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:34,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382247909] [2025-03-04 02:20:34,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382247909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:34,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223436147] [2025-03-04 02:20:34,698 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:20:34,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:34,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:34,700 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:34,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 02:20:34,728 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:20:34,748 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:20:34,749 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:20:34,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:34,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 02:20:34,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:34,808 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-04 02:20:34,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:35,993 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-04 02:20:35,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223436147] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:35,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:35,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 9 [2025-03-04 02:20:35,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765699874] [2025-03-04 02:20:35,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:35,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:35,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:35,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:35,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:35,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:35,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 408 transitions, 6876 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:35,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:35,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:35,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:36,800 INFO L124 PetriNetUnfolderBase]: 3794/5467 cut-off events. [2025-03-04 02:20:36,800 INFO L125 PetriNetUnfolderBase]: For 72415/72415 co-relation queries the response was YES. [2025-03-04 02:20:36,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42343 conditions, 5467 events. 3794/5467 cut-off events. For 72415/72415 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 26259 event pairs, 814 based on Foata normal form. 2/5469 useless extension candidates. Maximal degree in co-relation 41647. Up to 4963 conditions per place. [2025-03-04 02:20:36,837 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 397 selfloop transitions, 72 changer transitions 2/472 dead transitions. [2025-03-04 02:20:36,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 472 transitions, 8621 flow [2025-03-04 02:20:36,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:20:36,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:20:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2025-03-04 02:20:36,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-04 02:20:36,840 INFO L175 Difference]: Start difference. First operand has 148 places, 408 transitions, 6876 flow. Second operand 9 states and 125 transitions. [2025-03-04 02:20:36,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 472 transitions, 8621 flow [2025-03-04 02:20:37,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 472 transitions, 8294 flow, removed 148 selfloop flow, removed 1 redundant places. [2025-03-04 02:20:37,062 INFO L231 Difference]: Finished difference. Result has 158 places, 427 transitions, 7190 flow [2025-03-04 02:20:37,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=6549, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7190, PETRI_PLACES=158, PETRI_TRANSITIONS=427} [2025-03-04 02:20:37,063 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 130 predicate places. [2025-03-04 02:20:37,063 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 427 transitions, 7190 flow [2025-03-04 02:20:37,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:37,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:37,064 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:37,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 02:20:37,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:37,265 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:37,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:37,265 INFO L85 PathProgramCache]: Analyzing trace with hash -897750477, now seen corresponding path program 7 times [2025-03-04 02:20:37,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:37,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203316574] [2025-03-04 02:20:37,266 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:20:37,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:37,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:20:37,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:20:37,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:37,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:37,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:37,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:37,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203316574] [2025-03-04 02:20:37,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203316574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:37,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023053141] [2025-03-04 02:20:37,346 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:20:37,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:37,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:37,348 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:37,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 02:20:37,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:20:37,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:20:37,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:37,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:37,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:20:37,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:37,432 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:37,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:37,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:37,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023053141] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:37,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:37,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 02:20:37,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474155193] [2025-03-04 02:20:37,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:37,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:20:37,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:37,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:20:37,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:20:37,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:37,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 427 transitions, 7190 flow. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:37,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:37,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:37,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:38,742 INFO L124 PetriNetUnfolderBase]: 5805/8220 cut-off events. [2025-03-04 02:20:38,742 INFO L125 PetriNetUnfolderBase]: For 121484/121484 co-relation queries the response was YES. [2025-03-04 02:20:38,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63847 conditions, 8220 events. 5805/8220 cut-off events. For 121484/121484 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 40842 event pairs, 469 based on Foata normal form. 67/8287 useless extension candidates. Maximal degree in co-relation 62363. Up to 2385 conditions per place. [2025-03-04 02:20:38,794 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 748 selfloop transitions, 195 changer transitions 0/944 dead transitions. [2025-03-04 02:20:38,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 944 transitions, 16839 flow [2025-03-04 02:20:38,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:20:38,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:20:38,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 191 transitions. [2025-03-04 02:20:38,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5876923076923077 [2025-03-04 02:20:38,796 INFO L175 Difference]: Start difference. First operand has 158 places, 427 transitions, 7190 flow. Second operand 13 states and 191 transitions. [2025-03-04 02:20:38,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 944 transitions, 16839 flow [2025-03-04 02:20:39,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 944 transitions, 15988 flow, removed 393 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:39,109 INFO L231 Difference]: Finished difference. Result has 176 places, 530 transitions, 9028 flow [2025-03-04 02:20:39,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=6850, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=9028, PETRI_PLACES=176, PETRI_TRANSITIONS=530} [2025-03-04 02:20:39,109 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 148 predicate places. [2025-03-04 02:20:39,109 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 530 transitions, 9028 flow [2025-03-04 02:20:39,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:39,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:39,109 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:39,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 02:20:39,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:39,314 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:39,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:39,314 INFO L85 PathProgramCache]: Analyzing trace with hash 230902529, now seen corresponding path program 8 times [2025-03-04 02:20:39,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:39,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791481228] [2025-03-04 02:20:39,314 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:39,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:39,317 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:20:39,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:20:39,321 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:39,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:39,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:39,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791481228] [2025-03-04 02:20:39,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791481228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:39,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023806169] [2025-03-04 02:20:39,377 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:39,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:39,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:39,379 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:39,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 02:20:39,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:20:39,423 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:20:39,423 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:39,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:39,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:20:39,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:39,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:39,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023806169] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:39,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:39,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 02:20:39,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908511663] [2025-03-04 02:20:39,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:39,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:20:39,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:39,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:20:39,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:20:39,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:39,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 530 transitions, 9028 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:39,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:39,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:39,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:41,046 INFO L124 PetriNetUnfolderBase]: 6891/9610 cut-off events. [2025-03-04 02:20:41,046 INFO L125 PetriNetUnfolderBase]: For 185332/185332 co-relation queries the response was YES. [2025-03-04 02:20:41,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82383 conditions, 9610 events. 6891/9610 cut-off events. For 185332/185332 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 46770 event pairs, 1472 based on Foata normal form. 132/9742 useless extension candidates. Maximal degree in co-relation 80548. Up to 6582 conditions per place. [2025-03-04 02:20:41,129 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 648 selfloop transitions, 332 changer transitions 0/981 dead transitions. [2025-03-04 02:20:41,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 981 transitions, 18018 flow [2025-03-04 02:20:41,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 02:20:41,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 02:20:41,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 249 transitions. [2025-03-04 02:20:41,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5533333333333333 [2025-03-04 02:20:41,131 INFO L175 Difference]: Start difference. First operand has 176 places, 530 transitions, 9028 flow. Second operand 18 states and 249 transitions. [2025-03-04 02:20:41,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 981 transitions, 18018 flow [2025-03-04 02:20:41,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 981 transitions, 17398 flow, removed 270 selfloop flow, removed 1 redundant places. [2025-03-04 02:20:41,868 INFO L231 Difference]: Finished difference. Result has 199 places, 707 transitions, 12413 flow [2025-03-04 02:20:41,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=8624, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=12413, PETRI_PLACES=199, PETRI_TRANSITIONS=707} [2025-03-04 02:20:41,869 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 171 predicate places. [2025-03-04 02:20:41,869 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 707 transitions, 12413 flow [2025-03-04 02:20:41,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:41,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:41,869 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:41,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 02:20:42,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 02:20:42,070 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:42,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:42,070 INFO L85 PathProgramCache]: Analyzing trace with hash 187707263, now seen corresponding path program 9 times [2025-03-04 02:20:42,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:42,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553200493] [2025-03-04 02:20:42,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:42,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:42,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:20:42,077 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:20:42,077 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:20:42,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:42,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:42,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:42,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553200493] [2025-03-04 02:20:42,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553200493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:42,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701519850] [2025-03-04 02:20:42,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:42,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:42,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:42,131 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:42,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 02:20:42,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:20:42,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:20:42,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:20:42,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:42,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:20:42,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:42,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:42,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701519850] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:42,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:42,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 02:20:42,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409780500] [2025-03-04 02:20:42,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:42,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:20:42,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:42,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:20:42,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:20:42,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:42,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 707 transitions, 12413 flow. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:42,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:42,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:42,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:43,842 INFO L124 PetriNetUnfolderBase]: 7451/10413 cut-off events. [2025-03-04 02:20:43,843 INFO L125 PetriNetUnfolderBase]: For 220161/220161 co-relation queries the response was YES. [2025-03-04 02:20:43,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92753 conditions, 10413 events. 7451/10413 cut-off events. For 220161/220161 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 51752 event pairs, 1618 based on Foata normal form. 66/10479 useless extension candidates. Maximal degree in co-relation 90847. Up to 7053 conditions per place. [2025-03-04 02:20:43,929 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 710 selfloop transitions, 241 changer transitions 3/955 dead transitions. [2025-03-04 02:20:43,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 955 transitions, 18534 flow [2025-03-04 02:20:43,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:20:43,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:20:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2025-03-04 02:20:43,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.524 [2025-03-04 02:20:43,930 INFO L175 Difference]: Start difference. First operand has 199 places, 707 transitions, 12413 flow. Second operand 10 states and 131 transitions. [2025-03-04 02:20:43,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 955 transitions, 18534 flow [2025-03-04 02:20:45,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 955 transitions, 17321 flow, removed 383 selfloop flow, removed 4 redundant places. [2025-03-04 02:20:45,362 INFO L231 Difference]: Finished difference. Result has 211 places, 800 transitions, 13863 flow [2025-03-04 02:20:45,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=11483, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13863, PETRI_PLACES=211, PETRI_TRANSITIONS=800} [2025-03-04 02:20:45,363 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 183 predicate places. [2025-03-04 02:20:45,363 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 800 transitions, 13863 flow [2025-03-04 02:20:45,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:45,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:45,363 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:45,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 02:20:45,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:45,564 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:45,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:45,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1711317843, now seen corresponding path program 10 times [2025-03-04 02:20:45,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:45,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231312297] [2025-03-04 02:20:45,564 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:45,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:45,568 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:20:45,576 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:20:45,576 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:20:45,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:45,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:45,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:45,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231312297] [2025-03-04 02:20:45,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231312297] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:45,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662103732] [2025-03-04 02:20:45,806 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:45,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:45,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:45,808 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:45,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 02:20:45,839 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:20:45,852 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:20:45,852 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:20:45,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:45,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:20:45,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:45,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:45,979 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:45,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662103732] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:45,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:45,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 19 [2025-03-04 02:20:45,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971472808] [2025-03-04 02:20:45,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:45,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:20:45,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:45,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:20:45,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:20:45,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:45,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 800 transitions, 13863 flow. Second operand has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 19 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:45,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:45,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:45,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:51,921 INFO L124 PetriNetUnfolderBase]: 9979/13678 cut-off events. [2025-03-04 02:20:51,921 INFO L125 PetriNetUnfolderBase]: For 307542/307542 co-relation queries the response was YES. [2025-03-04 02:20:51,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127220 conditions, 13678 events. 9979/13678 cut-off events. For 307542/307542 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 68324 event pairs, 667 based on Foata normal form. 289/13967 useless extension candidates. Maximal degree in co-relation 125312. Up to 7028 conditions per place. [2025-03-04 02:20:52,049 INFO L140 encePairwiseOnDemand]: 16/25 looper letters, 825 selfloop transitions, 962 changer transitions 2/1790 dead transitions. [2025-03-04 02:20:52,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 1790 transitions, 35241 flow [2025-03-04 02:20:52,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-03-04 02:20:52,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2025-03-04 02:20:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 877 transitions. [2025-03-04 02:20:52,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4440506329113924 [2025-03-04 02:20:52,051 INFO L175 Difference]: Start difference. First operand has 211 places, 800 transitions, 13863 flow. Second operand 79 states and 877 transitions. [2025-03-04 02:20:52,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 1790 transitions, 35241 flow [2025-03-04 02:20:54,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 1790 transitions, 34505 flow, removed 368 selfloop flow, removed 0 redundant places. [2025-03-04 02:20:54,113 INFO L231 Difference]: Finished difference. Result has 337 places, 1471 transitions, 30624 flow [2025-03-04 02:20:54,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=13517, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=392, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=79, PETRI_FLOW=30624, PETRI_PLACES=337, PETRI_TRANSITIONS=1471} [2025-03-04 02:20:54,114 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 309 predicate places. [2025-03-04 02:20:54,114 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 1471 transitions, 30624 flow [2025-03-04 02:20:54,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 19 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:54,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:54,114 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:54,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 02:20:54,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:54,315 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:20:54,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:54,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1336076013, now seen corresponding path program 11 times [2025-03-04 02:20:54,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:54,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305962212] [2025-03-04 02:20:54,315 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:54,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:54,318 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:20:54,321 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:20:54,321 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:54,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:54,378 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:54,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:54,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305962212] [2025-03-04 02:20:54,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305962212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:54,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365434343] [2025-03-04 02:20:54,378 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:54,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:54,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:54,380 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:54,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 02:20:54,410 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:20:54,421 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:20:54,422 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:54,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:54,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:20:54,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:54,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:54,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:54,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:54,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365434343] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:54,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:54,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 02:20:54,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914983655] [2025-03-04 02:20:54,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:54,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:20:54,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:54,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:20:54,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:20:54,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:20:54,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 1471 transitions, 30624 flow. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:54,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:54,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:20:54,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:58,661 INFO L124 PetriNetUnfolderBase]: 11095/15340 cut-off events. [2025-03-04 02:20:58,661 INFO L125 PetriNetUnfolderBase]: For 619027/619027 co-relation queries the response was YES. [2025-03-04 02:20:58,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167187 conditions, 15340 events. 11095/15340 cut-off events. For 619027/619027 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 80028 event pairs, 1452 based on Foata normal form. 164/15504 useless extension candidates. Maximal degree in co-relation 164013. Up to 7582 conditions per place. [2025-03-04 02:20:58,840 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 1386 selfloop transitions, 491 changer transitions 33/1911 dead transitions. [2025-03-04 02:20:58,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 1911 transitions, 42833 flow [2025-03-04 02:20:58,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:20:58,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:20:58,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2025-03-04 02:20:58,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.555 [2025-03-04 02:20:58,841 INFO L175 Difference]: Start difference. First operand has 337 places, 1471 transitions, 30624 flow. Second operand 8 states and 111 transitions. [2025-03-04 02:20:58,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 1911 transitions, 42833 flow [2025-03-04 02:21:04,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 1911 transitions, 34361 flow, removed 3698 selfloop flow, removed 10 redundant places. [2025-03-04 02:21:04,154 INFO L231 Difference]: Finished difference. Result has 337 places, 1590 transitions, 27267 flow [2025-03-04 02:21:04,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=23137, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=364, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=986, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=27267, PETRI_PLACES=337, PETRI_TRANSITIONS=1590} [2025-03-04 02:21:04,156 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 309 predicate places. [2025-03-04 02:21:04,156 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 1590 transitions, 27267 flow [2025-03-04 02:21:04,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:21:04,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:04,156 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:21:04,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 02:21:04,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 02:21:04,361 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:21:04,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:04,362 INFO L85 PathProgramCache]: Analyzing trace with hash -315636617, now seen corresponding path program 12 times [2025-03-04 02:21:04,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:04,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724251926] [2025-03-04 02:21:04,362 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:21:04,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:04,366 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:21:04,371 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:21:04,371 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:21:04,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:21:04,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:04,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724251926] [2025-03-04 02:21:04,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724251926] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:21:04,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454216016] [2025-03-04 02:21:04,424 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:21:04,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:21:04,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:21:04,426 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:21:04,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 02:21:04,495 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:21:04,508 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:21:04,508 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:21:04,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:04,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:21:04,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:21:04,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:21:04,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:21:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:21:04,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454216016] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:21:04,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:21:04,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-04 02:21:04,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148474621] [2025-03-04 02:21:04,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:21:04,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:21:04,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:04,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:21:04,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:21:04,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:21:04,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 1590 transitions, 27267 flow. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 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-04 02:21:04,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:04,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:21:04,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:08,612 INFO L124 PetriNetUnfolderBase]: 11455/15976 cut-off events. [2025-03-04 02:21:08,612 INFO L125 PetriNetUnfolderBase]: For 617019/617019 co-relation queries the response was YES. [2025-03-04 02:21:08,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165001 conditions, 15976 events. 11455/15976 cut-off events. For 617019/617019 co-relation queries the response was YES. Maximal size of possible extension queue 833. Compared 86081 event pairs, 1765 based on Foata normal form. 284/16260 useless extension candidates. Maximal degree in co-relation 162280. Up to 8622 conditions per place. [2025-03-04 02:21:08,806 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 1394 selfloop transitions, 369 changer transitions 29/1793 dead transitions. [2025-03-04 02:21:08,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 1793 transitions, 34760 flow [2025-03-04 02:21:08,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:21:08,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:21:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2025-03-04 02:21:08,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59 [2025-03-04 02:21:08,807 INFO L175 Difference]: Start difference. First operand has 337 places, 1590 transitions, 27267 flow. Second operand 8 states and 118 transitions. [2025-03-04 02:21:08,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 1793 transitions, 34760 flow [2025-03-04 02:21:13,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 1793 transitions, 33707 flow, removed 333 selfloop flow, removed 2 redundant places. [2025-03-04 02:21:13,914 INFO L231 Difference]: Finished difference. Result has 345 places, 1613 transitions, 27926 flow [2025-03-04 02:21:13,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=26349, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=339, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=27926, PETRI_PLACES=345, PETRI_TRANSITIONS=1613} [2025-03-04 02:21:13,915 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 317 predicate places. [2025-03-04 02:21:13,915 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 1613 transitions, 27926 flow [2025-03-04 02:21:13,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 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-04 02:21:13,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:13,916 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:21:13,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 02:21:14,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:21:14,120 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:21:14,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:14,120 INFO L85 PathProgramCache]: Analyzing trace with hash -834637239, now seen corresponding path program 13 times [2025-03-04 02:21:14,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:14,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081214429] [2025-03-04 02:21:14,121 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:21:14,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:14,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:21:14,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:21:14,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:21:14,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:14,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:21:14,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:14,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081214429] [2025-03-04 02:21:14,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081214429] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:21:14,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63834441] [2025-03-04 02:21:14,194 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:21:14,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:21:14,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:21:14,196 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:21:14,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 02:21:14,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:21:14,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:21:14,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:21:14,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:14,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:21:14,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:21:14,269 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:21:14,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:21:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:21:14,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63834441] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:21:14,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:21:14,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 02:21:14,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34877649] [2025-03-04 02:21:14,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:21:14,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:21:14,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:14,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:21:14,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:21:14,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:21:14,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 1613 transitions, 27926 flow. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:21:14,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:14,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:21:14,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:19,376 INFO L124 PetriNetUnfolderBase]: 11598/16271 cut-off events. [2025-03-04 02:21:19,376 INFO L125 PetriNetUnfolderBase]: For 588436/588436 co-relation queries the response was YES. [2025-03-04 02:21:19,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167157 conditions, 16271 events. 11598/16271 cut-off events. For 588436/588436 co-relation queries the response was YES. Maximal size of possible extension queue 869. Compared 89230 event pairs, 1767 based on Foata normal form. 228/16499 useless extension candidates. Maximal degree in co-relation 165650. Up to 8622 conditions per place. [2025-03-04 02:21:19,620 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 1309 selfloop transitions, 387 changer transitions 71/1768 dead transitions. [2025-03-04 02:21:19,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 1768 transitions, 34551 flow [2025-03-04 02:21:19,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:21:19,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:21:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2025-03-04 02:21:19,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.575 [2025-03-04 02:21:19,621 INFO L175 Difference]: Start difference. First operand has 345 places, 1613 transitions, 27926 flow. Second operand 8 states and 115 transitions. [2025-03-04 02:21:19,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 1768 transitions, 34551 flow [2025-03-04 02:21:25,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 1768 transitions, 33708 flow, removed 208 selfloop flow, removed 3 redundant places. [2025-03-04 02:21:25,222 INFO L231 Difference]: Finished difference. Result has 353 places, 1610 transitions, 28383 flow [2025-03-04 02:21:25,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=27286, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=355, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=28383, PETRI_PLACES=353, PETRI_TRANSITIONS=1610} [2025-03-04 02:21:25,224 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 325 predicate places. [2025-03-04 02:21:25,224 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 1610 transitions, 28383 flow [2025-03-04 02:21:25,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:21:25,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:25,224 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:21:25,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 02:21:25,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:21:25,425 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:21:25,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:25,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1897973103, now seen corresponding path program 14 times [2025-03-04 02:21:25,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:25,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824728692] [2025-03-04 02:21:25,425 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:21:25,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:25,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:21:25,433 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:21:25,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:21:25,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:21:25,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:25,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824728692] [2025-03-04 02:21:25,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824728692] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:21:25,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884268507] [2025-03-04 02:21:25,521 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:21:25,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:21:25,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:21:25,523 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:21:25,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 02:21:25,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:21:25,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:21:25,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:21:25,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:25,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:21:25,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:21:25,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:21:25,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:21:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:21:25,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884268507] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:21:25,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:21:25,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2025-03-04 02:21:25,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638750439] [2025-03-04 02:21:25,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:21:25,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:21:25,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:25,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:21:25,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:21:25,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:21:25,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 1610 transitions, 28383 flow. Second operand has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:21:25,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:25,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:21:25,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:31,818 INFO L124 PetriNetUnfolderBase]: 14575/20434 cut-off events. [2025-03-04 02:21:31,819 INFO L125 PetriNetUnfolderBase]: For 794061/794061 co-relation queries the response was YES. [2025-03-04 02:21:32,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219385 conditions, 20434 events. 14575/20434 cut-off events. For 794061/794061 co-relation queries the response was YES. Maximal size of possible extension queue 1000. Compared 114622 event pairs, 855 based on Foata normal form. 198/20632 useless extension candidates. Maximal degree in co-relation 217867. Up to 5920 conditions per place. [2025-03-04 02:21:32,166 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 1905 selfloop transitions, 698 changer transitions 49/2653 dead transitions. [2025-03-04 02:21:32,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 2653 transitions, 56746 flow [2025-03-04 02:21:32,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 02:21:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 02:21:32,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 263 transitions. [2025-03-04 02:21:32,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5536842105263158 [2025-03-04 02:21:32,167 INFO L175 Difference]: Start difference. First operand has 353 places, 1610 transitions, 28383 flow. Second operand 19 states and 263 transitions. [2025-03-04 02:21:32,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 2653 transitions, 56746 flow [2025-03-04 02:21:39,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 2653 transitions, 55946 flow, removed 182 selfloop flow, removed 4 redundant places. [2025-03-04 02:21:39,516 INFO L231 Difference]: Finished difference. Result has 382 places, 1814 transitions, 34975 flow [2025-03-04 02:21:39,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=27675, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=492, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1074, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=34975, PETRI_PLACES=382, PETRI_TRANSITIONS=1814} [2025-03-04 02:21:39,517 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 354 predicate places. [2025-03-04 02:21:39,517 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 1814 transitions, 34975 flow [2025-03-04 02:21:39,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:21:39,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:39,518 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:21:39,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 02:21:39,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:21:39,718 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:21:39,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:39,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1010859975, now seen corresponding path program 15 times [2025-03-04 02:21:39,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:39,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588236828] [2025-03-04 02:21:39,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:21:39,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:39,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:21:39,726 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:21:39,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:21:39,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:39,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:21:39,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:39,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588236828] [2025-03-04 02:21:39,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588236828] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:21:39,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835176976] [2025-03-04 02:21:39,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:21:39,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:21:39,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:21:39,837 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:21:39,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 02:21:39,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:21:39,884 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:21:39,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:21:39,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:39,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:21:39,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:21:39,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:21:39,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:21:39,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:21:39,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835176976] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:21:39,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:21:39,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2025-03-04 02:21:39,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363140581] [2025-03-04 02:21:39,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:21:39,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:21:39,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:40,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:21:40,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:21:40,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-04 02:21:40,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 1814 transitions, 34975 flow. Second operand has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:21:40,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:40,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-04 02:21:40,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:48,418 INFO L124 PetriNetUnfolderBase]: 18517/25598 cut-off events. [2025-03-04 02:21:48,418 INFO L125 PetriNetUnfolderBase]: For 1240694/1240694 co-relation queries the response was YES. [2025-03-04 02:21:48,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304012 conditions, 25598 events. 18517/25598 cut-off events. For 1240694/1240694 co-relation queries the response was YES. Maximal size of possible extension queue 1271. Compared 143262 event pairs, 1661 based on Foata normal form. 374/25972 useless extension candidates. Maximal degree in co-relation 302518. Up to 9505 conditions per place. [2025-03-04 02:21:48,852 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 1710 selfloop transitions, 1108 changer transitions 58/2877 dead transitions. [2025-03-04 02:21:48,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 2877 transitions, 63797 flow [2025-03-04 02:21:48,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 02:21:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 02:21:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 263 transitions. [2025-03-04 02:21:48,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5536842105263158 [2025-03-04 02:21:48,853 INFO L175 Difference]: Start difference. First operand has 382 places, 1814 transitions, 34975 flow. Second operand 19 states and 263 transitions. [2025-03-04 02:21:48,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 2877 transitions, 63797 flow