./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-nonblocking-cntr-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-nonblocking-cntr-alt.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 0ead2366baa94ec77674f75cd829f45857f5651e204e91d33a749a2af2868461 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:50:27,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:50:27,073 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:50:27,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:50:27,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:50:27,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:50:27,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:50:27,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:50:27,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:50:27,101 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:50:27,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:50:27,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:50:27,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:50:27,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:50:27,102 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:50:27,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:50:27,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:50:27,103 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:50:27,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:50:27,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:50:27,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:50:27,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:50:27,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:50:27,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:50:27,103 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:50:27,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:50:27,103 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:50:27,103 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:50:27,103 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:50:27,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:50:27,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:50:27,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:50:27,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:50:27,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:50:27,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:50:27,104 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:50:27,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:50:27,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:50:27,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:50:27,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:50:27,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:50:27,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:50:27,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:50:27,105 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 -> 0ead2366baa94ec77674f75cd829f45857f5651e204e91d33a749a2af2868461 [2025-03-13 21:50:27,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:50:27,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:50:27,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:50:27,337 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:50:27,337 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:50:27,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-nonblocking-cntr-alt.wvr.c [2025-03-13 21:50:28,442 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f43af1c0/6acfd551148440e58cfdd60d9b11faf0/FLAG36b58d4c4 [2025-03-13 21:50:28,642 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:50:28,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-nonblocking-cntr-alt.wvr.c [2025-03-13 21:50:28,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f43af1c0/6acfd551148440e58cfdd60d9b11faf0/FLAG36b58d4c4 [2025-03-13 21:50:29,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f43af1c0/6acfd551148440e58cfdd60d9b11faf0 [2025-03-13 21:50:29,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:50:29,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:50:29,012 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:50:29,012 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:50:29,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:50:29,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:50:29" (1/1) ... [2025-03-13 21:50:29,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ad8e22e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:50:29, skipping insertion in model container [2025-03-13 21:50:29,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:50:29" (1/1) ... [2025-03-13 21:50:29,024 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:50:29,131 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/popl20-nonblocking-cntr-alt.wvr.c[2124,2137] [2025-03-13 21:50:29,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:50:29,139 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:50:29,149 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/popl20-nonblocking-cntr-alt.wvr.c[2124,2137] [2025-03-13 21:50:29,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:50:29,158 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:50:29,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:50:29 WrapperNode [2025-03-13 21:50:29,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:50:29,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:50:29,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:50:29,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:50:29,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:50:29" (1/1) ... [2025-03-13 21:50:29,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:50:29" (1/1) ... [2025-03-13 21:50:29,176 INFO L138 Inliner]: procedures = 20, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2025-03-13 21:50:29,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:50:29,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:50:29,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:50:29,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:50:29,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:50:29" (1/1) ... [2025-03-13 21:50:29,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:50:29" (1/1) ... [2025-03-13 21:50:29,184 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:50:29" (1/1) ... [2025-03-13 21:50:29,192 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-13 21:50:29,192 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:50:29" (1/1) ... [2025-03-13 21:50:29,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:50:29" (1/1) ... [2025-03-13 21:50:29,194 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:50:29" (1/1) ... [2025-03-13 21:50:29,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:50:29" (1/1) ... [2025-03-13 21:50:29,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:50:29" (1/1) ... [2025-03-13 21:50:29,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:50:29" (1/1) ... [2025-03-13 21:50:29,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:50:29,197 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:50:29,197 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:50:29,197 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:50:29,198 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:50:29" (1/1) ... [2025-03-13 21:50:29,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:50:29,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:29,219 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:50:29,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:50:29,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:50:29,236 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:50:29,236 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:50:29,236 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:50:29,236 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:50:29,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:50:29,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:50:29,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:50:29,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:50:29,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:50:29,237 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:50:29,288 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:50:29,289 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:50:29,393 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:50:29,394 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:50:29,394 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:50:29,485 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:50:29,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:50:29 BoogieIcfgContainer [2025-03-13 21:50:29,485 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:50:29,487 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:50:29,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:50:29,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:50:29,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:50:29" (1/3) ... [2025-03-13 21:50:29,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7a2ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:50:29, skipping insertion in model container [2025-03-13 21:50:29,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:50:29" (2/3) ... [2025-03-13 21:50:29,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7a2ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:50:29, skipping insertion in model container [2025-03-13 21:50:29,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:50:29" (3/3) ... [2025-03-13 21:50:29,492 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-nonblocking-cntr-alt.wvr.c [2025-03-13 21:50:29,503 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:50:29,505 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-nonblocking-cntr-alt.wvr.c that has 3 procedures, 20 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-13 21:50:29,506 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:50:29,536 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:50:29,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 21 transitions, 56 flow [2025-03-13 21:50:29,583 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-03-13 21:50:29,585 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:50:29,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 19 events. 2/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 14. Up to 2 conditions per place. [2025-03-13 21:50:29,587 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 21 transitions, 56 flow [2025-03-13 21:50:29,588 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 48 flow [2025-03-13 21:50:29,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:50:29,600 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;@41c3d1fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:50:29,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-13 21:50:29,605 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:50:29,605 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-03-13 21:50:29,605 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:50:29,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:29,606 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:29,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:29,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:29,610 INFO L85 PathProgramCache]: Analyzing trace with hash 2073263937, now seen corresponding path program 1 times [2025-03-13 21:50:29,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:29,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330009204] [2025-03-13 21:50:29,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:50:29,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:29,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-13 21:50:29,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-13 21:50:29,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:29,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:29,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:29,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330009204] [2025-03-13 21:50:29,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330009204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:50:29,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:50:29,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:50:29,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208399880] [2025-03-13 21:50:29,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:50:29,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:50:29,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:29,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:50:29,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:50:29,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2025-03-13 21:50:29,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 48 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:29,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:29,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2025-03-13 21:50:29,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:29,947 INFO L124 PetriNetUnfolderBase]: 70/140 cut-off events. [2025-03-13 21:50:29,947 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 21:50:29,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 140 events. 70/140 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 437 event pairs, 31 based on Foata normal form. 8/147 useless extension candidates. Maximal degree in co-relation 255. Up to 86 conditions per place. [2025-03-13 21:50:29,949 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 20 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2025-03-13 21:50:29,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 26 transitions, 113 flow [2025-03-13 21:50:29,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:50:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:50:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-03-13 21:50:29,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-03-13 21:50:29,958 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 48 flow. Second operand 4 states and 44 transitions. [2025-03-13 21:50:29,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 26 transitions, 113 flow [2025-03-13 21:50:29,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 26 transitions, 103 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 21:50:29,962 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 54 flow [2025-03-13 21:50:29,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=54, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2025-03-13 21:50:29,967 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 0 predicate places. [2025-03-13 21:50:29,967 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 54 flow [2025-03-13 21:50:29,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:29,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:29,968 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:29,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:50:29,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:29,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:29,969 INFO L85 PathProgramCache]: Analyzing trace with hash -246956766, now seen corresponding path program 1 times [2025-03-13 21:50:29,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:29,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499266152] [2025-03-13 21:50:29,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:50:29,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:29,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 21:50:29,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 21:50:29,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:29,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:50:30,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:30,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499266152] [2025-03-13 21:50:30,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499266152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:50:30,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:50:30,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:50:30,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774046346] [2025-03-13 21:50:30,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:50:30,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:50:30,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:30,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:50:30,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:50:30,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2025-03-13 21:50:30,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 54 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-13 21:50:30,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:30,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2025-03-13 21:50:30,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:30,168 INFO L124 PetriNetUnfolderBase]: 89/184 cut-off events. [2025-03-13 21:50:30,168 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-13 21:50:30,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 184 events. 89/184 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 625 event pairs, 49 based on Foata normal form. 13/196 useless extension candidates. Maximal degree in co-relation 87. Up to 124 conditions per place. [2025-03-13 21:50:30,169 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 21 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2025-03-13 21:50:30,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 129 flow [2025-03-13 21:50:30,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:50:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:50:30,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-03-13 21:50:30,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2025-03-13 21:50:30,170 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 54 flow. Second operand 4 states and 43 transitions. [2025-03-13 21:50:30,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 129 flow [2025-03-13 21:50:30,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 27 transitions, 123 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:50:30,171 INFO L231 Difference]: Finished difference. Result has 25 places, 20 transitions, 64 flow [2025-03-13 21:50:30,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=25, PETRI_TRANSITIONS=20} [2025-03-13 21:50:30,172 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2025-03-13 21:50:30,172 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 64 flow [2025-03-13 21:50:30,172 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-13 21:50:30,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:30,172 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-13 21:50:30,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:50:30,172 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:30,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:30,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1941528830, now seen corresponding path program 1 times [2025-03-13 21:50:30,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:30,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50200603] [2025-03-13 21:50:30,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:50:30,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:30,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:50:30,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:50:30,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:30,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:30,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:30,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:30,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50200603] [2025-03-13 21:50:30,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50200603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:30,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485991746] [2025-03-13 21:50:30,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:50:30,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:30,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:30,520 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:30,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:50:30,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:50:30,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:50:30,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:30,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:30,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-13 21:50:30,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:30,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:31,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485991746] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:31,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:31,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-13 21:50:31,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561229931] [2025-03-13 21:50:31,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:31,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-13 21:50:31,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:31,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-13 21:50:31,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2025-03-13 21:50:31,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:50:31,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 64 flow. Second operand has 25 states, 25 states have (on average 4.92) internal successors, (123), 25 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:31,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:31,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:50:31,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:32,235 INFO L124 PetriNetUnfolderBase]: 396/689 cut-off events. [2025-03-13 21:50:32,235 INFO L125 PetriNetUnfolderBase]: For 212/212 co-relation queries the response was YES. [2025-03-13 21:50:32,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1719 conditions, 689 events. 396/689 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2892 event pairs, 26 based on Foata normal form. 2/691 useless extension candidates. Maximal degree in co-relation 632. Up to 195 conditions per place. [2025-03-13 21:50:32,238 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 89 selfloop transitions, 64 changer transitions 13/167 dead transitions. [2025-03-13 21:50:32,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 167 transitions, 833 flow [2025-03-13 21:50:32,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-13 21:50:32,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-13 21:50:32,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 244 transitions. [2025-03-13 21:50:32,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41496598639455784 [2025-03-13 21:50:32,241 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 64 flow. Second operand 28 states and 244 transitions. [2025-03-13 21:50:32,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 167 transitions, 833 flow [2025-03-13 21:50:32,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 167 transitions, 815 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:50:32,244 INFO L231 Difference]: Finished difference. Result has 68 places, 90 transitions, 567 flow [2025-03-13 21:50:32,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=567, PETRI_PLACES=68, PETRI_TRANSITIONS=90} [2025-03-13 21:50:32,244 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 45 predicate places. [2025-03-13 21:50:32,245 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 90 transitions, 567 flow [2025-03-13 21:50:32,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.92) internal successors, (123), 25 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:32,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:32,245 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-13 21:50:32,251 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-13 21:50:32,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:32,446 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:32,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:32,446 INFO L85 PathProgramCache]: Analyzing trace with hash 83652846, now seen corresponding path program 2 times [2025-03-13 21:50:32,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:32,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726031932] [2025-03-13 21:50:32,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:50:32,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:32,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:50:32,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:50:32,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:50:32,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:32,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:32,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726031932] [2025-03-13 21:50:32,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726031932] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:32,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999091728] [2025-03-13 21:50:32,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:50:32,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:32,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:32,622 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:32,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:50:32,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:50:32,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:50:32,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:50:32,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:32,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-13 21:50:32,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:32,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:33,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:33,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999091728] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:33,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:33,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-03-13 21:50:33,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848896412] [2025-03-13 21:50:33,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:33,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-13 21:50:33,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:33,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-13 21:50:33,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2025-03-13 21:50:33,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:50:33,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 90 transitions, 567 flow. Second operand has 24 states, 24 states have (on average 4.958333333333333) internal successors, (119), 24 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:33,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:33,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:50:33,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:33,999 INFO L124 PetriNetUnfolderBase]: 579/1036 cut-off events. [2025-03-13 21:50:33,999 INFO L125 PetriNetUnfolderBase]: For 2853/2853 co-relation queries the response was YES. [2025-03-13 21:50:34,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4341 conditions, 1036 events. 579/1036 cut-off events. For 2853/2853 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4912 event pairs, 17 based on Foata normal form. 2/1038 useless extension candidates. Maximal degree in co-relation 4284. Up to 219 conditions per place. [2025-03-13 21:50:34,006 INFO L140 encePairwiseOnDemand]: 10/21 looper letters, 114 selfloop transitions, 109 changer transitions 29/253 dead transitions. [2025-03-13 21:50:34,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 253 transitions, 2066 flow [2025-03-13 21:50:34,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-13 21:50:34,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-13 21:50:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 275 transitions. [2025-03-13 21:50:34,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40922619047619047 [2025-03-13 21:50:34,011 INFO L175 Difference]: Start difference. First operand has 68 places, 90 transitions, 567 flow. Second operand 32 states and 275 transitions. [2025-03-13 21:50:34,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 253 transitions, 2066 flow [2025-03-13 21:50:34,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 253 transitions, 2035 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-13 21:50:34,033 INFO L231 Difference]: Finished difference. Result has 106 places, 149 transitions, 1311 flow [2025-03-13 21:50:34,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1311, PETRI_PLACES=106, PETRI_TRANSITIONS=149} [2025-03-13 21:50:34,034 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 83 predicate places. [2025-03-13 21:50:34,034 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 149 transitions, 1311 flow [2025-03-13 21:50:34,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.958333333333333) internal successors, (119), 24 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:34,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:34,035 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-13 21:50:34,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-13 21:50:34,235 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,SelfDestructingSolverStorable3 [2025-03-13 21:50:34,236 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:34,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:34,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1610253440, now seen corresponding path program 3 times [2025-03-13 21:50:34,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:34,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870535345] [2025-03-13 21:50:34,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:50:34,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:34,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:50:34,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:50:34,251 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:50:34,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:34,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:34,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:34,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870535345] [2025-03-13 21:50:34,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870535345] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:34,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116240931] [2025-03-13 21:50:34,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:50:34,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:34,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:34,416 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:34,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 21:50:34,446 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:50:34,455 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:50:34,455 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:50:34,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:34,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-13 21:50:34,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:34,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:34,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:34,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116240931] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:34,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:34,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-13 21:50:34,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878352456] [2025-03-13 21:50:34,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:34,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-13 21:50:34,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:34,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-13 21:50:34,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2025-03-13 21:50:34,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:50:34,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 149 transitions, 1311 flow. Second operand has 25 states, 25 states have (on average 4.96) internal successors, (124), 25 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:34,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:34,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:50:34,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:35,825 INFO L124 PetriNetUnfolderBase]: 584/1063 cut-off events. [2025-03-13 21:50:35,825 INFO L125 PetriNetUnfolderBase]: For 5476/5476 co-relation queries the response was YES. [2025-03-13 21:50:35,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5494 conditions, 1063 events. 584/1063 cut-off events. For 5476/5476 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5239 event pairs, 34 based on Foata normal form. 2/1065 useless extension candidates. Maximal degree in co-relation 5409. Up to 248 conditions per place. [2025-03-13 21:50:35,833 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 111 selfloop transitions, 123 changer transitions 19/254 dead transitions. [2025-03-13 21:50:35,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 254 transitions, 2552 flow [2025-03-13 21:50:35,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-13 21:50:35,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-13 21:50:35,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 268 transitions. [2025-03-13 21:50:35,834 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4253968253968254 [2025-03-13 21:50:35,834 INFO L175 Difference]: Start difference. First operand has 106 places, 149 transitions, 1311 flow. Second operand 30 states and 268 transitions. [2025-03-13 21:50:35,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 254 transitions, 2552 flow [2025-03-13 21:50:35,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 254 transitions, 2277 flow, removed 104 selfloop flow, removed 12 redundant places. [2025-03-13 21:50:35,857 INFO L231 Difference]: Finished difference. Result has 131 places, 165 transitions, 1697 flow [2025-03-13 21:50:35,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1697, PETRI_PLACES=131, PETRI_TRANSITIONS=165} [2025-03-13 21:50:35,858 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 108 predicate places. [2025-03-13 21:50:35,858 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 165 transitions, 1697 flow [2025-03-13 21:50:35,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.96) internal successors, (124), 25 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:35,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:35,859 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-13 21:50:35,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-13 21:50:36,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:36,063 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:36,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:36,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1860395712, now seen corresponding path program 4 times [2025-03-13 21:50:36,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:36,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125023038] [2025-03-13 21:50:36,064 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:50:36,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:36,067 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:50:36,072 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:50:36,072 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:50:36,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:36,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:36,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125023038] [2025-03-13 21:50:36,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125023038] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:36,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706980594] [2025-03-13 21:50:36,233 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:50:36,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:36,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:36,235 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:36,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 21:50:36,259 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:50:36,268 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:50:36,268 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:50:36,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:36,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-13 21:50:36,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:36,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:36,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:36,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:36,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706980594] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:36,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:36,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 28 [2025-03-13 21:50:36,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589915010] [2025-03-13 21:50:36,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:36,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-13 21:50:36,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:36,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-13 21:50:36,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2025-03-13 21:50:36,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:50:36,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 165 transitions, 1697 flow. Second operand has 29 states, 29 states have (on average 4.655172413793103) internal successors, (135), 29 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:36,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:36,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:50:36,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:38,867 INFO L124 PetriNetUnfolderBase]: 1014/1836 cut-off events. [2025-03-13 21:50:38,868 INFO L125 PetriNetUnfolderBase]: For 11497/11497 co-relation queries the response was YES. [2025-03-13 21:50:38,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10295 conditions, 1836 events. 1014/1836 cut-off events. For 11497/11497 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9874 event pairs, 9 based on Foata normal form. 29/1865 useless extension candidates. Maximal degree in co-relation 10199. Up to 401 conditions per place. [2025-03-13 21:50:38,881 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 230 selfloop transitions, 311 changer transitions 24/566 dead transitions. [2025-03-13 21:50:38,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 566 transitions, 6411 flow [2025-03-13 21:50:38,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2025-03-13 21:50:38,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2025-03-13 21:50:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 670 transitions. [2025-03-13 21:50:38,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.389082462253194 [2025-03-13 21:50:38,884 INFO L175 Difference]: Start difference. First operand has 131 places, 165 transitions, 1697 flow. Second operand 82 states and 670 transitions. [2025-03-13 21:50:38,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 566 transitions, 6411 flow [2025-03-13 21:50:38,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 566 transitions, 5882 flow, removed 173 selfloop flow, removed 20 redundant places. [2025-03-13 21:50:38,946 INFO L231 Difference]: Finished difference. Result has 219 places, 379 transitions, 5020 flow [2025-03-13 21:50:38,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1445, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=82, PETRI_FLOW=5020, PETRI_PLACES=219, PETRI_TRANSITIONS=379} [2025-03-13 21:50:38,948 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 196 predicate places. [2025-03-13 21:50:38,949 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 379 transitions, 5020 flow [2025-03-13 21:50:38,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.655172413793103) internal successors, (135), 29 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:38,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:38,949 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-13 21:50:38,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-13 21:50:39,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:39,150 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:39,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:39,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1294429882, now seen corresponding path program 5 times [2025-03-13 21:50:39,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:39,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497691934] [2025-03-13 21:50:39,151 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:50:39,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:39,154 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:50:39,156 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:50:39,156 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:50:39,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:39,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:39,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:39,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497691934] [2025-03-13 21:50:39,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497691934] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:39,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034504798] [2025-03-13 21:50:39,191 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:50:39,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:39,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:39,193 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:39,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 21:50:39,216 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:50:39,224 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:50:39,225 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:50:39,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:39,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:50:39,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:39,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:39,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:39,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034504798] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:39,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:39,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-13 21:50:39,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097846819] [2025-03-13 21:50:39,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:39,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:50:39,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:39,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:50:39,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:50:39,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-03-13 21:50:39,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 379 transitions, 5020 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:39,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:39,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-03-13 21:50:39,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:39,500 INFO L124 PetriNetUnfolderBase]: 865/1568 cut-off events. [2025-03-13 21:50:39,500 INFO L125 PetriNetUnfolderBase]: For 13500/13520 co-relation queries the response was YES. [2025-03-13 21:50:39,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10455 conditions, 1568 events. 865/1568 cut-off events. For 13500/13520 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8240 event pairs, 24 based on Foata normal form. 42/1609 useless extension candidates. Maximal degree in co-relation 10309. Up to 824 conditions per place. [2025-03-13 21:50:39,515 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 218 selfloop transitions, 145 changer transitions 0/406 dead transitions. [2025-03-13 21:50:39,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 406 transitions, 5973 flow [2025-03-13 21:50:39,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:50:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:50:39,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2025-03-13 21:50:39,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-03-13 21:50:39,516 INFO L175 Difference]: Start difference. First operand has 219 places, 379 transitions, 5020 flow. Second operand 5 states and 55 transitions. [2025-03-13 21:50:39,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 406 transitions, 5973 flow [2025-03-13 21:50:39,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 406 transitions, 5148 flow, removed 288 selfloop flow, removed 22 redundant places. [2025-03-13 21:50:39,606 INFO L231 Difference]: Finished difference. Result has 186 places, 375 transitions, 4759 flow [2025-03-13 21:50:39,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=3884, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4759, PETRI_PLACES=186, PETRI_TRANSITIONS=375} [2025-03-13 21:50:39,606 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 163 predicate places. [2025-03-13 21:50:39,607 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 375 transitions, 4759 flow [2025-03-13 21:50:39,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:39,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:39,607 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-13 21:50:39,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-13 21:50:39,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:39,811 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:39,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:39,811 INFO L85 PathProgramCache]: Analyzing trace with hash -711583512, now seen corresponding path program 6 times [2025-03-13 21:50:39,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:39,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334176915] [2025-03-13 21:50:39,811 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:50:39,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:39,815 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:50:39,820 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:50:39,820 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:50:39,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:39,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:39,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:39,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334176915] [2025-03-13 21:50:39,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334176915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:50:39,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:50:39,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:50:39,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693768395] [2025-03-13 21:50:39,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:50:39,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:50:39,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:39,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:50:39,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:50:40,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-03-13 21:50:40,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 375 transitions, 4759 flow. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:40,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:40,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-03-13 21:50:40,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:40,308 INFO L124 PetriNetUnfolderBase]: 926/1689 cut-off events. [2025-03-13 21:50:40,309 INFO L125 PetriNetUnfolderBase]: For 14304/14304 co-relation queries the response was YES. [2025-03-13 21:50:40,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10740 conditions, 1689 events. 926/1689 cut-off events. For 14304/14304 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9056 event pairs, 31 based on Foata normal form. 1/1682 useless extension candidates. Maximal degree in co-relation 10588. Up to 1325 conditions per place. [2025-03-13 21:50:40,324 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 306 selfloop transitions, 28 changer transitions 13/425 dead transitions. [2025-03-13 21:50:40,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 425 transitions, 5896 flow [2025-03-13 21:50:40,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:50:40,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:50:40,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2025-03-13 21:50:40,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-03-13 21:50:40,326 INFO L175 Difference]: Start difference. First operand has 186 places, 375 transitions, 4759 flow. Second operand 10 states and 100 transitions. [2025-03-13 21:50:40,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 425 transitions, 5896 flow [2025-03-13 21:50:40,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 425 transitions, 5853 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 21:50:40,407 INFO L231 Difference]: Finished difference. Result has 202 places, 389 transitions, 5065 flow [2025-03-13 21:50:40,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=4719, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5065, PETRI_PLACES=202, PETRI_TRANSITIONS=389} [2025-03-13 21:50:40,408 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 179 predicate places. [2025-03-13 21:50:40,408 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 389 transitions, 5065 flow [2025-03-13 21:50:40,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:40,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:40,408 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-13 21:50:40,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:50:40,409 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:40,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:40,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1423069888, now seen corresponding path program 7 times [2025-03-13 21:50:40,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:40,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958033031] [2025-03-13 21:50:40,409 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:50:40,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:40,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:50:40,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:50:40,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:40,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:40,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:40,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958033031] [2025-03-13 21:50:40,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958033031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:50:40,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:50:40,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:50:40,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464690419] [2025-03-13 21:50:40,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:50:40,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:50:40,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:40,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:50:40,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:50:40,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2025-03-13 21:50:40,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 389 transitions, 5065 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:40,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:40,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2025-03-13 21:50:40,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:40,973 INFO L124 PetriNetUnfolderBase]: 867/1641 cut-off events. [2025-03-13 21:50:40,973 INFO L125 PetriNetUnfolderBase]: For 13902/13908 co-relation queries the response was YES. [2025-03-13 21:50:40,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10556 conditions, 1641 events. 867/1641 cut-off events. For 13902/13908 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9228 event pairs, 22 based on Foata normal form. 2/1635 useless extension candidates. Maximal degree in co-relation 10458. Up to 1116 conditions per place. [2025-03-13 21:50:40,985 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 266 selfloop transitions, 49 changer transitions 8/443 dead transitions. [2025-03-13 21:50:40,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 443 transitions, 6061 flow [2025-03-13 21:50:40,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-13 21:50:40,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-13 21:50:40,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 151 transitions. [2025-03-13 21:50:40,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4793650793650794 [2025-03-13 21:50:40,987 INFO L175 Difference]: Start difference. First operand has 202 places, 389 transitions, 5065 flow. Second operand 15 states and 151 transitions. [2025-03-13 21:50:40,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 443 transitions, 6061 flow [2025-03-13 21:50:41,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 443 transitions, 6007 flow, removed 27 selfloop flow, removed 3 redundant places. [2025-03-13 21:50:41,056 INFO L231 Difference]: Finished difference. Result has 216 places, 410 transitions, 5421 flow [2025-03-13 21:50:41,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=5015, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5421, PETRI_PLACES=216, PETRI_TRANSITIONS=410} [2025-03-13 21:50:41,057 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 193 predicate places. [2025-03-13 21:50:41,057 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 410 transitions, 5421 flow [2025-03-13 21:50:41,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:41,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:41,057 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-13 21:50:41,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:50:41,058 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:41,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:41,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1315971510, now seen corresponding path program 8 times [2025-03-13 21:50:41,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:41,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658239104] [2025-03-13 21:50:41,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:50:41,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:41,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:50:41,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:50:41,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:50:41,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:41,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:41,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:41,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658239104] [2025-03-13 21:50:41,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658239104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:41,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283934068] [2025-03-13 21:50:41,187 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:50:41,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:41,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:41,189 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:41,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-13 21:50:41,214 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:50:41,225 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:50:41,225 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:50:41,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:41,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-13 21:50:41,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:41,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:41,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:41,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283934068] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:41,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:41,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-03-13 21:50:41,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631724534] [2025-03-13 21:50:41,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:41,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-13 21:50:41,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:41,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-13 21:50:41,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2025-03-13 21:50:41,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:50:41,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 410 transitions, 5421 flow. Second operand has 24 states, 24 states have (on average 4.958333333333333) internal successors, (119), 24 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:41,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:41,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:50:41,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:42,345 INFO L124 PetriNetUnfolderBase]: 1279/2272 cut-off events. [2025-03-13 21:50:42,346 INFO L125 PetriNetUnfolderBase]: For 19242/19242 co-relation queries the response was YES. [2025-03-13 21:50:42,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14779 conditions, 2272 events. 1279/2272 cut-off events. For 19242/19242 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12698 event pairs, 26 based on Foata normal form. 4/2276 useless extension candidates. Maximal degree in co-relation 14626. Up to 977 conditions per place. [2025-03-13 21:50:42,364 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 247 selfloop transitions, 345 changer transitions 6/599 dead transitions. [2025-03-13 21:50:42,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 599 transitions, 8697 flow [2025-03-13 21:50:42,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-13 21:50:42,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-13 21:50:42,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 215 transitions. [2025-03-13 21:50:42,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37918871252204583 [2025-03-13 21:50:42,366 INFO L175 Difference]: Start difference. First operand has 216 places, 410 transitions, 5421 flow. Second operand 27 states and 215 transitions. [2025-03-13 21:50:42,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 599 transitions, 8697 flow [2025-03-13 21:50:42,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 599 transitions, 8571 flow, removed 46 selfloop flow, removed 6 redundant places. [2025-03-13 21:50:42,498 INFO L231 Difference]: Finished difference. Result has 249 places, 527 transitions, 8340 flow [2025-03-13 21:50:42,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=5307, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=237, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=8340, PETRI_PLACES=249, PETRI_TRANSITIONS=527} [2025-03-13 21:50:42,498 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 226 predicate places. [2025-03-13 21:50:42,498 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 527 transitions, 8340 flow [2025-03-13 21:50:42,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.958333333333333) internal successors, (119), 24 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:42,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:42,499 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-13 21:50:42,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-13 21:50:42,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:42,699 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:42,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:42,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1691599744, now seen corresponding path program 9 times [2025-03-13 21:50:42,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:42,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617575811] [2025-03-13 21:50:42,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:50:42,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:42,702 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:50:42,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:50:42,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:50:42,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:42,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:42,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:42,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617575811] [2025-03-13 21:50:42,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617575811] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:42,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378588974] [2025-03-13 21:50:42,860 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:50:42,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:42,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:42,862 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:42,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-13 21:50:42,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:50:42,893 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:50:42,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:50:42,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:42,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-13 21:50:42,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:43,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:43,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:43,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378588974] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:43,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:43,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-13 21:50:43,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711228743] [2025-03-13 21:50:43,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:43,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-13 21:50:43,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:43,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-13 21:50:43,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2025-03-13 21:50:43,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:50:43,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 527 transitions, 8340 flow. Second operand has 25 states, 25 states have (on average 4.96) internal successors, (124), 25 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:43,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:43,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:50:43,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:44,054 INFO L124 PetriNetUnfolderBase]: 1359/2405 cut-off events. [2025-03-13 21:50:44,055 INFO L125 PetriNetUnfolderBase]: For 27300/27300 co-relation queries the response was YES. [2025-03-13 21:50:44,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18136 conditions, 2405 events. 1359/2405 cut-off events. For 27300/27300 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 13566 event pairs, 27 based on Foata normal form. 3/2408 useless extension candidates. Maximal degree in co-relation 17988. Up to 1155 conditions per place. [2025-03-13 21:50:44,070 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 275 selfloop transitions, 348 changer transitions 20/644 dead transitions. [2025-03-13 21:50:44,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 644 transitions, 11212 flow [2025-03-13 21:50:44,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 21:50:44,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 21:50:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 187 transitions. [2025-03-13 21:50:44,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42403628117913833 [2025-03-13 21:50:44,071 INFO L175 Difference]: Start difference. First operand has 249 places, 527 transitions, 8340 flow. Second operand 21 states and 187 transitions. [2025-03-13 21:50:44,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 644 transitions, 11212 flow [2025-03-13 21:50:44,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 644 transitions, 11011 flow, removed 89 selfloop flow, removed 4 redundant places. [2025-03-13 21:50:44,276 INFO L231 Difference]: Finished difference. Result has 274 places, 574 transitions, 10528 flow [2025-03-13 21:50:44,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=8191, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=294, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=10528, PETRI_PLACES=274, PETRI_TRANSITIONS=574} [2025-03-13 21:50:44,277 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 251 predicate places. [2025-03-13 21:50:44,277 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 574 transitions, 10528 flow [2025-03-13 21:50:44,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.96) internal successors, (124), 25 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:44,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:44,277 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-13 21:50:44,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-13 21:50:44,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:44,478 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:44,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:44,478 INFO L85 PathProgramCache]: Analyzing trace with hash -867281600, now seen corresponding path program 10 times [2025-03-13 21:50:44,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:44,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367161997] [2025-03-13 21:50:44,478 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:50:44,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:44,481 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:50:44,483 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:50:44,483 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:50:44,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:44,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:44,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367161997] [2025-03-13 21:50:44,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367161997] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:44,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951486841] [2025-03-13 21:50:44,616 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:50:44,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:44,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:44,618 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-13 21:50:44,623 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-13 21:50:44,643 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:50:44,651 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:50:44,652 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:50:44,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:44,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-13 21:50:44,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:44,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:45,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:45,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951486841] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:45,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:45,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 27 [2025-03-13 21:50:45,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755716602] [2025-03-13 21:50:45,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:45,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-13 21:50:45,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:45,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-13 21:50:45,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2025-03-13 21:50:45,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:50:45,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 574 transitions, 10528 flow. Second operand has 28 states, 28 states have (on average 4.714285714285714) internal successors, (132), 28 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:45,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:45,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:50:45,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:46,444 INFO L124 PetriNetUnfolderBase]: 1415/2505 cut-off events. [2025-03-13 21:50:46,445 INFO L125 PetriNetUnfolderBase]: For 35135/35135 co-relation queries the response was YES. [2025-03-13 21:50:46,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20719 conditions, 2505 events. 1415/2505 cut-off events. For 35135/35135 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 14237 event pairs, 18 based on Foata normal form. 12/2517 useless extension candidates. Maximal degree in co-relation 20562. Up to 1033 conditions per place. [2025-03-13 21:50:46,463 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 226 selfloop transitions, 500 changer transitions 12/739 dead transitions. [2025-03-13 21:50:46,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 739 transitions, 13982 flow [2025-03-13 21:50:46,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-13 21:50:46,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-03-13 21:50:46,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 310 transitions. [2025-03-13 21:50:46,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3600464576074332 [2025-03-13 21:50:46,466 INFO L175 Difference]: Start difference. First operand has 274 places, 574 transitions, 10528 flow. Second operand 41 states and 310 transitions. [2025-03-13 21:50:46,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 739 transitions, 13982 flow [2025-03-13 21:50:46,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 739 transitions, 13550 flow, removed 107 selfloop flow, removed 18 redundant places. [2025-03-13 21:50:46,713 INFO L231 Difference]: Finished difference. Result has 300 places, 661 transitions, 12916 flow [2025-03-13 21:50:46,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=10085, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=408, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=12916, PETRI_PLACES=300, PETRI_TRANSITIONS=661} [2025-03-13 21:50:46,714 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 277 predicate places. [2025-03-13 21:50:46,714 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 661 transitions, 12916 flow [2025-03-13 21:50:46,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.714285714285714) internal successors, (132), 28 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:46,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:46,714 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-13 21:50:46,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-13 21:50:46,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,SelfDestructingSolverStorable11 [2025-03-13 21:50:46,915 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:46,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:46,915 INFO L85 PathProgramCache]: Analyzing trace with hash 835601310, now seen corresponding path program 11 times [2025-03-13 21:50:46,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:46,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364157641] [2025-03-13 21:50:46,915 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:50:46,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:46,918 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:50:46,920 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:50:46,920 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:50:46,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:47,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:47,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:47,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364157641] [2025-03-13 21:50:47,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364157641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:50:47,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:50:47,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:50:47,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573479034] [2025-03-13 21:50:47,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:50:47,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:50:47,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:47,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:50:47,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:50:47,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2025-03-13 21:50:47,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 661 transitions, 12916 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:47,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:47,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2025-03-13 21:50:47,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:47,551 INFO L124 PetriNetUnfolderBase]: 1239/2327 cut-off events. [2025-03-13 21:50:47,551 INFO L125 PetriNetUnfolderBase]: For 36815/36816 co-relation queries the response was YES. [2025-03-13 21:50:47,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20910 conditions, 2327 events. 1239/2327 cut-off events. For 36815/36816 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 14098 event pairs, 27 based on Foata normal form. 1/2319 useless extension candidates. Maximal degree in co-relation 20737. Up to 1686 conditions per place. [2025-03-13 21:50:47,572 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 463 selfloop transitions, 29 changer transitions 4/689 dead transitions. [2025-03-13 21:50:47,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 689 transitions, 14231 flow [2025-03-13 21:50:47,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:50:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:50:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2025-03-13 21:50:47,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2025-03-13 21:50:47,574 INFO L175 Difference]: Start difference. First operand has 300 places, 661 transitions, 12916 flow. Second operand 10 states and 96 transitions. [2025-03-13 21:50:47,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 689 transitions, 14231 flow [2025-03-13 21:50:47,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 689 transitions, 14052 flow, removed 41 selfloop flow, removed 14 redundant places. [2025-03-13 21:50:47,908 INFO L231 Difference]: Finished difference. Result has 299 places, 674 transitions, 13115 flow [2025-03-13 21:50:47,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=12755, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13115, PETRI_PLACES=299, PETRI_TRANSITIONS=674} [2025-03-13 21:50:47,909 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 276 predicate places. [2025-03-13 21:50:47,909 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 674 transitions, 13115 flow [2025-03-13 21:50:47,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:47,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:47,909 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:47,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 21:50:47,910 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:47,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:47,912 INFO L85 PathProgramCache]: Analyzing trace with hash -688175026, now seen corresponding path program 12 times [2025-03-13 21:50:47,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:47,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023816663] [2025-03-13 21:50:47,912 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:50:47,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:47,914 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-03-13 21:50:47,921 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:50:47,922 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-13 21:50:47,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:48,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:48,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:48,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023816663] [2025-03-13 21:50:48,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023816663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:48,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201983601] [2025-03-13 21:50:48,086 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:50:48,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:48,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:48,088 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-13 21:50:48,089 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-13 21:50:48,113 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-03-13 21:50:48,122 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:50:48,122 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-13 21:50:48,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:48,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-13 21:50:48,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:48,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:50:48,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:48,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:48,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201983601] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:48,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:48,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 26 [2025-03-13 21:50:48,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053731768] [2025-03-13 21:50:48,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:48,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-13 21:50:48,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:48,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-13 21:50:48,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2025-03-13 21:50:48,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:50:48,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 674 transitions, 13115 flow. Second operand has 27 states, 27 states have (on average 4.962962962962963) internal successors, (134), 27 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:48,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:48,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:50:48,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:49,949 INFO L124 PetriNetUnfolderBase]: 1518/2684 cut-off events. [2025-03-13 21:50:49,949 INFO L125 PetriNetUnfolderBase]: For 37399/37399 co-relation queries the response was YES. [2025-03-13 21:50:49,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23354 conditions, 2684 events. 1518/2684 cut-off events. For 37399/37399 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 15552 event pairs, 24 based on Foata normal form. 2/2686 useless extension candidates. Maximal degree in co-relation 23190. Up to 1127 conditions per place. [2025-03-13 21:50:49,973 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 262 selfloop transitions, 525 changer transitions 7/795 dead transitions. [2025-03-13 21:50:49,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 795 transitions, 16118 flow [2025-03-13 21:50:49,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-13 21:50:49,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-13 21:50:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 266 transitions. [2025-03-13 21:50:49,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2025-03-13 21:50:49,975 INFO L175 Difference]: Start difference. First operand has 299 places, 674 transitions, 13115 flow. Second operand 34 states and 266 transitions. [2025-03-13 21:50:49,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 795 transitions, 16118 flow [2025-03-13 21:50:50,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 795 transitions, 16028 flow, removed 39 selfloop flow, removed 3 redundant places. [2025-03-13 21:50:50,350 INFO L231 Difference]: Finished difference. Result has 337 places, 728 transitions, 15503 flow [2025-03-13 21:50:50,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=13055, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=471, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=15503, PETRI_PLACES=337, PETRI_TRANSITIONS=728} [2025-03-13 21:50:50,351 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 314 predicate places. [2025-03-13 21:50:50,351 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 728 transitions, 15503 flow [2025-03-13 21:50:50,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.962962962962963) internal successors, (134), 27 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:50,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:50,351 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:50,356 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-13 21:50:50,551 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,SelfDestructingSolverStorable13 [2025-03-13 21:50:50,551 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:50,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:50,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1246380642, now seen corresponding path program 13 times [2025-03-13 21:50:50,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:50,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381889974] [2025-03-13 21:50:50,552 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:50:50,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:50,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:50:50,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:50:50,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:50,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:50,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:50,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:50,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381889974] [2025-03-13 21:50:50,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381889974] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:50,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658991846] [2025-03-13 21:50:50,725 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:50:50,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:50,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:50,728 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-13 21:50:50,729 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-13 21:50:50,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:50:50,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:50:50,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:50,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:50,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-13 21:50:50,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:50:50,897 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:50:50,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658991846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:50:50,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:50:50,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 18 [2025-03-13 21:50:50,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250692960] [2025-03-13 21:50:50,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:50:50,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:50:50,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:50,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:50:50,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-13 21:50:50,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:50:50,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 728 transitions, 15503 flow. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:50,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:50,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:50:50,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:51,456 INFO L124 PetriNetUnfolderBase]: 1512/2656 cut-off events. [2025-03-13 21:50:51,456 INFO L125 PetriNetUnfolderBase]: For 44038/44038 co-relation queries the response was YES. [2025-03-13 21:50:51,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25098 conditions, 2656 events. 1512/2656 cut-off events. For 44038/44038 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 15256 event pairs, 96 based on Foata normal form. 1/2657 useless extension candidates. Maximal degree in co-relation 24921. Up to 2100 conditions per place. [2025-03-13 21:50:51,485 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 639 selfloop transitions, 92 changer transitions 14/746 dead transitions. [2025-03-13 21:50:51,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 746 transitions, 17144 flow [2025-03-13 21:50:51,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:50:51,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:50:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2025-03-13 21:50:51,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2025-03-13 21:50:51,486 INFO L175 Difference]: Start difference. First operand has 337 places, 728 transitions, 15503 flow. Second operand 10 states and 92 transitions. [2025-03-13 21:50:51,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 746 transitions, 17144 flow [2025-03-13 21:50:51,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 746 transitions, 16952 flow, removed 26 selfloop flow, removed 14 redundant places. [2025-03-13 21:50:51,926 INFO L231 Difference]: Finished difference. Result has 329 places, 720 transitions, 15374 flow [2025-03-13 21:50:51,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=15302, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15374, PETRI_PLACES=329, PETRI_TRANSITIONS=720} [2025-03-13 21:50:51,926 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 306 predicate places. [2025-03-13 21:50:51,927 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 720 transitions, 15374 flow [2025-03-13 21:50:51,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:51,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:51,927 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:51,932 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-13 21:50:52,127 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,SelfDestructingSolverStorable14 [2025-03-13 21:50:52,127 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:52,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:52,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1015214464, now seen corresponding path program 14 times [2025-03-13 21:50:52,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:52,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834609233] [2025-03-13 21:50:52,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:50:52,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:52,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-13 21:50:52,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:50:52,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:50:52,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:52,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:52,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:52,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834609233] [2025-03-13 21:50:52,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834609233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:52,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466270318] [2025-03-13 21:50:52,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:50:52,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:52,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:52,272 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-13 21:50:52,273 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-13 21:50:52,294 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-13 21:50:52,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:50:52,302 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:50:52,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:52,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-13 21:50:52,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:50:52,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:50:52,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466270318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:50:52,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:50:52,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2025-03-13 21:50:52,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394833879] [2025-03-13 21:50:52,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:50:52,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:50:52,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:52,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:50:52,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-03-13 21:50:52,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:50:52,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 720 transitions, 15374 flow. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:52,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:52,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:50:52,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:53,065 INFO L124 PetriNetUnfolderBase]: 1496/2621 cut-off events. [2025-03-13 21:50:53,065 INFO L125 PetriNetUnfolderBase]: For 42849/42849 co-relation queries the response was YES. [2025-03-13 21:50:53,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24882 conditions, 2621 events. 1496/2621 cut-off events. For 42849/42849 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 14858 event pairs, 61 based on Foata normal form. 1/2622 useless extension candidates. Maximal degree in co-relation 24683. Up to 2308 conditions per place. [2025-03-13 21:50:53,092 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 683 selfloop transitions, 49 changer transitions 4/737 dead transitions. [2025-03-13 21:50:53,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 737 transitions, 17018 flow [2025-03-13 21:50:53,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:50:53,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:50:53,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 86 transitions. [2025-03-13 21:50:53,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2025-03-13 21:50:53,094 INFO L175 Difference]: Start difference. First operand has 329 places, 720 transitions, 15374 flow. Second operand 10 states and 86 transitions. [2025-03-13 21:50:53,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 737 transitions, 17018 flow [2025-03-13 21:50:53,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 737 transitions, 16818 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-13 21:50:53,547 INFO L231 Difference]: Finished difference. Result has 328 places, 720 transitions, 15289 flow [2025-03-13 21:50:53,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=15174, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15289, PETRI_PLACES=328, PETRI_TRANSITIONS=720} [2025-03-13 21:50:53,548 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 305 predicate places. [2025-03-13 21:50:53,548 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 720 transitions, 15289 flow [2025-03-13 21:50:53,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:53,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:53,548 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:53,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-13 21:50:53,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-13 21:50:53,749 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:53,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:53,749 INFO L85 PathProgramCache]: Analyzing trace with hash -2082456933, now seen corresponding path program 15 times [2025-03-13 21:50:53,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:53,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80463144] [2025-03-13 21:50:53,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:50:53,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:53,753 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:50:53,758 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:50:53,758 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:50:53,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:53,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:53,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:53,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80463144] [2025-03-13 21:50:53,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80463144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:53,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306614679] [2025-03-13 21:50:53,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:50:53,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:53,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:53,906 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-13 21:50:53,907 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-13 21:50:53,929 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:50:53,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:50:53,938 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:50:53,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:53,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-13 21:50:53,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:54,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:54,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:54,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306614679] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:54,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:54,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-13 21:50:54,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076014720] [2025-03-13 21:50:54,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:54,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-13 21:50:54,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:54,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-13 21:50:54,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=968, Unknown=0, NotChecked=0, Total=1122 [2025-03-13 21:50:54,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:50:54,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 720 transitions, 15289 flow. Second operand has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:54,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:54,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:50:54,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:57,406 INFO L124 PetriNetUnfolderBase]: 2109/3717 cut-off events. [2025-03-13 21:50:57,406 INFO L125 PetriNetUnfolderBase]: For 66791/66791 co-relation queries the response was YES. [2025-03-13 21:50:57,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35791 conditions, 3717 events. 2109/3717 cut-off events. For 66791/66791 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 22523 event pairs, 47 based on Foata normal form. 7/3724 useless extension candidates. Maximal degree in co-relation 35607. Up to 1031 conditions per place. [2025-03-13 21:50:57,438 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 424 selfloop transitions, 728 changer transitions 30/1183 dead transitions. [2025-03-13 21:50:57,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 1183 transitions, 25826 flow [2025-03-13 21:50:57,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2025-03-13 21:50:57,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2025-03-13 21:50:57,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 677 transitions. [2025-03-13 21:50:57,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3792717086834734 [2025-03-13 21:50:57,440 INFO L175 Difference]: Start difference. First operand has 328 places, 720 transitions, 15289 flow. Second operand 85 states and 677 transitions. [2025-03-13 21:50:57,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 1183 transitions, 25826 flow [2025-03-13 21:50:58,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 1183 transitions, 25757 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-03-13 21:50:58,061 INFO L231 Difference]: Finished difference. Result has 418 places, 1011 transitions, 24658 flow [2025-03-13 21:50:58,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=15228, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=497, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=85, PETRI_FLOW=24658, PETRI_PLACES=418, PETRI_TRANSITIONS=1011} [2025-03-13 21:50:58,061 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 395 predicate places. [2025-03-13 21:50:58,061 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 1011 transitions, 24658 flow [2025-03-13 21:50:58,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:58,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:58,062 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:58,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-13 21:50:58,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-13 21:50:58,262 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:50:58,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:58,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1773726905, now seen corresponding path program 16 times [2025-03-13 21:50:58,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:58,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691408233] [2025-03-13 21:50:58,263 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:50:58,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:58,265 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:50:58,267 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:50:58,267 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:50:58,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:58,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:50:58,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:58,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691408233] [2025-03-13 21:50:58,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691408233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:58,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382623855] [2025-03-13 21:50:58,371 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:50:58,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:58,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:58,373 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-13 21:50:58,374 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-13 21:50:58,398 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:50:58,406 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:50:58,407 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:50:58,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:58,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-13 21:50:58,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:58,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:58,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:58,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382623855] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:58,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:58,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 33 [2025-03-13 21:50:58,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475648595] [2025-03-13 21:50:58,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:58,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-13 21:50:58,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:58,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-13 21:50:58,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2025-03-13 21:50:58,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:50:58,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 1011 transitions, 24658 flow. Second operand has 34 states, 34 states have (on average 4.676470588235294) internal successors, (159), 34 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:58,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:58,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:50:58,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:01,978 INFO L124 PetriNetUnfolderBase]: 2335/4171 cut-off events. [2025-03-13 21:51:01,978 INFO L125 PetriNetUnfolderBase]: For 91082/91082 co-relation queries the response was YES. [2025-03-13 21:51:02,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44090 conditions, 4171 events. 2335/4171 cut-off events. For 91082/91082 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 25926 event pairs, 75 based on Foata normal form. 7/4178 useless extension candidates. Maximal degree in co-relation 43893. Up to 1085 conditions per place. [2025-03-13 21:51:02,019 INFO L140 encePairwiseOnDemand]: 10/21 looper letters, 395 selfloop transitions, 872 changer transitions 75/1343 dead transitions. [2025-03-13 21:51:02,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 1343 transitions, 32437 flow [2025-03-13 21:51:02,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-03-13 21:51:02,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2025-03-13 21:51:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 704 transitions. [2025-03-13 21:51:02,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3683935112506541 [2025-03-13 21:51:02,021 INFO L175 Difference]: Start difference. First operand has 418 places, 1011 transitions, 24658 flow. Second operand 91 states and 704 transitions. [2025-03-13 21:51:02,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 503 places, 1343 transitions, 32437 flow [2025-03-13 21:51:03,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 489 places, 1343 transitions, 31759 flow, removed 231 selfloop flow, removed 14 redundant places. [2025-03-13 21:51:03,089 INFO L231 Difference]: Finished difference. Result has 506 places, 1130 transitions, 29458 flow [2025-03-13 21:51:03,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=24100, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1011, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=756, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=91, PETRI_FLOW=29458, PETRI_PLACES=506, PETRI_TRANSITIONS=1130} [2025-03-13 21:51:03,090 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 483 predicate places. [2025-03-13 21:51:03,091 INFO L471 AbstractCegarLoop]: Abstraction has has 506 places, 1130 transitions, 29458 flow [2025-03-13 21:51:03,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.676470588235294) internal successors, (159), 34 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:03,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:03,091 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:51:03,143 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-13 21:51:03,295 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,SelfDestructingSolverStorable17 [2025-03-13 21:51:03,295 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:51:03,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:03,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1250110879, now seen corresponding path program 17 times [2025-03-13 21:51:03,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:03,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974432225] [2025-03-13 21:51:03,296 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:51:03,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:03,299 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-03-13 21:51:03,301 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:51:03,301 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-13 21:51:03,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:03,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:03,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:03,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974432225] [2025-03-13 21:51:03,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974432225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:51:03,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461899211] [2025-03-13 21:51:03,445 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:51:03,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:03,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:51:03,447 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-13 21:51:03,449 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-13 21:51:03,470 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-03-13 21:51:03,479 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:51:03,479 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-13 21:51:03,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:03,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-13 21:51:03,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:51:03,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:03,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:51:04,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:04,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461899211] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:51:04,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:51:04,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-13 21:51:04,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801457777] [2025-03-13 21:51:04,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:51:04,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-13 21:51:04,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:04,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-13 21:51:04,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=955, Unknown=0, NotChecked=0, Total=1122 [2025-03-13 21:51:04,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:51:04,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 506 places, 1130 transitions, 29458 flow. Second operand has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:04,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:04,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:51:04,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:08,438 INFO L124 PetriNetUnfolderBase]: 2852/5135 cut-off events. [2025-03-13 21:51:08,438 INFO L125 PetriNetUnfolderBase]: For 123286/123286 co-relation queries the response was YES. [2025-03-13 21:51:08,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57287 conditions, 5135 events. 2852/5135 cut-off events. For 123286/123286 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 33683 event pairs, 58 based on Foata normal form. 7/5142 useless extension candidates. Maximal degree in co-relation 57074. Up to 1252 conditions per place. [2025-03-13 21:51:08,494 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 466 selfloop transitions, 1131 changer transitions 28/1626 dead transitions. [2025-03-13 21:51:08,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 1626 transitions, 42859 flow [2025-03-13 21:51:08,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2025-03-13 21:51:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2025-03-13 21:51:08,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 796 transitions. [2025-03-13 21:51:08,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36800739713361075 [2025-03-13 21:51:08,496 INFO L175 Difference]: Start difference. First operand has 506 places, 1130 transitions, 29458 flow. Second operand 103 states and 796 transitions. [2025-03-13 21:51:08,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 1626 transitions, 42859 flow [2025-03-13 21:51:10,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 1626 transitions, 40714 flow, removed 472 selfloop flow, removed 29 redundant places. [2025-03-13 21:51:10,178 INFO L231 Difference]: Finished difference. Result has 588 places, 1414 transitions, 39190 flow [2025-03-13 21:51:10,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=27929, PETRI_DIFFERENCE_MINUEND_PLACES=459, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=865, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=103, PETRI_FLOW=39190, PETRI_PLACES=588, PETRI_TRANSITIONS=1414} [2025-03-13 21:51:10,180 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 565 predicate places. [2025-03-13 21:51:10,180 INFO L471 AbstractCegarLoop]: Abstraction has has 588 places, 1414 transitions, 39190 flow [2025-03-13 21:51:10,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:10,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:10,180 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:51:10,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-13 21:51:10,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:10,381 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:51:10,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:10,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1431805455, now seen corresponding path program 18 times [2025-03-13 21:51:10,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:10,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274408592] [2025-03-13 21:51:10,381 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:51:10,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:10,383 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-03-13 21:51:10,386 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:51:10,387 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-13 21:51:10,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:10,538 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-13 21:51:10,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:10,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274408592] [2025-03-13 21:51:10,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274408592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:51:10,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143035286] [2025-03-13 21:51:10,539 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:51:10,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:10,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:51:10,541 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-13 21:51:10,542 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-13 21:51:10,566 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-03-13 21:51:10,574 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:51:10,574 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-13 21:51:10,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:10,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-13 21:51:10,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:51:10,774 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-13 21:51:10,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:51:11,221 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-13 21:51:11,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143035286] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:51:11,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:51:11,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-13 21:51:11,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526924862] [2025-03-13 21:51:11,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:51:11,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-13 21:51:11,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:11,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-13 21:51:11,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=950, Unknown=0, NotChecked=0, Total=1122 [2025-03-13 21:51:11,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:51:11,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 1414 transitions, 39190 flow. Second operand has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:11,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:11,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:51:11,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:15,601 INFO L124 PetriNetUnfolderBase]: 3157/5686 cut-off events. [2025-03-13 21:51:15,602 INFO L125 PetriNetUnfolderBase]: For 141164/141164 co-relation queries the response was YES. [2025-03-13 21:51:15,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66284 conditions, 5686 events. 3157/5686 cut-off events. For 141164/141164 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 37915 event pairs, 67 based on Foata normal form. 6/5692 useless extension candidates. Maximal degree in co-relation 66043. Up to 1629 conditions per place. [2025-03-13 21:51:15,670 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 563 selfloop transitions, 1141 changer transitions 27/1732 dead transitions. [2025-03-13 21:51:15,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 671 places, 1732 transitions, 48284 flow [2025-03-13 21:51:15,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-03-13 21:51:15,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2025-03-13 21:51:15,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 684 transitions. [2025-03-13 21:51:15,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37438423645320196 [2025-03-13 21:51:15,673 INFO L175 Difference]: Start difference. First operand has 588 places, 1414 transitions, 39190 flow. Second operand 87 states and 684 transitions. [2025-03-13 21:51:15,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 671 places, 1732 transitions, 48284 flow [2025-03-13 21:51:18,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 639 places, 1732 transitions, 47421 flow, removed 256 selfloop flow, removed 32 redundant places. [2025-03-13 21:51:18,036 INFO L231 Difference]: Finished difference. Result has 655 places, 1544 transitions, 45812 flow [2025-03-13 21:51:18,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=38471, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1009, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=87, PETRI_FLOW=45812, PETRI_PLACES=655, PETRI_TRANSITIONS=1544} [2025-03-13 21:51:18,038 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 632 predicate places. [2025-03-13 21:51:18,038 INFO L471 AbstractCegarLoop]: Abstraction has has 655 places, 1544 transitions, 45812 flow [2025-03-13 21:51:18,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:18,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:18,038 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:51:18,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-13 21:51:18,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:18,238 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:51:18,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:18,239 INFO L85 PathProgramCache]: Analyzing trace with hash 187761577, now seen corresponding path program 19 times [2025-03-13 21:51:18,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:18,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950291933] [2025-03-13 21:51:18,239 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:51:18,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:18,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:51:18,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:51:18,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:51:18,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:18,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:18,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950291933] [2025-03-13 21:51:18,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950291933] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:51:18,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483919471] [2025-03-13 21:51:18,389 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:51:18,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:18,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:51:18,391 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-13 21:51:18,392 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-13 21:51:18,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:51:18,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:51:18,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:51:18,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:18,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-13 21:51:18,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:51:18,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:18,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:51:18,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:18,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483919471] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:51:18,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:51:18,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-13 21:51:18,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396355930] [2025-03-13 21:51:18,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:51:18,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-13 21:51:18,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:18,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-13 21:51:18,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2025-03-13 21:51:18,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:51:18,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 655 places, 1544 transitions, 45812 flow. Second operand has 34 states, 34 states have (on average 4.676470588235294) internal successors, (159), 34 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:18,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:18,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:51:18,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:23,340 INFO L124 PetriNetUnfolderBase]: 3549/6379 cut-off events. [2025-03-13 21:51:23,340 INFO L125 PetriNetUnfolderBase]: For 181389/181389 co-relation queries the response was YES. [2025-03-13 21:51:23,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77596 conditions, 6379 events. 3549/6379 cut-off events. For 181389/181389 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 43607 event pairs, 88 based on Foata normal form. 9/6388 useless extension candidates. Maximal degree in co-relation 77436. Up to 1987 conditions per place. [2025-03-13 21:51:23,530 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 613 selfloop transitions, 1322 changer transitions 24/1960 dead transitions. [2025-03-13 21:51:23,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 736 places, 1960 transitions, 57792 flow [2025-03-13 21:51:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-03-13 21:51:23,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2025-03-13 21:51:23,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 713 transitions. [2025-03-13 21:51:23,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39025725232621783 [2025-03-13 21:51:23,531 INFO L175 Difference]: Start difference. First operand has 655 places, 1544 transitions, 45812 flow. Second operand 87 states and 713 transitions. [2025-03-13 21:51:23,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 736 places, 1960 transitions, 57792 flow [2025-03-13 21:51:26,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 712 places, 1960 transitions, 57228 flow, removed 84 selfloop flow, removed 24 redundant places. [2025-03-13 21:51:26,526 INFO L231 Difference]: Finished difference. Result has 740 places, 1758 transitions, 55794 flow [2025-03-13 21:51:26,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=45339, PETRI_DIFFERENCE_MINUEND_PLACES=626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=87, PETRI_FLOW=55794, PETRI_PLACES=740, PETRI_TRANSITIONS=1758} [2025-03-13 21:51:26,528 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 717 predicate places. [2025-03-13 21:51:26,528 INFO L471 AbstractCegarLoop]: Abstraction has has 740 places, 1758 transitions, 55794 flow [2025-03-13 21:51:26,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.676470588235294) internal successors, (159), 34 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:26,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:26,528 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:51:26,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-13 21:51:26,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:26,729 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:51:26,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:26,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1149581125, now seen corresponding path program 20 times [2025-03-13 21:51:26,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:26,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864344532] [2025-03-13 21:51:26,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:51:26,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:26,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:51:26,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:51:26,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:51:26,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:26,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:26,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:26,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864344532] [2025-03-13 21:51:26,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864344532] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:51:26,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601979816] [2025-03-13 21:51:26,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:51:26,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:26,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:51:26,920 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-13 21:51:26,920 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-13 21:51:26,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:51:26,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:51:26,948 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:51:26,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:26,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-13 21:51:26,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:51:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:27,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:51:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:27,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601979816] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:51:27,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:51:27,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-13 21:51:27,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697475489] [2025-03-13 21:51:27,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:51:27,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-13 21:51:27,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:27,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-13 21:51:27,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=953, Unknown=0, NotChecked=0, Total=1122 [2025-03-13 21:51:27,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:51:27,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 740 places, 1758 transitions, 55794 flow. Second operand has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:27,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:27,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:51:27,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:33,110 INFO L124 PetriNetUnfolderBase]: 4206/7590 cut-off events. [2025-03-13 21:51:33,110 INFO L125 PetriNetUnfolderBase]: For 258141/258141 co-relation queries the response was YES. [2025-03-13 21:51:33,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99506 conditions, 7590 events. 4206/7590 cut-off events. For 258141/258141 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 54241 event pairs, 101 based on Foata normal form. 5/7595 useless extension candidates. Maximal degree in co-relation 99096. Up to 3040 conditions per place. [2025-03-13 21:51:33,348 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 762 selfloop transitions, 1494 changer transitions 26/2283 dead transitions. [2025-03-13 21:51:33,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 833 places, 2283 transitions, 73367 flow [2025-03-13 21:51:33,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2025-03-13 21:51:33,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2025-03-13 21:51:33,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 756 transitions. [2025-03-13 21:51:33,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3673469387755102 [2025-03-13 21:51:33,350 INFO L175 Difference]: Start difference. First operand has 740 places, 1758 transitions, 55794 flow. Second operand 98 states and 756 transitions. [2025-03-13 21:51:33,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 833 places, 2283 transitions, 73367 flow [2025-03-13 21:51:38,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 800 places, 2283 transitions, 72558 flow, removed 116 selfloop flow, removed 33 redundant places. [2025-03-13 21:51:38,787 INFO L231 Difference]: Finished difference. Result has 845 places, 2084 transitions, 72026 flow [2025-03-13 21:51:38,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=55127, PETRI_DIFFERENCE_MINUEND_PLACES=703, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1758, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=98, PETRI_FLOW=72026, PETRI_PLACES=845, PETRI_TRANSITIONS=2084} [2025-03-13 21:51:38,789 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 822 predicate places. [2025-03-13 21:51:38,789 INFO L471 AbstractCegarLoop]: Abstraction has has 845 places, 2084 transitions, 72026 flow [2025-03-13 21:51:38,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:38,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:38,789 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:51:38,794 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-13 21:51:38,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:38,991 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:51:38,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:38,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1310231221, now seen corresponding path program 21 times [2025-03-13 21:51:38,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:38,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279950012] [2025-03-13 21:51:38,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:51:38,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:38,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:51:38,997 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:51:38,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:51:38,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:39,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:39,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279950012] [2025-03-13 21:51:39,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279950012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:51:39,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101771826] [2025-03-13 21:51:39,150 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:51:39,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:39,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:51:39,152 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-13 21:51:39,153 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-13 21:51:39,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:51:39,187 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:51:39,187 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:51:39,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:39,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-13 21:51:39,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:51:39,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:39,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:51:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:39,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101771826] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:51:39,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:51:39,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-13 21:51:39,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959255299] [2025-03-13 21:51:39,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:51:39,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-13 21:51:39,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:39,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-13 21:51:39,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=941, Unknown=0, NotChecked=0, Total=1122 [2025-03-13 21:51:39,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:51:39,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 845 places, 2084 transitions, 72026 flow. Second operand has 34 states, 34 states have (on average 4.676470588235294) internal successors, (159), 34 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:39,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:39,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:51:39,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:44,401 INFO L124 PetriNetUnfolderBase]: 4199/7577 cut-off events. [2025-03-13 21:51:44,401 INFO L125 PetriNetUnfolderBase]: For 311781/311781 co-relation queries the response was YES. [2025-03-13 21:51:44,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106529 conditions, 7577 events. 4199/7577 cut-off events. For 311781/311781 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 54145 event pairs, 132 based on Foata normal form. 2/7579 useless extension candidates. Maximal degree in co-relation 106160. Up to 4135 conditions per place. [2025-03-13 21:51:44,715 INFO L140 encePairwiseOnDemand]: 10/21 looper letters, 783 selfloop transitions, 1410 changer transitions 11/2205 dead transitions. [2025-03-13 21:51:44,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 885 places, 2205 transitions, 77865 flow [2025-03-13 21:51:44,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-13 21:51:44,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-13 21:51:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 363 transitions. [2025-03-13 21:51:44,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38412698412698415 [2025-03-13 21:51:44,716 INFO L175 Difference]: Start difference. First operand has 845 places, 2084 transitions, 72026 flow. Second operand 45 states and 363 transitions. [2025-03-13 21:51:44,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 885 places, 2205 transitions, 77865 flow [2025-03-13 21:51:51,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 847 places, 2205 transitions, 77111 flow, removed 196 selfloop flow, removed 38 redundant places. [2025-03-13 21:51:51,832 INFO L231 Difference]: Finished difference. Result has 855 places, 2097 transitions, 76006 flow [2025-03-13 21:51:51,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=71346, PETRI_DIFFERENCE_MINUEND_PLACES=803, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2084, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1397, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=76006, PETRI_PLACES=855, PETRI_TRANSITIONS=2097} [2025-03-13 21:51:51,834 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 832 predicate places. [2025-03-13 21:51:51,834 INFO L471 AbstractCegarLoop]: Abstraction has has 855 places, 2097 transitions, 76006 flow [2025-03-13 21:51:51,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.676470588235294) internal successors, (159), 34 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:51,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:51,834 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:51:51,839 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-13 21:51:52,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:52,034 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:51:52,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:52,035 INFO L85 PathProgramCache]: Analyzing trace with hash -207551831, now seen corresponding path program 22 times [2025-03-13 21:51:52,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:52,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404056356] [2025-03-13 21:51:52,035 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:51:52,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:52,037 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:51:52,039 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:51:52,039 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:51:52,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:52,161 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-13 21:51:52,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:52,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404056356] [2025-03-13 21:51:52,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404056356] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:51:52,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838228763] [2025-03-13 21:51:52,161 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:51:52,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:52,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:51:52,163 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-13 21:51:52,164 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-13 21:51:52,183 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:51:52,192 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:51:52,192 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:51:52,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:52,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-13 21:51:52,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:51:52,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:52,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:51:52,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:52,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838228763] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:51:52,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:51:52,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-13 21:51:52,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892117541] [2025-03-13 21:51:52,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:51:52,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-13 21:51:52,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:52,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-13 21:51:52,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=960, Unknown=0, NotChecked=0, Total=1122 [2025-03-13 21:51:52,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-13 21:51:52,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 855 places, 2097 transitions, 76006 flow. Second operand has 34 states, 34 states have (on average 4.676470588235294) internal successors, (159), 34 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:52,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:52,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-13 21:51:52,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:03,058 INFO L124 PetriNetUnfolderBase]: 5260/9365 cut-off events. [2025-03-13 21:52:03,059 INFO L125 PetriNetUnfolderBase]: For 452145/452145 co-relation queries the response was YES. [2025-03-13 21:52:03,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139603 conditions, 9365 events. 5260/9365 cut-off events. For 452145/452145 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 68649 event pairs, 85 based on Foata normal form. 89/9454 useless extension candidates. Maximal degree in co-relation 139390. Up to 2717 conditions per place. [2025-03-13 21:52:03,206 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 686 selfloop transitions, 2259 changer transitions 41/2987 dead transitions. [2025-03-13 21:52:03,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1005 places, 2987 transitions, 107543 flow [2025-03-13 21:52:03,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2025-03-13 21:52:03,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2025-03-13 21:52:03,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 1223 transitions. [2025-03-13 21:52:03,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34057365636313003 [2025-03-13 21:52:03,208 INFO L175 Difference]: Start difference. First operand has 855 places, 2097 transitions, 76006 flow. Second operand 171 states and 1223 transitions. [2025-03-13 21:52:03,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1005 places, 2987 transitions, 107543 flow