./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-word-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-word-subst.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:40:08,752 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:40:08,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:40:08,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:40:08,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:40:08,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:40:08,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:40:08,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:40:08,862 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:40:08,863 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:40:08,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:40:08,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:40:08,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:40:08,864 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:40:08,864 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:40:08,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:40:08,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:40:08,865 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:40:08,865 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:40:08,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:40:08,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:40:08,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:40:08,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:40:08,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:40:08,866 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:40:08,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:40:08,866 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:40:08,866 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:40:08,866 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:40:08,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:40:08,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:40:08,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:40:08,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:40:08,867 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:40:08,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:40:08,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:40:08,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:40:08,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:40:08,868 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:40:08,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:40:08,868 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:40:08,868 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:40:08,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:40:08,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:40:08,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:40:08,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:40:08,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:40:08,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:40:08,869 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-jdk21/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 -> 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 [2025-01-09 16:40:09,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:40:09,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:40:09,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:40:09,168 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:40:09,168 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:40:09,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2025-01-09 16:40:10,402 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69517148a/f50a9be0bc6f456db33acb47bc62c43a/FLAGc36363931 [2025-01-09 16:40:10,671 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:40:10,671 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2025-01-09 16:40:10,683 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69517148a/f50a9be0bc6f456db33acb47bc62c43a/FLAGc36363931 [2025-01-09 16:40:10,975 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69517148a/f50a9be0bc6f456db33acb47bc62c43a [2025-01-09 16:40:10,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:40:10,978 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:40:10,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:40:10,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:40:10,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:40:10,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:40:10" (1/1) ... [2025-01-09 16:40:10,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474ef4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:10, skipping insertion in model container [2025-01-09 16:40:10,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:40:10" (1/1) ... [2025-01-09 16:40:10,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:40:11,179 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-subst.wvr.c[3384,3397] [2025-01-09 16:40:11,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:40:11,207 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:40:11,243 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-subst.wvr.c[3384,3397] [2025-01-09 16:40:11,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:40:11,266 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:40:11,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11 WrapperNode [2025-01-09 16:40:11,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:40:11,267 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:40:11,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:40:11,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:40:11,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,287 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,312 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 160 [2025-01-09 16:40:11,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:40:11,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:40:11,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:40:11,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:40:11,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,356 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-01-09 16:40:11,361 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,361 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,368 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:40:11,386 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:40:11,386 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:40:11,386 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:40:11,388 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:40:11,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:40:11,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:40:11,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:40:11,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:40:11,437 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:40:11,437 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:40:11,437 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:40:11,437 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:40:11,437 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:40:11,437 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:40:11,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:40:11,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:40:11,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:40:11,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:40:11,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:40:11,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:40:11,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:40:11,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:40:11,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:40:11,439 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:40:11,534 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:40:11,536 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:40:12,014 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:40:12,015 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:40:12,302 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:40:12,304 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:40:12,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:40:12 BoogieIcfgContainer [2025-01-09 16:40:12,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:40:12,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:40:12,308 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:40:12,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:40:12,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:40:10" (1/3) ... [2025-01-09 16:40:12,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2e2a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:40:12, skipping insertion in model container [2025-01-09 16:40:12,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (2/3) ... [2025-01-09 16:40:12,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2e2a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:40:12, skipping insertion in model container [2025-01-09 16:40:12,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:40:12" (3/3) ... [2025-01-09 16:40:12,316 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-subst.wvr.c [2025-01-09 16:40:12,348 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:40:12,350 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-subst.wvr.c that has 4 procedures, 38 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-09 16:40:12,350 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:40:12,414 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:40:12,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 49 transitions, 119 flow [2025-01-09 16:40:12,492 INFO L124 PetriNetUnfolderBase]: 12/46 cut-off events. [2025-01-09 16:40:12,495 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:40:12,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 12/46 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 81 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-01-09 16:40:12,499 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 49 transitions, 119 flow [2025-01-09 16:40:12,503 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 45 transitions, 108 flow [2025-01-09 16:40:12,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:40:12,530 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;@5c75281e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:40:12,531 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:40:12,551 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:40:12,551 INFO L124 PetriNetUnfolderBase]: 12/44 cut-off events. [2025-01-09 16:40:12,551 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:40:12,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:12,552 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:40:12,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:12,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:12,558 INFO L85 PathProgramCache]: Analyzing trace with hash -2024767313, now seen corresponding path program 1 times [2025-01-09 16:40:12,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:12,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003076998] [2025-01-09 16:40:12,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:40:12,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:12,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:40:12,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:40:12,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:40:12,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:13,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:13,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003076998] [2025-01-09 16:40:13,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003076998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:13,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:13,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:40:13,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955805619] [2025-01-09 16:40:13,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:13,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:40:13,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:13,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:40:13,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:40:13,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:13,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 45 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:13,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:13,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:13,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:13,763 INFO L124 PetriNetUnfolderBase]: 3125/4273 cut-off events. [2025-01-09 16:40:13,765 INFO L125 PetriNetUnfolderBase]: For 262/262 co-relation queries the response was YES. [2025-01-09 16:40:13,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8705 conditions, 4273 events. 3125/4273 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 18237 event pairs, 1260 based on Foata normal form. 1/3471 useless extension candidates. Maximal degree in co-relation 7815. Up to 2675 conditions per place. [2025-01-09 16:40:13,797 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 60 selfloop transitions, 2 changer transitions 5/71 dead transitions. [2025-01-09 16:40:13,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 71 transitions, 309 flow [2025-01-09 16:40:13,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:40:13,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:40:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-01-09 16:40:13,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6054421768707483 [2025-01-09 16:40:13,814 INFO L175 Difference]: Start difference. First operand has 43 places, 45 transitions, 108 flow. Second operand 3 states and 89 transitions. [2025-01-09 16:40:13,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 71 transitions, 309 flow [2025-01-09 16:40:13,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 71 transitions, 287 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:40:13,831 INFO L231 Difference]: Finished difference. Result has 40 places, 45 transitions, 106 flow [2025-01-09 16:40:13,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=40, PETRI_TRANSITIONS=45} [2025-01-09 16:40:13,837 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2025-01-09 16:40:13,838 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 45 transitions, 106 flow [2025-01-09 16:40:13,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:13,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:13,840 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] [2025-01-09 16:40:13,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:40:13,841 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:13,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:13,841 INFO L85 PathProgramCache]: Analyzing trace with hash -418206818, now seen corresponding path program 1 times [2025-01-09 16:40:13,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:13,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116214797] [2025-01-09 16:40:13,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:40:13,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:13,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:40:13,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:40:13,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:40:13,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:14,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:14,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:14,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116214797] [2025-01-09 16:40:14,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116214797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:14,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:14,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:14,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393319804] [2025-01-09 16:40:14,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:14,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:14,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:14,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:14,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:14,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:14,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 45 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:14,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:14,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:14,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:15,329 INFO L124 PetriNetUnfolderBase]: 3005/4196 cut-off events. [2025-01-09 16:40:15,329 INFO L125 PetriNetUnfolderBase]: For 499/499 co-relation queries the response was YES. [2025-01-09 16:40:15,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8948 conditions, 4196 events. 3005/4196 cut-off events. For 499/499 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18990 event pairs, 385 based on Foata normal form. 1/3698 useless extension candidates. Maximal degree in co-relation 7022. Up to 2564 conditions per place. [2025-01-09 16:40:15,359 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 81 selfloop transitions, 2 changer transitions 13/100 dead transitions. [2025-01-09 16:40:15,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 100 transitions, 435 flow [2025-01-09 16:40:15,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:15,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:15,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-01-09 16:40:15,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5265306122448979 [2025-01-09 16:40:15,362 INFO L175 Difference]: Start difference. First operand has 40 places, 45 transitions, 106 flow. Second operand 5 states and 129 transitions. [2025-01-09 16:40:15,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 100 transitions, 435 flow [2025-01-09 16:40:15,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 100 transitions, 425 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 16:40:15,390 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 117 flow [2025-01-09 16:40:15,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2025-01-09 16:40:15,393 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2025-01-09 16:40:15,393 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 117 flow [2025-01-09 16:40:15,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:15,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:15,393 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] [2025-01-09 16:40:15,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:40:15,393 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:15,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:15,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1159704946, now seen corresponding path program 2 times [2025-01-09 16:40:15,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:15,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567234557] [2025-01-09 16:40:15,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:40:15,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:15,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:40:15,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:40:15,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:40:15,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:15,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:15,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:15,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567234557] [2025-01-09 16:40:15,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567234557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:15,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:15,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:15,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103689846] [2025-01-09 16:40:15,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:15,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:15,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:15,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:15,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:15,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:15,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:15,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:15,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:15,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:16,528 INFO L124 PetriNetUnfolderBase]: 3437/4880 cut-off events. [2025-01-09 16:40:16,528 INFO L125 PetriNetUnfolderBase]: For 1221/1221 co-relation queries the response was YES. [2025-01-09 16:40:16,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10719 conditions, 4880 events. 3437/4880 cut-off events. For 1221/1221 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 23057 event pairs, 1590 based on Foata normal form. 1/4583 useless extension candidates. Maximal degree in co-relation 10696. Up to 2986 conditions per place. [2025-01-09 16:40:16,554 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 76 selfloop transitions, 3 changer transitions 14/97 dead transitions. [2025-01-09 16:40:16,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 97 transitions, 445 flow [2025-01-09 16:40:16,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:16,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:16,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2025-01-09 16:40:16,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5061224489795918 [2025-01-09 16:40:16,556 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 117 flow. Second operand 5 states and 124 transitions. [2025-01-09 16:40:16,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 97 transitions, 445 flow [2025-01-09 16:40:16,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 97 transitions, 436 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-09 16:40:16,566 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 134 flow [2025-01-09 16:40:16,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2025-01-09 16:40:16,567 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2025-01-09 16:40:16,567 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 134 flow [2025-01-09 16:40:16,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:16,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:16,568 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] [2025-01-09 16:40:16,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:40:16,568 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:16,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:16,569 INFO L85 PathProgramCache]: Analyzing trace with hash 411505202, now seen corresponding path program 3 times [2025-01-09 16:40:16,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:16,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110449555] [2025-01-09 16:40:16,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:40:16,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:16,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:40:16,604 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:40:16,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:40:16,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:16,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:16,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110449555] [2025-01-09 16:40:16,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110449555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:16,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:16,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:16,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827620500] [2025-01-09 16:40:16,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:16,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:16,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:16,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:16,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:16,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:16,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:16,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:16,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:16,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:17,579 INFO L124 PetriNetUnfolderBase]: 3985/5676 cut-off events. [2025-01-09 16:40:17,580 INFO L125 PetriNetUnfolderBase]: For 2378/2378 co-relation queries the response was YES. [2025-01-09 16:40:17,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12883 conditions, 5676 events. 3985/5676 cut-off events. For 2378/2378 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 28654 event pairs, 685 based on Foata normal form. 1/5369 useless extension candidates. Maximal degree in co-relation 12854. Up to 3753 conditions per place. [2025-01-09 16:40:17,618 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 79 selfloop transitions, 3 changer transitions 14/100 dead transitions. [2025-01-09 16:40:17,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 100 transitions, 471 flow [2025-01-09 16:40:17,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:17,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:17,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-01-09 16:40:17,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2025-01-09 16:40:17,620 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 134 flow. Second operand 5 states and 127 transitions. [2025-01-09 16:40:17,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 100 transitions, 471 flow [2025-01-09 16:40:17,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 100 transitions, 460 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-01-09 16:40:17,637 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 149 flow [2025-01-09 16:40:17,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2025-01-09 16:40:17,638 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2025-01-09 16:40:17,638 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 149 flow [2025-01-09 16:40:17,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:17,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:17,638 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] [2025-01-09 16:40:17,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:40:17,639 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:17,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:17,639 INFO L85 PathProgramCache]: Analyzing trace with hash 12807634, now seen corresponding path program 4 times [2025-01-09 16:40:17,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:17,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936969354] [2025-01-09 16:40:17,640 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:40:17,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:17,649 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:40:17,656 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 22 of 26 statements. [2025-01-09 16:40:17,656 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:40:17,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:18,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:18,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936969354] [2025-01-09 16:40:18,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936969354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:18,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:18,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:18,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824242697] [2025-01-09 16:40:18,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:18,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:18,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:18,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:18,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:18,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:18,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:18,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:18,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:18,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:18,719 INFO L124 PetriNetUnfolderBase]: 4636/6588 cut-off events. [2025-01-09 16:40:18,719 INFO L125 PetriNetUnfolderBase]: For 4384/4384 co-relation queries the response was YES. [2025-01-09 16:40:18,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15385 conditions, 6588 events. 4636/6588 cut-off events. For 4384/4384 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 32889 event pairs, 925 based on Foata normal form. 1/6239 useless extension candidates. Maximal degree in co-relation 15346. Up to 3623 conditions per place. [2025-01-09 16:40:18,753 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 94 selfloop transitions, 13 changer transitions 15/126 dead transitions. [2025-01-09 16:40:18,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 126 transitions, 643 flow [2025-01-09 16:40:18,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:40:18,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:40:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2025-01-09 16:40:18,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-01-09 16:40:18,755 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 149 flow. Second operand 6 states and 154 transitions. [2025-01-09 16:40:18,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 126 transitions, 643 flow [2025-01-09 16:40:18,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 126 transitions, 624 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-01-09 16:40:18,767 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 251 flow [2025-01-09 16:40:18,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=251, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2025-01-09 16:40:18,767 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2025-01-09 16:40:18,768 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 251 flow [2025-01-09 16:40:18,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:18,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:18,768 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] [2025-01-09 16:40:18,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:40:18,768 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:18,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:18,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1253324204, now seen corresponding path program 5 times [2025-01-09 16:40:18,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:18,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923784749] [2025-01-09 16:40:18,769 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:40:18,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:18,778 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:40:18,805 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:40:18,805 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:40:18,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:19,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:19,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923784749] [2025-01-09 16:40:19,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923784749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:19,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:19,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:19,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254638250] [2025-01-09 16:40:19,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:19,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:19,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:19,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:19,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:19,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:19,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:19,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:19,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:19,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:19,883 INFO L124 PetriNetUnfolderBase]: 4493/6372 cut-off events. [2025-01-09 16:40:19,884 INFO L125 PetriNetUnfolderBase]: For 5641/5697 co-relation queries the response was YES. [2025-01-09 16:40:19,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16559 conditions, 6372 events. 4493/6372 cut-off events. For 5641/5697 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 31673 event pairs, 2274 based on Foata normal form. 29/6382 useless extension candidates. Maximal degree in co-relation 16522. Up to 4484 conditions per place. [2025-01-09 16:40:19,923 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 90 selfloop transitions, 6 changer transitions 13/113 dead transitions. [2025-01-09 16:40:19,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 113 transitions, 628 flow [2025-01-09 16:40:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:19,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:19,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-01-09 16:40:19,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2025-01-09 16:40:19,925 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 251 flow. Second operand 5 states and 130 transitions. [2025-01-09 16:40:19,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 113 transitions, 628 flow [2025-01-09 16:40:19,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 113 transitions, 609 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-01-09 16:40:19,949 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 252 flow [2025-01-09 16:40:19,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=252, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2025-01-09 16:40:19,950 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2025-01-09 16:40:19,950 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 252 flow [2025-01-09 16:40:19,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:19,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:19,950 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] [2025-01-09 16:40:19,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:40:19,950 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:19,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:19,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1668077392, now seen corresponding path program 6 times [2025-01-09 16:40:19,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:19,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231717751] [2025-01-09 16:40:19,951 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:40:19,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:19,960 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:40:19,984 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:40:19,984 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:40:19,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:20,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:20,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231717751] [2025-01-09 16:40:20,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231717751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:20,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:20,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:20,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190983680] [2025-01-09 16:40:20,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:20,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:20,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:20,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:20,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:20,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:20,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:20,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:20,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:20,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:21,138 INFO L124 PetriNetUnfolderBase]: 4265/6095 cut-off events. [2025-01-09 16:40:21,138 INFO L125 PetriNetUnfolderBase]: For 5707/5735 co-relation queries the response was YES. [2025-01-09 16:40:21,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15694 conditions, 6095 events. 4265/6095 cut-off events. For 5707/5735 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 30121 event pairs, 2220 based on Foata normal form. 1/6077 useless extension candidates. Maximal degree in co-relation 15660. Up to 4455 conditions per place. [2025-01-09 16:40:21,166 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 87 selfloop transitions, 5 changer transitions 13/109 dead transitions. [2025-01-09 16:40:21,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 109 transitions, 611 flow [2025-01-09 16:40:21,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:21,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:21,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-01-09 16:40:21,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2025-01-09 16:40:21,168 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 252 flow. Second operand 5 states and 126 transitions. [2025-01-09 16:40:21,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 109 transitions, 611 flow [2025-01-09 16:40:21,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 109 transitions, 597 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-01-09 16:40:21,186 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 255 flow [2025-01-09 16:40:21,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=255, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2025-01-09 16:40:21,188 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2025-01-09 16:40:21,189 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 255 flow [2025-01-09 16:40:21,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:21,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:21,189 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] [2025-01-09 16:40:21,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:40:21,190 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:21,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:21,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1631924548, now seen corresponding path program 1 times [2025-01-09 16:40:21,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:21,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821648833] [2025-01-09 16:40:21,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:40:21,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:21,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:40:21,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:40:21,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:40:21,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:21,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:21,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821648833] [2025-01-09 16:40:21,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821648833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:21,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:21,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:40:21,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641316923] [2025-01-09 16:40:21,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:21,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:40:21,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:21,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:40:21,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:40:21,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:21,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:21,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:21,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:21,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:21,824 INFO L124 PetriNetUnfolderBase]: 4981/7222 cut-off events. [2025-01-09 16:40:21,825 INFO L125 PetriNetUnfolderBase]: For 7254/7254 co-relation queries the response was YES. [2025-01-09 16:40:21,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18314 conditions, 7222 events. 4981/7222 cut-off events. For 7254/7254 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 38562 event pairs, 425 based on Foata normal form. 56/7271 useless extension candidates. Maximal degree in co-relation 18272. Up to 4169 conditions per place. [2025-01-09 16:40:21,865 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 94 selfloop transitions, 6 changer transitions 0/104 dead transitions. [2025-01-09 16:40:21,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 104 transitions, 617 flow [2025-01-09 16:40:21,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:40:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:40:21,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-01-09 16:40:21,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5663265306122449 [2025-01-09 16:40:21,866 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 255 flow. Second operand 4 states and 111 transitions. [2025-01-09 16:40:21,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 104 transitions, 617 flow [2025-01-09 16:40:21,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 104 transitions, 605 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-01-09 16:40:21,892 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 306 flow [2025-01-09 16:40:21,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=306, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2025-01-09 16:40:21,892 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2025-01-09 16:40:21,892 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 306 flow [2025-01-09 16:40:21,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:21,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:21,893 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] [2025-01-09 16:40:21,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:40:21,893 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:21,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:21,894 INFO L85 PathProgramCache]: Analyzing trace with hash 525689494, now seen corresponding path program 2 times [2025-01-09 16:40:21,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:21,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895021166] [2025-01-09 16:40:21,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:40:21,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:21,903 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:40:21,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:40:21,910 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:40:21,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:21,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:21,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895021166] [2025-01-09 16:40:21,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895021166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:21,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:21,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:40:21,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312676280] [2025-01-09 16:40:21,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:21,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:40:21,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:21,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:40:21,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:40:21,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:21,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:21,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:21,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:21,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:22,479 INFO L124 PetriNetUnfolderBase]: 4651/6767 cut-off events. [2025-01-09 16:40:22,480 INFO L125 PetriNetUnfolderBase]: For 6873/6873 co-relation queries the response was YES. [2025-01-09 16:40:22,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17829 conditions, 6767 events. 4651/6767 cut-off events. For 6873/6873 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 35644 event pairs, 564 based on Foata normal form. 56/6819 useless extension candidates. Maximal degree in co-relation 13882. Up to 3906 conditions per place. [2025-01-09 16:40:22,511 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 96 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2025-01-09 16:40:22,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 108 transitions, 683 flow [2025-01-09 16:40:22,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:40:22,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:40:22,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-01-09 16:40:22,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5663265306122449 [2025-01-09 16:40:22,513 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 306 flow. Second operand 4 states and 111 transitions. [2025-01-09 16:40:22,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 108 transitions, 683 flow [2025-01-09 16:40:22,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 108 transitions, 683 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:40:22,529 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 377 flow [2025-01-09 16:40:22,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=377, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2025-01-09 16:40:22,530 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2025-01-09 16:40:22,530 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 377 flow [2025-01-09 16:40:22,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:22,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:22,530 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] [2025-01-09 16:40:22,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:40:22,530 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:22,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:22,531 INFO L85 PathProgramCache]: Analyzing trace with hash 535004624, now seen corresponding path program 3 times [2025-01-09 16:40:22,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:22,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941564708] [2025-01-09 16:40:22,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:40:22,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:22,539 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:40:22,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:40:22,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:40:22,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:22,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:22,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941564708] [2025-01-09 16:40:22,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941564708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:22,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:22,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:40:22,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760255719] [2025-01-09 16:40:22,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:22,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:40:22,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:22,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:40:22,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:40:22,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:22,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 377 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:22,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:22,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:22,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:23,148 INFO L124 PetriNetUnfolderBase]: 4488/6493 cut-off events. [2025-01-09 16:40:23,149 INFO L125 PetriNetUnfolderBase]: For 8665/8685 co-relation queries the response was YES. [2025-01-09 16:40:23,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18025 conditions, 6493 events. 4488/6493 cut-off events. For 8665/8685 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 33783 event pairs, 961 based on Foata normal form. 42/6528 useless extension candidates. Maximal degree in co-relation 14672. Up to 4295 conditions per place. [2025-01-09 16:40:23,188 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 94 selfloop transitions, 13 changer transitions 2/113 dead transitions. [2025-01-09 16:40:23,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 113 transitions, 741 flow [2025-01-09 16:40:23,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:23,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:23,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-01-09 16:40:23,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2025-01-09 16:40:23,190 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 377 flow. Second operand 5 states and 126 transitions. [2025-01-09 16:40:23,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 113 transitions, 741 flow [2025-01-09 16:40:23,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 113 transitions, 739 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-09 16:40:23,214 INFO L231 Difference]: Finished difference. Result has 75 places, 67 transitions, 415 flow [2025-01-09 16:40:23,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=415, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2025-01-09 16:40:23,216 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2025-01-09 16:40:23,217 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 415 flow [2025-01-09 16:40:23,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:23,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:23,217 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] [2025-01-09 16:40:23,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:40:23,217 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:23,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:23,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1354992306, now seen corresponding path program 1 times [2025-01-09 16:40:23,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:23,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807010123] [2025-01-09 16:40:23,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:40:23,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:23,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:40:23,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:40:23,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:40:23,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:23,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:23,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807010123] [2025-01-09 16:40:23,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807010123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:23,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:23,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:40:23,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068096705] [2025-01-09 16:40:23,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:23,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:40:23,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:23,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:40:23,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:40:23,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:23,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 415 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:23,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:23,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:23,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:23,967 INFO L124 PetriNetUnfolderBase]: 5162/7501 cut-off events. [2025-01-09 16:40:23,967 INFO L125 PetriNetUnfolderBase]: For 11328/11328 co-relation queries the response was YES. [2025-01-09 16:40:24,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20505 conditions, 7501 events. 5162/7501 cut-off events. For 11328/11328 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 40474 event pairs, 803 based on Foata normal form. 55/7553 useless extension candidates. Maximal degree in co-relation 17636. Up to 4825 conditions per place. [2025-01-09 16:40:24,031 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 96 selfloop transitions, 10 changer transitions 0/110 dead transitions. [2025-01-09 16:40:24,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 110 transitions, 771 flow [2025-01-09 16:40:24,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:40:24,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:40:24,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-01-09 16:40:24,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5612244897959183 [2025-01-09 16:40:24,033 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 415 flow. Second operand 4 states and 110 transitions. [2025-01-09 16:40:24,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 110 transitions, 771 flow [2025-01-09 16:40:24,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 110 transitions, 734 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-09 16:40:24,077 INFO L231 Difference]: Finished difference. Result has 75 places, 70 transitions, 442 flow [2025-01-09 16:40:24,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=442, PETRI_PLACES=75, PETRI_TRANSITIONS=70} [2025-01-09 16:40:24,078 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2025-01-09 16:40:24,078 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 70 transitions, 442 flow [2025-01-09 16:40:24,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:24,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:24,079 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] [2025-01-09 16:40:24,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:40:24,079 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:24,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:24,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1413520046, now seen corresponding path program 2 times [2025-01-09 16:40:24,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:24,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645136654] [2025-01-09 16:40:24,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:40:24,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:24,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:40:24,096 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:40:24,096 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:40:24,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:24,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:24,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645136654] [2025-01-09 16:40:24,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645136654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:24,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:24,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:40:24,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608036508] [2025-01-09 16:40:24,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:24,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:40:24,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:24,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:40:24,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:40:24,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:24,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 70 transitions, 442 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:24,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:24,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:24,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:24,731 INFO L124 PetriNetUnfolderBase]: 4946/7165 cut-off events. [2025-01-09 16:40:24,732 INFO L125 PetriNetUnfolderBase]: For 9361/9361 co-relation queries the response was YES. [2025-01-09 16:40:24,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20156 conditions, 7165 events. 4946/7165 cut-off events. For 9361/9361 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 38141 event pairs, 1204 based on Foata normal form. 23/7185 useless extension candidates. Maximal degree in co-relation 17163. Up to 4849 conditions per place. [2025-01-09 16:40:24,782 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 99 selfloop transitions, 13 changer transitions 3/119 dead transitions. [2025-01-09 16:40:24,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 119 transitions, 828 flow [2025-01-09 16:40:24,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:24,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:24,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-01-09 16:40:24,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2025-01-09 16:40:24,784 INFO L175 Difference]: Start difference. First operand has 75 places, 70 transitions, 442 flow. Second operand 5 states and 128 transitions. [2025-01-09 16:40:24,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 119 transitions, 828 flow [2025-01-09 16:40:24,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 119 transitions, 810 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-01-09 16:40:24,814 INFO L231 Difference]: Finished difference. Result has 79 places, 72 transitions, 481 flow [2025-01-09 16:40:24,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=481, PETRI_PLACES=79, PETRI_TRANSITIONS=72} [2025-01-09 16:40:24,817 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2025-01-09 16:40:24,817 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 481 flow [2025-01-09 16:40:24,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:24,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:24,818 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] [2025-01-09 16:40:24,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:40:24,820 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:24,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:24,820 INFO L85 PathProgramCache]: Analyzing trace with hash -2099437188, now seen corresponding path program 3 times [2025-01-09 16:40:24,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:24,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353242083] [2025-01-09 16:40:24,821 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:40:24,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:24,829 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:40:24,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:40:24,836 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:40:24,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:24,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:24,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:24,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353242083] [2025-01-09 16:40:24,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353242083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:24,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:24,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:40:24,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571900535] [2025-01-09 16:40:24,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:24,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:40:24,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:24,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:40:24,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:40:24,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:24,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 72 transitions, 481 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:24,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:24,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:24,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:25,423 INFO L124 PetriNetUnfolderBase]: 4472/6424 cut-off events. [2025-01-09 16:40:25,424 INFO L125 PetriNetUnfolderBase]: For 10684/10684 co-relation queries the response was YES. [2025-01-09 16:40:25,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18394 conditions, 6424 events. 4472/6424 cut-off events. For 10684/10684 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 32847 event pairs, 1944 based on Foata normal form. 45/6461 useless extension candidates. Maximal degree in co-relation 16277. Up to 4110 conditions per place. [2025-01-09 16:40:25,458 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 107 selfloop transitions, 10 changer transitions 6/127 dead transitions. [2025-01-09 16:40:25,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 127 transitions, 873 flow [2025-01-09 16:40:25,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:25,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:25,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2025-01-09 16:40:25,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5469387755102041 [2025-01-09 16:40:25,461 INFO L175 Difference]: Start difference. First operand has 79 places, 72 transitions, 481 flow. Second operand 5 states and 134 transitions. [2025-01-09 16:40:25,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 127 transitions, 873 flow [2025-01-09 16:40:25,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 127 transitions, 861 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 16:40:25,490 INFO L231 Difference]: Finished difference. Result has 83 places, 70 transitions, 458 flow [2025-01-09 16:40:25,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=458, PETRI_PLACES=83, PETRI_TRANSITIONS=70} [2025-01-09 16:40:25,491 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 40 predicate places. [2025-01-09 16:40:25,491 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 70 transitions, 458 flow [2025-01-09 16:40:25,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:25,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:25,492 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] [2025-01-09 16:40:25,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:40:25,492 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:25,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:25,494 INFO L85 PathProgramCache]: Analyzing trace with hash -807623278, now seen corresponding path program 4 times [2025-01-09 16:40:25,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:25,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717594152] [2025-01-09 16:40:25,494 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:40:25,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:25,502 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:40:25,506 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 28 statements. [2025-01-09 16:40:25,506 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:40:25,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:25,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:25,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:25,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717594152] [2025-01-09 16:40:25,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717594152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:25,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:25,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:40:25,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12262783] [2025-01-09 16:40:25,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:25,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:40:25,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:25,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:40:25,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:40:25,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:25,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 70 transitions, 458 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:25,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:25,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:25,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:25,937 INFO L124 PetriNetUnfolderBase]: 3952/5696 cut-off events. [2025-01-09 16:40:25,938 INFO L125 PetriNetUnfolderBase]: For 10714/10714 co-relation queries the response was YES. [2025-01-09 16:40:25,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16210 conditions, 5696 events. 3952/5696 cut-off events. For 10714/10714 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 28556 event pairs, 341 based on Foata normal form. 55/5747 useless extension candidates. Maximal degree in co-relation 14396. Up to 3371 conditions per place. [2025-01-09 16:40:25,971 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 104 selfloop transitions, 14 changer transitions 2/124 dead transitions. [2025-01-09 16:40:25,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 124 transitions, 833 flow [2025-01-09 16:40:25,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:25,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-01-09 16:40:25,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-01-09 16:40:25,973 INFO L175 Difference]: Start difference. First operand has 83 places, 70 transitions, 458 flow. Second operand 5 states and 133 transitions. [2025-01-09 16:40:25,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 124 transitions, 833 flow [2025-01-09 16:40:25,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 124 transitions, 807 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-01-09 16:40:26,001 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 421 flow [2025-01-09 16:40:26,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=421, PETRI_PLACES=82, PETRI_TRANSITIONS=68} [2025-01-09 16:40:26,001 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2025-01-09 16:40:26,002 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 421 flow [2025-01-09 16:40:26,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:26,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:26,002 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] [2025-01-09 16:40:26,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:40:26,002 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:26,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:26,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1059457200, now seen corresponding path program 5 times [2025-01-09 16:40:26,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:26,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634134977] [2025-01-09 16:40:26,003 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:40:26,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:26,011 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:40:26,016 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:40:26,016 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:40:26,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:26,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:26,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634134977] [2025-01-09 16:40:26,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634134977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:26,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:26,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:40:26,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862199838] [2025-01-09 16:40:26,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:26,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:40:26,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:26,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:40:26,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:40:26,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:26,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 68 transitions, 421 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:26,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:26,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:26,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:26,474 INFO L124 PetriNetUnfolderBase]: 3888/5578 cut-off events. [2025-01-09 16:40:26,474 INFO L125 PetriNetUnfolderBase]: For 7598/7598 co-relation queries the response was YES. [2025-01-09 16:40:26,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15896 conditions, 5578 events. 3888/5578 cut-off events. For 7598/7598 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 27906 event pairs, 2175 based on Foata normal form. 16/5586 useless extension candidates. Maximal degree in co-relation 12864. Up to 4678 conditions per place. [2025-01-09 16:40:26,510 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 78 selfloop transitions, 2 changer transitions 13/97 dead transitions. [2025-01-09 16:40:26,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 97 transitions, 683 flow [2025-01-09 16:40:26,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:40:26,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:40:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-01-09 16:40:26,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5051020408163265 [2025-01-09 16:40:26,511 INFO L175 Difference]: Start difference. First operand has 82 places, 68 transitions, 421 flow. Second operand 4 states and 99 transitions. [2025-01-09 16:40:26,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 97 transitions, 683 flow [2025-01-09 16:40:26,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 97 transitions, 647 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-01-09 16:40:26,535 INFO L231 Difference]: Finished difference. Result has 81 places, 66 transitions, 370 flow [2025-01-09 16:40:26,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=370, PETRI_PLACES=81, PETRI_TRANSITIONS=66} [2025-01-09 16:40:26,535 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2025-01-09 16:40:26,535 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 66 transitions, 370 flow [2025-01-09 16:40:26,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:26,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:26,536 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] [2025-01-09 16:40:26,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:40:26,536 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:26,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:26,536 INFO L85 PathProgramCache]: Analyzing trace with hash 518984432, now seen corresponding path program 4 times [2025-01-09 16:40:26,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:26,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050239975] [2025-01-09 16:40:26,537 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:40:26,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:26,547 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:40:26,550 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 28 statements. [2025-01-09 16:40:26,551 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:40:26,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:26,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:26,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:26,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050239975] [2025-01-09 16:40:26,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050239975] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:26,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:26,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:40:26,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142526083] [2025-01-09 16:40:26,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:26,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:40:26,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:26,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:40:26,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:40:26,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:26,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 66 transitions, 370 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:26,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:26,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:26,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:26,950 INFO L124 PetriNetUnfolderBase]: 3837/5509 cut-off events. [2025-01-09 16:40:26,951 INFO L125 PetriNetUnfolderBase]: For 5283/5283 co-relation queries the response was YES. [2025-01-09 16:40:26,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15344 conditions, 5509 events. 3837/5509 cut-off events. For 5283/5283 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 27410 event pairs, 1271 based on Foata normal form. 20/5525 useless extension candidates. Maximal degree in co-relation 14182. Up to 3427 conditions per place. [2025-01-09 16:40:26,978 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 77 selfloop transitions, 6 changer transitions 10/97 dead transitions. [2025-01-09 16:40:26,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 97 transitions, 642 flow [2025-01-09 16:40:26,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:40:26,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:40:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-01-09 16:40:26,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2025-01-09 16:40:26,979 INFO L175 Difference]: Start difference. First operand has 81 places, 66 transitions, 370 flow. Second operand 4 states and 100 transitions. [2025-01-09 16:40:26,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 97 transitions, 642 flow [2025-01-09 16:40:26,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 97 transitions, 638 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-09 16:40:26,997 INFO L231 Difference]: Finished difference. Result has 81 places, 64 transitions, 357 flow [2025-01-09 16:40:26,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=357, PETRI_PLACES=81, PETRI_TRANSITIONS=64} [2025-01-09 16:40:26,997 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2025-01-09 16:40:26,997 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 64 transitions, 357 flow [2025-01-09 16:40:26,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:26,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:26,998 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] [2025-01-09 16:40:26,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:40:26,998 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:26,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:26,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1357254188, now seen corresponding path program 6 times [2025-01-09 16:40:26,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:26,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336683039] [2025-01-09 16:40:26,999 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:40:26,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:27,006 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:40:27,011 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:40:27,011 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:40:27,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:27,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:27,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:27,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336683039] [2025-01-09 16:40:27,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336683039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:27,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:27,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:40:27,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607142228] [2025-01-09 16:40:27,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:27,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:40:27,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:27,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:40:27,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:40:27,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:27,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 64 transitions, 357 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:27,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:27,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:27,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:27,439 INFO L124 PetriNetUnfolderBase]: 3466/4962 cut-off events. [2025-01-09 16:40:27,439 INFO L125 PetriNetUnfolderBase]: For 5124/5124 co-relation queries the response was YES. [2025-01-09 16:40:27,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14026 conditions, 4962 events. 3466/4962 cut-off events. For 5124/5124 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 23994 event pairs, 666 based on Foata normal form. 20/4978 useless extension candidates. Maximal degree in co-relation 12915. Up to 4319 conditions per place. [2025-01-09 16:40:27,471 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 66 selfloop transitions, 5 changer transitions 10/85 dead transitions. [2025-01-09 16:40:27,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 85 transitions, 559 flow [2025-01-09 16:40:27,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:40:27,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:40:27,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-01-09 16:40:27,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4744897959183674 [2025-01-09 16:40:27,473 INFO L175 Difference]: Start difference. First operand has 81 places, 64 transitions, 357 flow. Second operand 4 states and 93 transitions. [2025-01-09 16:40:27,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 85 transitions, 559 flow [2025-01-09 16:40:27,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 85 transitions, 540 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-09 16:40:27,483 INFO L231 Difference]: Finished difference. Result has 78 places, 61 transitions, 306 flow [2025-01-09 16:40:27,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=306, PETRI_PLACES=78, PETRI_TRANSITIONS=61} [2025-01-09 16:40:27,484 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 35 predicate places. [2025-01-09 16:40:27,484 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 61 transitions, 306 flow [2025-01-09 16:40:27,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:27,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:27,484 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] [2025-01-09 16:40:27,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 16:40:27,485 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:27,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:27,486 INFO L85 PathProgramCache]: Analyzing trace with hash -848256434, now seen corresponding path program 5 times [2025-01-09 16:40:27,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:27,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572021751] [2025-01-09 16:40:27,486 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:40:27,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:27,494 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:40:27,498 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:40:27,498 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:40:27,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:27,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:27,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:27,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572021751] [2025-01-09 16:40:27,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572021751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:27,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:27,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:40:27,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689253620] [2025-01-09 16:40:27,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:27,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:40:27,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:27,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:40:27,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:40:27,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:27,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 61 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:27,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:27,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:27,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:27,839 INFO L124 PetriNetUnfolderBase]: 3107/4420 cut-off events. [2025-01-09 16:40:27,840 INFO L125 PetriNetUnfolderBase]: For 3535/3535 co-relation queries the response was YES. [2025-01-09 16:40:27,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12227 conditions, 4420 events. 3107/4420 cut-off events. For 3535/3535 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 20757 event pairs, 1836 based on Foata normal form. 16/4428 useless extension candidates. Maximal degree in co-relation 11830. Up to 4110 conditions per place. [2025-01-09 16:40:27,865 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 54 selfloop transitions, 0 changer transitions 14/72 dead transitions. [2025-01-09 16:40:27,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 72 transitions, 453 flow [2025-01-09 16:40:27,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:40:27,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:40:27,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2025-01-09 16:40:27,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.413265306122449 [2025-01-09 16:40:27,868 INFO L175 Difference]: Start difference. First operand has 78 places, 61 transitions, 306 flow. Second operand 4 states and 81 transitions. [2025-01-09 16:40:27,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 72 transitions, 453 flow [2025-01-09 16:40:27,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 72 transitions, 441 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-09 16:40:27,876 INFO L231 Difference]: Finished difference. Result has 70 places, 58 transitions, 257 flow [2025-01-09 16:40:27,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=257, PETRI_PLACES=70, PETRI_TRANSITIONS=58} [2025-01-09 16:40:27,877 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2025-01-09 16:40:27,877 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 58 transitions, 257 flow [2025-01-09 16:40:27,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:27,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:27,878 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-01-09 16:40:27,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 16:40:27,878 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:27,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:27,878 INFO L85 PathProgramCache]: Analyzing trace with hash -473502096, now seen corresponding path program 1 times [2025-01-09 16:40:27,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:27,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703703350] [2025-01-09 16:40:27,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:40:27,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:27,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:40:27,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:40:27,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:40:27,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:28,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-01-09 16:40:28,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:28,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703703350] [2025-01-09 16:40:28,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703703350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:28,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:28,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:40:28,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542445110] [2025-01-09 16:40:28,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:28,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:40:28,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:28,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:40:28,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:40:28,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:28,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 257 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:28,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:28,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:28,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:29,075 INFO L124 PetriNetUnfolderBase]: 6342/8941 cut-off events. [2025-01-09 16:40:29,075 INFO L125 PetriNetUnfolderBase]: For 5099/5099 co-relation queries the response was YES. [2025-01-09 16:40:29,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24692 conditions, 8941 events. 6342/8941 cut-off events. For 5099/5099 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 46335 event pairs, 1124 based on Foata normal form. 1/8932 useless extension candidates. Maximal degree in co-relation 24682. Up to 2971 conditions per place. [2025-01-09 16:40:29,146 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 156 selfloop transitions, 18 changer transitions 3/181 dead transitions. [2025-01-09 16:40:29,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 181 transitions, 1168 flow [2025-01-09 16:40:29,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:40:29,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:40:29,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 199 transitions. [2025-01-09 16:40:29,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4512471655328798 [2025-01-09 16:40:29,150 INFO L175 Difference]: Start difference. First operand has 70 places, 58 transitions, 257 flow. Second operand 9 states and 199 transitions. [2025-01-09 16:40:29,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 181 transitions, 1168 flow [2025-01-09 16:40:29,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 181 transitions, 1160 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-01-09 16:40:29,165 INFO L231 Difference]: Finished difference. Result has 77 places, 73 transitions, 385 flow [2025-01-09 16:40:29,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=385, PETRI_PLACES=77, PETRI_TRANSITIONS=73} [2025-01-09 16:40:29,166 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2025-01-09 16:40:29,166 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 385 flow [2025-01-09 16:40:29,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:29,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:29,167 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, 1] [2025-01-09 16:40:29,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 16:40:29,167 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:29,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:29,168 INFO L85 PathProgramCache]: Analyzing trace with hash -312844073, now seen corresponding path program 1 times [2025-01-09 16:40:29,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:29,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123449885] [2025-01-09 16:40:29,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:40:29,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:29,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:40:29,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:40:29,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:40:29,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:29,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:29,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123449885] [2025-01-09 16:40:29,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123449885] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:40:29,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720430342] [2025-01-09 16:40:29,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:40:29,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:40:29,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:40:29,338 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:40:29,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:40:29,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:40:29,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:40:29,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:40:29,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:29,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 16:40:29,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:40:30,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:30,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:40:31,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:40:31,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720430342] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:40:31,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:40:31,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7, 12] total 25 [2025-01-09 16:40:31,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299734340] [2025-01-09 16:40:31,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:31,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:40:31,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:31,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:40:31,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2025-01-09 16:40:32,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:32,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 73 transitions, 385 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-01-09 16:40:32,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:32,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:32,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:34,508 INFO L124 PetriNetUnfolderBase]: 12378/18004 cut-off events. [2025-01-09 16:40:34,509 INFO L125 PetriNetUnfolderBase]: For 14224/14224 co-relation queries the response was YES. [2025-01-09 16:40:34,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52784 conditions, 18004 events. 12378/18004 cut-off events. For 14224/14224 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 110118 event pairs, 919 based on Foata normal form. 2/18000 useless extension candidates. Maximal degree in co-relation 52768. Up to 3399 conditions per place. [2025-01-09 16:40:34,623 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 330 selfloop transitions, 85 changer transitions 13/432 dead transitions. [2025-01-09 16:40:34,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 432 transitions, 3000 flow [2025-01-09 16:40:34,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:40:34,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 16:40:34,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 381 transitions. [2025-01-09 16:40:34,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2025-01-09 16:40:34,625 INFO L175 Difference]: Start difference. First operand has 77 places, 73 transitions, 385 flow. Second operand 15 states and 381 transitions. [2025-01-09 16:40:34,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 432 transitions, 3000 flow [2025-01-09 16:40:34,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 432 transitions, 2994 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-01-09 16:40:34,645 INFO L231 Difference]: Finished difference. Result has 103 places, 169 transitions, 1421 flow [2025-01-09 16:40:34,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1421, PETRI_PLACES=103, PETRI_TRANSITIONS=169} [2025-01-09 16:40:34,646 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 60 predicate places. [2025-01-09 16:40:34,646 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 169 transitions, 1421 flow [2025-01-09 16:40:34,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-01-09 16:40:34,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:34,646 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, 1] [2025-01-09 16:40:34,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:40:34,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:40:34,851 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:34,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:34,852 INFO L85 PathProgramCache]: Analyzing trace with hash 801198695, now seen corresponding path program 2 times [2025-01-09 16:40:34,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:34,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780069766] [2025-01-09 16:40:34,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:40:34,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:34,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:40:34,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 31 statements. [2025-01-09 16:40:34,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:40:34,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:35,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:40:35,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:35,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780069766] [2025-01-09 16:40:35,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780069766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:35,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:35,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:40:35,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312837730] [2025-01-09 16:40:35,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:35,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:40:35,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:35,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:40:35,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:40:35,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:35,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 169 transitions, 1421 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 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-01-09 16:40:35,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:35,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:35,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:37,589 INFO L124 PetriNetUnfolderBase]: 15927/23090 cut-off events. [2025-01-09 16:40:37,589 INFO L125 PetriNetUnfolderBase]: For 55854/55974 co-relation queries the response was YES. [2025-01-09 16:40:37,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83906 conditions, 23090 events. 15927/23090 cut-off events. For 55854/55974 co-relation queries the response was YES. Maximal size of possible extension queue 1054. Compared 143284 event pairs, 3061 based on Foata normal form. 117/23199 useless extension candidates. Maximal degree in co-relation 83877. Up to 12386 conditions per place. [2025-01-09 16:40:37,803 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 225 selfloop transitions, 117 changer transitions 4/350 dead transitions. [2025-01-09 16:40:37,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 350 transitions, 3336 flow [2025-01-09 16:40:37,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:40:37,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:40:37,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 225 transitions. [2025-01-09 16:40:37,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45918367346938777 [2025-01-09 16:40:37,805 INFO L175 Difference]: Start difference. First operand has 103 places, 169 transitions, 1421 flow. Second operand 10 states and 225 transitions. [2025-01-09 16:40:37,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 350 transitions, 3336 flow [2025-01-09 16:40:38,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 350 transitions, 3308 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-01-09 16:40:38,056 INFO L231 Difference]: Finished difference. Result has 115 places, 217 transitions, 2226 flow [2025-01-09 16:40:38,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1400, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2226, PETRI_PLACES=115, PETRI_TRANSITIONS=217} [2025-01-09 16:40:38,056 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 72 predicate places. [2025-01-09 16:40:38,057 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 217 transitions, 2226 flow [2025-01-09 16:40:38,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 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-01-09 16:40:38,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:38,057 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, 1] [2025-01-09 16:40:38,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 16:40:38,057 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:38,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:38,058 INFO L85 PathProgramCache]: Analyzing trace with hash -878933901, now seen corresponding path program 3 times [2025-01-09 16:40:38,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:38,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798777952] [2025-01-09 16:40:38,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:40:38,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:38,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:40:38,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 31 statements. [2025-01-09 16:40:38,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:40:38,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:38,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:40:38,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:38,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798777952] [2025-01-09 16:40:38,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798777952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:38,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:38,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:40:38,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444401558] [2025-01-09 16:40:38,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:38,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:40:38,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:38,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:40:38,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:40:38,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:38,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 217 transitions, 2226 flow. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 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-01-09 16:40:38,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:38,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:38,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:42,605 INFO L124 PetriNetUnfolderBase]: 26040/37644 cut-off events. [2025-01-09 16:40:42,606 INFO L125 PetriNetUnfolderBase]: For 113195/113329 co-relation queries the response was YES. [2025-01-09 16:40:42,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142994 conditions, 37644 events. 26040/37644 cut-off events. For 113195/113329 co-relation queries the response was YES. Maximal size of possible extension queue 1822. Compared 252036 event pairs, 3703 based on Foata normal form. 113/37752 useless extension candidates. Maximal degree in co-relation 142960. Up to 11918 conditions per place. [2025-01-09 16:40:42,945 INFO L140 encePairwiseOnDemand]: 33/49 looper letters, 408 selfloop transitions, 201 changer transitions 8/621 dead transitions. [2025-01-09 16:40:42,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 621 transitions, 6700 flow [2025-01-09 16:40:42,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 16:40:42,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-09 16:40:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 390 transitions. [2025-01-09 16:40:42,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.468187274909964 [2025-01-09 16:40:42,947 INFO L175 Difference]: Start difference. First operand has 115 places, 217 transitions, 2226 flow. Second operand 17 states and 390 transitions. [2025-01-09 16:40:42,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 621 transitions, 6700 flow [2025-01-09 16:40:43,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 621 transitions, 6166 flow, removed 103 selfloop flow, removed 2 redundant places. [2025-01-09 16:40:43,854 INFO L231 Difference]: Finished difference. Result has 139 places, 328 transitions, 3922 flow [2025-01-09 16:40:43,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1954, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3922, PETRI_PLACES=139, PETRI_TRANSITIONS=328} [2025-01-09 16:40:43,855 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 96 predicate places. [2025-01-09 16:40:43,855 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 328 transitions, 3922 flow [2025-01-09 16:40:43,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 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-01-09 16:40:43,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:43,855 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, 1] [2025-01-09 16:40:43,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 16:40:43,855 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:43,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:43,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1500607125, now seen corresponding path program 4 times [2025-01-09 16:40:43,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:43,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652249171] [2025-01-09 16:40:43,856 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:40:43,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:43,862 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:40:43,869 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:40:43,869 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:40:43,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:44,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:44,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:44,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652249171] [2025-01-09 16:40:44,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652249171] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:40:44,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338862228] [2025-01-09 16:40:44,069 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:40:44,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:40:44,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:40:44,072 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:40:44,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:40:44,135 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:40:44,164 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:40:44,164 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:40:44,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:44,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 16:40:44,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:40:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:44,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:40:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:40:45,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338862228] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:40:45,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:40:45,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7, 11] total 25 [2025-01-09 16:40:45,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795075642] [2025-01-09 16:40:45,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:45,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:40:45,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:45,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:40:45,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2025-01-09 16:40:46,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 49 [2025-01-09 16:40:46,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 328 transitions, 3922 flow. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:46,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:46,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 49 [2025-01-09 16:40:46,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:53,058 INFO L124 PetriNetUnfolderBase]: 39926/57115 cut-off events. [2025-01-09 16:40:53,058 INFO L125 PetriNetUnfolderBase]: For 215729/216051 co-relation queries the response was YES. [2025-01-09 16:40:53,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227383 conditions, 57115 events. 39926/57115 cut-off events. For 215729/216051 co-relation queries the response was YES. Maximal size of possible extension queue 2685. Compared 394724 event pairs, 5115 based on Foata normal form. 316/56214 useless extension candidates. Maximal degree in co-relation 227339. Up to 19183 conditions per place. [2025-01-09 16:40:53,705 INFO L140 encePairwiseOnDemand]: 32/49 looper letters, 515 selfloop transitions, 346 changer transitions 9/873 dead transitions. [2025-01-09 16:40:53,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 873 transitions, 10829 flow [2025-01-09 16:40:53,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 16:40:53,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-09 16:40:53,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 414 transitions. [2025-01-09 16:40:53,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2025-01-09 16:40:53,707 INFO L175 Difference]: Start difference. First operand has 139 places, 328 transitions, 3922 flow. Second operand 18 states and 414 transitions. [2025-01-09 16:40:53,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 873 transitions, 10829 flow [2025-01-09 16:40:55,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 873 transitions, 10610 flow, removed 55 selfloop flow, removed 5 redundant places. [2025-01-09 16:40:55,548 INFO L231 Difference]: Finished difference. Result has 163 places, 585 transitions, 8423 flow [2025-01-09 16:40:55,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3814, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=8423, PETRI_PLACES=163, PETRI_TRANSITIONS=585} [2025-01-09 16:40:55,548 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 120 predicate places. [2025-01-09 16:40:55,548 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 585 transitions, 8423 flow [2025-01-09 16:40:55,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:55,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:55,549 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, 1] [2025-01-09 16:40:55,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:40:55,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:40:55,749 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:55,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:55,750 INFO L85 PathProgramCache]: Analyzing trace with hash 799844035, now seen corresponding path program 5 times [2025-01-09 16:40:55,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:55,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862064910] [2025-01-09 16:40:55,750 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:40:55,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:55,756 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:40:55,762 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:40:55,762 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:40:55,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:55,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:55,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862064910] [2025-01-09 16:40:55,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862064910] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:40:55,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612283042] [2025-01-09 16:40:55,889 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:40:55,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:40:55,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:40:55,891 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:40:55,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:40:55,960 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:40:55,989 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:40:55,989 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:40:55,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:55,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 16:40:55,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:40:56,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:56,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:40:57,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:40:57,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612283042] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:40:57,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:40:57,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7, 12] total 25 [2025-01-09 16:40:57,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355248157] [2025-01-09 16:40:57,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:57,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:40:57,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:57,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:40:57,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2025-01-09 16:40:57,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:57,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 585 transitions, 8423 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-01-09 16:40:57,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:57,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:57,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:07,557 INFO L124 PetriNetUnfolderBase]: 47044/67785 cut-off events. [2025-01-09 16:41:07,557 INFO L125 PetriNetUnfolderBase]: For 418803/420138 co-relation queries the response was YES. [2025-01-09 16:41:08,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309255 conditions, 67785 events. 47044/67785 cut-off events. For 418803/420138 co-relation queries the response was YES. Maximal size of possible extension queue 3343. Compared 485897 event pairs, 5109 based on Foata normal form. 156/67843 useless extension candidates. Maximal degree in co-relation 309200. Up to 21375 conditions per place. [2025-01-09 16:41:08,585 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 490 selfloop transitions, 614 changer transitions 8/1118 dead transitions. [2025-01-09 16:41:08,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 1118 transitions, 16731 flow [2025-01-09 16:41:08,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:41:08,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 16:41:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 366 transitions. [2025-01-09 16:41:08,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49795918367346936 [2025-01-09 16:41:08,587 INFO L175 Difference]: Start difference. First operand has 163 places, 585 transitions, 8423 flow. Second operand 15 states and 366 transitions. [2025-01-09 16:41:08,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 1118 transitions, 16731 flow [2025-01-09 16:41:15,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 1118 transitions, 16209 flow, removed 171 selfloop flow, removed 2 redundant places. [2025-01-09 16:41:15,108 INFO L231 Difference]: Finished difference. Result has 186 places, 853 transitions, 14303 flow [2025-01-09 16:41:15,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=8083, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=366, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=14303, PETRI_PLACES=186, PETRI_TRANSITIONS=853} [2025-01-09 16:41:15,109 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 143 predicate places. [2025-01-09 16:41:15,109 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 853 transitions, 14303 flow [2025-01-09 16:41:15,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-01-09 16:41:15,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:15,109 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, 1] [2025-01-09 16:41:15,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 16:41:15,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:41:15,313 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:41:15,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:15,314 INFO L85 PathProgramCache]: Analyzing trace with hash 504029683, now seen corresponding path program 6 times [2025-01-09 16:41:15,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:15,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340271110] [2025-01-09 16:41:15,314 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:41:15,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:15,322 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:41:15,338 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 30 of 31 statements. [2025-01-09 16:41:15,339 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:41:15,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:41:16,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:16,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340271110] [2025-01-09 16:41:16,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340271110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:16,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:16,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:41:16,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305941818] [2025-01-09 16:41:16,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:16,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:41:16,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:16,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:41:16,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:41:16,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:41:16,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 853 transitions, 14303 flow. Second operand has 13 states, 13 states have (on average 9.153846153846153) internal successors, (119), 13 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-01-09 16:41:16,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:16,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:41:16,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand