./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/test-hard1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 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/test-hard1.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 34f393fd72a97393a0a39d407b9330aa7c1c7e210ad76310ea88c9427f882106 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:11:15,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:11:15,289 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:11:15,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:11:15,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:11:15,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:11:15,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:11:15,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:11:15,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:11:15,318 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:11:15,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:11:15,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:11:15,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:11:15,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:11:15,319 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:11:15,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:11:15,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:11:15,320 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:11:15,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:11:15,320 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:11:15,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:11:15,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:11:15,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:11:15,320 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:11:15,320 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:11:15,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:11:15,320 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:11:15,320 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:11:15,321 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:11:15,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:11:15,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:11:15,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:11:15,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:11:15,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:11:15,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:11:15,321 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:11:15,322 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:11:15,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:11:15,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:11:15,322 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:11:15,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:11:15,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:11:15,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:11:15,322 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 -> 34f393fd72a97393a0a39d407b9330aa7c1c7e210ad76310ea88c9427f882106 [2025-03-14 01:11:15,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:11:15,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:11:15,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:11:15,552 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:11:15,553 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:11:15,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-hard1.wvr.c [2025-03-14 01:11:16,721 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b9be0e7/c54f272bc1cf401890a52942a963aa44/FLAGf39402bea [2025-03-14 01:11:16,974 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:11:16,981 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-hard1.wvr.c [2025-03-14 01:11:17,012 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b9be0e7/c54f272bc1cf401890a52942a963aa44/FLAGf39402bea [2025-03-14 01:11:17,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b9be0e7/c54f272bc1cf401890a52942a963aa44 [2025-03-14 01:11:17,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:11:17,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:11:17,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:11:17,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:11:17,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:11:17,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:11:17" (1/1) ... [2025-03-14 01:11:17,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c1b1616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:17, skipping insertion in model container [2025-03-14 01:11:17,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:11:17" (1/1) ... [2025-03-14 01:11:17,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:11:17,443 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/test-hard1.wvr.c[3425,3438] [2025-03-14 01:11:17,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:11:17,456 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:11:17,478 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/test-hard1.wvr.c[3425,3438] [2025-03-14 01:11:17,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:11:17,493 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:11:17,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:17 WrapperNode [2025-03-14 01:11:17,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:11:17,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:11:17,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:11:17,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:11:17,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:17" (1/1) ... [2025-03-14 01:11:17,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:17" (1/1) ... [2025-03-14 01:11:17,520 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2025-03-14 01:11:17,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:11:17,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:11:17,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:11:17,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:11:17,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:17" (1/1) ... [2025-03-14 01:11:17,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:17" (1/1) ... [2025-03-14 01:11:17,534 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:17" (1/1) ... [2025-03-14 01:11:17,547 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-14 01:11:17,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:17" (1/1) ... [2025-03-14 01:11:17,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:17" (1/1) ... [2025-03-14 01:11:17,554 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:17" (1/1) ... [2025-03-14 01:11:17,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:17" (1/1) ... [2025-03-14 01:11:17,559 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:17" (1/1) ... [2025-03-14 01:11:17,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:17" (1/1) ... [2025-03-14 01:11:17,561 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:11:17,565 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:11:17,565 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:11:17,565 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:11:17,566 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:17" (1/1) ... [2025-03-14 01:11:17,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:11:17,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:11:17,591 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-14 01:11:17,593 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-14 01:11:17,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:11:17,607 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:11:17,607 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:11:17,607 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:11:17,607 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:11:17,607 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:11:17,607 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:11:17,607 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-14 01:11:17,607 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-14 01:11:17,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:11:17,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:11:17,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:11:17,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:11:17,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:11:17,609 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:11:17,675 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:11:17,677 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:11:17,874 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:11:17,874 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:11:17,875 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:11:18,036 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:11:18,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:11:18 BoogieIcfgContainer [2025-03-14 01:11:18,037 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:11:18,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:11:18,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:11:18,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:11:18,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:11:17" (1/3) ... [2025-03-14 01:11:18,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54276001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:11:18, skipping insertion in model container [2025-03-14 01:11:18,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:17" (2/3) ... [2025-03-14 01:11:18,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54276001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:11:18, skipping insertion in model container [2025-03-14 01:11:18,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:11:18" (3/3) ... [2025-03-14 01:11:18,049 INFO L128 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2025-03-14 01:11:18,066 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:11:18,067 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-hard1.wvr.c that has 5 procedures, 41 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-14 01:11:18,067 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:11:18,129 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-14 01:11:18,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 44 transitions, 116 flow [2025-03-14 01:11:18,197 INFO L124 PetriNetUnfolderBase]: 4/40 cut-off events. [2025-03-14 01:11:18,201 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:11:18,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 40 events. 4/40 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-03-14 01:11:18,204 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 44 transitions, 116 flow [2025-03-14 01:11:18,207 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 39 transitions, 102 flow [2025-03-14 01:11:18,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:11:18,226 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;@455504e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:11:18,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-14 01:11:18,247 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:11:18,248 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2025-03-14 01:11:18,248 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:11:18,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:18,249 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:18,249 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:11:18,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:18,253 INFO L85 PathProgramCache]: Analyzing trace with hash -546620567, now seen corresponding path program 1 times [2025-03-14 01:11:18,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:18,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133135196] [2025-03-14 01:11:18,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:11:18,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:18,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 01:11:18,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:11:18,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:11:18,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:18,600 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-14 01:11:18,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:18,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133135196] [2025-03-14 01:11:18,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133135196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:11:18,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:11:18,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:11:18,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950586896] [2025-03-14 01:11:18,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:11:18,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:11:18,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:18,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:11:18,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:11:18,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2025-03-14 01:11:18,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-14 01:11:18,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:18,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2025-03-14 01:11:18,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:19,082 INFO L124 PetriNetUnfolderBase]: 3331/4541 cut-off events. [2025-03-14 01:11:19,082 INFO L125 PetriNetUnfolderBase]: For 345/345 co-relation queries the response was YES. [2025-03-14 01:11:19,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9284 conditions, 4541 events. 3331/4541 cut-off events. For 345/345 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 20650 event pairs, 587 based on Foata normal form. 1/4475 useless extension candidates. Maximal degree in co-relation 8234. Up to 3534 conditions per place. [2025-03-14 01:11:19,110 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 47 selfloop transitions, 5 changer transitions 1/62 dead transitions. [2025-03-14 01:11:19,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 62 transitions, 275 flow [2025-03-14 01:11:19,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:11:19,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:11:19,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-03-14 01:11:19,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7045454545454546 [2025-03-14 01:11:19,121 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 102 flow. Second operand 3 states and 93 transitions. [2025-03-14 01:11:19,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 62 transitions, 275 flow [2025-03-14 01:11:19,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 245 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-14 01:11:19,135 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 119 flow [2025-03-14 01:11:19,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2025-03-14 01:11:19,143 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2025-03-14 01:11:19,144 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 119 flow [2025-03-14 01:11:19,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-14 01:11:19,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:19,146 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:19,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:11:19,146 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:11:19,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:19,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1015643843, now seen corresponding path program 1 times [2025-03-14 01:11:19,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:19,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156475656] [2025-03-14 01:11:19,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:11:19,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:19,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 01:11:19,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:11:19,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:11:19,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:19,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:11:19,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:19,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156475656] [2025-03-14 01:11:19,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156475656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:11:19,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:11:19,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:11:19,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992820049] [2025-03-14 01:11:19,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:11:19,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:11:19,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:19,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:11:19,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:11:19,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-03-14 01:11:19,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:11:19,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:19,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-03-14 01:11:19,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:20,232 INFO L124 PetriNetUnfolderBase]: 7323/10064 cut-off events. [2025-03-14 01:11:20,233 INFO L125 PetriNetUnfolderBase]: For 2052/2052 co-relation queries the response was YES. [2025-03-14 01:11:20,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22908 conditions, 10064 events. 7323/10064 cut-off events. For 2052/2052 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 55135 event pairs, 1628 based on Foata normal form. 0/9517 useless extension candidates. Maximal degree in co-relation 6147. Up to 3843 conditions per place. [2025-03-14 01:11:20,291 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 120 selfloop transitions, 17 changer transitions 0/145 dead transitions. [2025-03-14 01:11:20,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 145 transitions, 691 flow [2025-03-14 01:11:20,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:11:20,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:11:20,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2025-03-14 01:11:20,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2025-03-14 01:11:20,293 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 119 flow. Second operand 6 states and 192 transitions. [2025-03-14 01:11:20,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 145 transitions, 691 flow [2025-03-14 01:11:20,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 145 transitions, 672 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:11:20,296 INFO L231 Difference]: Finished difference. Result has 52 places, 59 transitions, 260 flow [2025-03-14 01:11:20,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=260, PETRI_PLACES=52, PETRI_TRANSITIONS=59} [2025-03-14 01:11:20,297 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2025-03-14 01:11:20,297 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 59 transitions, 260 flow [2025-03-14 01:11:20,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:11:20,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:20,297 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:20,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:11:20,298 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:11:20,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:20,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1352787651, now seen corresponding path program 2 times [2025-03-14 01:11:20,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:20,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533549894] [2025-03-14 01:11:20,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:11:20,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:20,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-03-14 01:11:20,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:11:20,316 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:11:20,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:20,594 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-14 01:11:20,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:20,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533549894] [2025-03-14 01:11:20,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533549894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:11:20,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:11:20,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:11:20,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011392734] [2025-03-14 01:11:20,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:11:20,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:11:20,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:20,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:11:20,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:11:20,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-03-14 01:11:20,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 59 transitions, 260 flow. Second operand has 8 states, 8 states have (on average 15.125) internal successors, (121), 8 states have internal predecessors, (121), 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-14 01:11:20,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:20,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-03-14 01:11:20,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:21,870 INFO L124 PetriNetUnfolderBase]: 13441/18620 cut-off events. [2025-03-14 01:11:21,870 INFO L125 PetriNetUnfolderBase]: For 19166/19166 co-relation queries the response was YES. [2025-03-14 01:11:21,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54303 conditions, 18620 events. 13441/18620 cut-off events. For 19166/19166 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 106643 event pairs, 672 based on Foata normal form. 580/19178 useless extension candidates. Maximal degree in co-relation 29825. Up to 8673 conditions per place. [2025-03-14 01:11:21,985 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 187 selfloop transitions, 32 changer transitions 1/228 dead transitions. [2025-03-14 01:11:21,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 228 transitions, 1444 flow [2025-03-14 01:11:21,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:11:21,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:11:21,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 269 transitions. [2025-03-14 01:11:21,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6792929292929293 [2025-03-14 01:11:21,987 INFO L175 Difference]: Start difference. First operand has 52 places, 59 transitions, 260 flow. Second operand 9 states and 269 transitions. [2025-03-14 01:11:21,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 228 transitions, 1444 flow [2025-03-14 01:11:22,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 228 transitions, 1444 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:11:22,056 INFO L231 Difference]: Finished difference. Result has 67 places, 82 transitions, 516 flow [2025-03-14 01:11:22,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=516, PETRI_PLACES=67, PETRI_TRANSITIONS=82} [2025-03-14 01:11:22,056 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2025-03-14 01:11:22,056 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 82 transitions, 516 flow [2025-03-14 01:11:22,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.125) internal successors, (121), 8 states have internal predecessors, (121), 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-14 01:11:22,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:22,056 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:22,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:11:22,057 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:11:22,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:22,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1938885437, now seen corresponding path program 3 times [2025-03-14 01:11:22,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:22,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860986757] [2025-03-14 01:11:22,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:11:22,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:22,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-03-14 01:11:22,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:11:22,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:11:22,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:22,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:11:22,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:22,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860986757] [2025-03-14 01:11:22,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860986757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:11:22,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:11:22,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 01:11:22,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695154209] [2025-03-14 01:11:22,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:11:22,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 01:11:22,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:22,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 01:11:22,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:11:22,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-03-14 01:11:22,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 82 transitions, 516 flow. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 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-14 01:11:22,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:22,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-03-14 01:11:22,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:25,070 INFO L124 PetriNetUnfolderBase]: 24139/34149 cut-off events. [2025-03-14 01:11:25,070 INFO L125 PetriNetUnfolderBase]: For 68557/68594 co-relation queries the response was YES. [2025-03-14 01:11:25,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119625 conditions, 34149 events. 24139/34149 cut-off events. For 68557/68594 co-relation queries the response was YES. Maximal size of possible extension queue 1722. Compared 222370 event pairs, 3604 based on Foata normal form. 372/34506 useless extension candidates. Maximal degree in co-relation 88858. Up to 13681 conditions per place. [2025-03-14 01:11:25,352 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 298 selfloop transitions, 106 changer transitions 0/412 dead transitions. [2025-03-14 01:11:25,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 412 transitions, 3151 flow [2025-03-14 01:11:25,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 01:11:25,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 01:11:25,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 430 transitions. [2025-03-14 01:11:25,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-03-14 01:11:25,357 INFO L175 Difference]: Start difference. First operand has 67 places, 82 transitions, 516 flow. Second operand 15 states and 430 transitions. [2025-03-14 01:11:25,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 412 transitions, 3151 flow [2025-03-14 01:11:25,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 412 transitions, 3020 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-14 01:11:25,816 INFO L231 Difference]: Finished difference. Result has 89 places, 180 transitions, 1600 flow [2025-03-14 01:11:25,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1600, PETRI_PLACES=89, PETRI_TRANSITIONS=180} [2025-03-14 01:11:25,818 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 41 predicate places. [2025-03-14 01:11:25,818 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 180 transitions, 1600 flow [2025-03-14 01:11:25,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 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-14 01:11:25,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:25,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:25,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:11:25,819 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:11:25,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:25,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2132319651, now seen corresponding path program 1 times [2025-03-14 01:11:25,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:25,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042360833] [2025-03-14 01:11:25,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:11:25,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:25,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 01:11:25,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:11:25,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:11:25,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:11:26,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:26,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042360833] [2025-03-14 01:11:26,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042360833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:11:26,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:11:26,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:11:26,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766134627] [2025-03-14 01:11:26,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:11:26,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:11:26,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:26,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:11:26,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:11:26,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-03-14 01:11:26,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 180 transitions, 1600 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:11:26,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:26,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-03-14 01:11:26,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:29,446 INFO L124 PetriNetUnfolderBase]: 30874/43352 cut-off events. [2025-03-14 01:11:29,446 INFO L125 PetriNetUnfolderBase]: For 148842/149139 co-relation queries the response was YES. [2025-03-14 01:11:29,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170289 conditions, 43352 events. 30874/43352 cut-off events. For 148842/149139 co-relation queries the response was YES. Maximal size of possible extension queue 2242. Compared 293492 event pairs, 7549 based on Foata normal form. 348/43251 useless extension candidates. Maximal degree in co-relation 141482. Up to 18004 conditions per place. [2025-03-14 01:11:29,939 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 225 selfloop transitions, 70 changer transitions 0/304 dead transitions. [2025-03-14 01:11:29,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 304 transitions, 3026 flow [2025-03-14 01:11:29,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:11:29,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:11:29,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2025-03-14 01:11:29,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7181818181818181 [2025-03-14 01:11:29,940 INFO L175 Difference]: Start difference. First operand has 89 places, 180 transitions, 1600 flow. Second operand 5 states and 158 transitions. [2025-03-14 01:11:29,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 304 transitions, 3026 flow [2025-03-14 01:11:31,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 304 transitions, 2938 flow, removed 44 selfloop flow, removed 0 redundant places. [2025-03-14 01:11:31,067 INFO L231 Difference]: Finished difference. Result has 96 places, 184 transitions, 1839 flow [2025-03-14 01:11:31,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1570, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1839, PETRI_PLACES=96, PETRI_TRANSITIONS=184} [2025-03-14 01:11:31,068 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 48 predicate places. [2025-03-14 01:11:31,068 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 184 transitions, 1839 flow [2025-03-14 01:11:31,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:11:31,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:31,069 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:31,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:11:31,069 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:11:31,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:31,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1331042407, now seen corresponding path program 4 times [2025-03-14 01:11:31,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:31,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937431368] [2025-03-14 01:11:31,070 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:11:31,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:31,075 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-14 01:11:31,084 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:11:31,084 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:11:31,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:31,268 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-14 01:11:31,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:31,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937431368] [2025-03-14 01:11:31,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937431368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:11:31,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:11:31,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:11:31,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933852176] [2025-03-14 01:11:31,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:11:31,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:11:31,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:31,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:11:31,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:11:31,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-03-14 01:11:31,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 184 transitions, 1839 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 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-14 01:11:31,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:31,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-03-14 01:11:31,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:36,552 INFO L124 PetriNetUnfolderBase]: 44724/64292 cut-off events. [2025-03-14 01:11:36,553 INFO L125 PetriNetUnfolderBase]: For 306296/306376 co-relation queries the response was YES. [2025-03-14 01:11:36,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280102 conditions, 64292 events. 44724/64292 cut-off events. For 306296/306376 co-relation queries the response was YES. Maximal size of possible extension queue 3214. Compared 462289 event pairs, 4235 based on Foata normal form. 1972/66195 useless extension candidates. Maximal degree in co-relation 229385. Up to 24315 conditions per place. [2025-03-14 01:11:37,076 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 348 selfloop transitions, 196 changer transitions 0/552 dead transitions. [2025-03-14 01:11:37,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 552 transitions, 6282 flow [2025-03-14 01:11:37,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:11:37,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:11:37,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 289 transitions. [2025-03-14 01:11:37,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7297979797979798 [2025-03-14 01:11:37,077 INFO L175 Difference]: Start difference. First operand has 96 places, 184 transitions, 1839 flow. Second operand 9 states and 289 transitions. [2025-03-14 01:11:37,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 552 transitions, 6282 flow [2025-03-14 01:11:38,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 552 transitions, 6151 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:11:38,874 INFO L231 Difference]: Finished difference. Result has 110 places, 306 transitions, 3920 flow [2025-03-14 01:11:38,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1785, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3920, PETRI_PLACES=110, PETRI_TRANSITIONS=306} [2025-03-14 01:11:38,875 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 62 predicate places. [2025-03-14 01:11:38,876 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 306 transitions, 3920 flow [2025-03-14 01:11:38,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 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-14 01:11:38,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:38,876 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:38,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:11:38,877 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:11:38,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:38,877 INFO L85 PathProgramCache]: Analyzing trace with hash -121401519, now seen corresponding path program 2 times [2025-03-14 01:11:38,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:38,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703915581] [2025-03-14 01:11:38,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:11:38,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:38,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-03-14 01:11:38,892 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:11:38,892 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:11:38,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:39,012 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-14 01:11:39,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:39,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703915581] [2025-03-14 01:11:39,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703915581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:11:39,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:11:39,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:11:39,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199504035] [2025-03-14 01:11:39,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:11:39,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:11:39,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:39,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:11:39,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:11:39,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-03-14 01:11:39,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 306 transitions, 3920 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:11:39,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:39,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-03-14 01:11:39,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:48,436 INFO L124 PetriNetUnfolderBase]: 70524/98761 cut-off events. [2025-03-14 01:11:48,436 INFO L125 PetriNetUnfolderBase]: For 691868/693031 co-relation queries the response was YES. [2025-03-14 01:11:49,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504267 conditions, 98761 events. 70524/98761 cut-off events. For 691868/693031 co-relation queries the response was YES. Maximal size of possible extension queue 5042. Compared 726621 event pairs, 15226 based on Foata normal form. 659/98248 useless extension candidates. Maximal degree in co-relation 413644. Up to 41199 conditions per place. [2025-03-14 01:11:49,643 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 449 selfloop transitions, 194 changer transitions 0/653 dead transitions. [2025-03-14 01:11:49,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 653 transitions, 9476 flow [2025-03-14 01:11:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:11:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:11:49,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2025-03-14 01:11:49,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2025-03-14 01:11:49,644 INFO L175 Difference]: Start difference. First operand has 110 places, 306 transitions, 3920 flow. Second operand 5 states and 150 transitions. [2025-03-14 01:11:49,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 653 transitions, 9476 flow [2025-03-14 01:11:57,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 653 transitions, 9458 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-14 01:11:57,098 INFO L231 Difference]: Finished difference. Result has 117 places, 404 transitions, 6202 flow [2025-03-14 01:11:57,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3914, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6202, PETRI_PLACES=117, PETRI_TRANSITIONS=404} [2025-03-14 01:11:57,099 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 69 predicate places. [2025-03-14 01:11:57,099 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 404 transitions, 6202 flow [2025-03-14 01:11:57,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:11:57,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:57,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:57,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:11:57,100 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:11:57,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:57,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2055570803, now seen corresponding path program 5 times [2025-03-14 01:11:57,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:57,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931799876] [2025-03-14 01:11:57,100 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:11:57,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:57,106 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-03-14 01:11:57,112 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:11:57,112 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:11:57,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:57,385 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-14 01:11:57,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:57,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931799876] [2025-03-14 01:11:57,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931799876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:11:57,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:11:57,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:11:57,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654649905] [2025-03-14 01:11:57,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:11:57,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:11:57,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:57,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:11:57,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:11:57,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2025-03-14 01:11:57,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 404 transitions, 6202 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:11:57,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:57,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2025-03-14 01:11:57,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand