./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-name-comparator-trans.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-name-comparator-trans.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 362ca5c35cce683744d8d619a442f154ce469608d45ae43ff282ddf886694959 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:39:01,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:39:01,063 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:39:01,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:39:01,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:39:01,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:39:01,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:39:01,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:39:01,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:39:01,087 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:39:01,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:39:01,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:39:01,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:39:01,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:39:01,087 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:39:01,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:39:01,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:39:01,088 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:39:01,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:39:01,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:39:01,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:39:01,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:39:01,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:39:01,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:39:01,088 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:39:01,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:39:01,088 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:39:01,088 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:39:01,088 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:39:01,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:39:01,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:39:01,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:39:01,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:39:01,088 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:39:01,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:39:01,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:39:01,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:39:01,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:39:01,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:39:01,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:39:01,089 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:39:01,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:39:01,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:39:01,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:39:01,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:39:01,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:39:01,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:39:01,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:39:01,089 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 -> 362ca5c35cce683744d8d619a442f154ce469608d45ae43ff282ddf886694959 [2025-01-09 16:39:01,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:39:01,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:39:01,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:39:01,328 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:39:01,328 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:39:01,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c [2025-01-09 16:39:02,441 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/014a77417/a86ad4c6b87245f0848010a023c29052/FLAGe6b85c6a6 [2025-01-09 16:39:02,705 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:39:02,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c [2025-01-09 16:39:02,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/014a77417/a86ad4c6b87245f0848010a023c29052/FLAGe6b85c6a6 [2025-01-09 16:39:03,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/014a77417/a86ad4c6b87245f0848010a023c29052 [2025-01-09 16:39:03,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:39:03,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:39:03,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:39:03,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:39:03,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:39:03,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:39:03" (1/1) ... [2025-01-09 16:39:03,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fd970e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:03, skipping insertion in model container [2025-01-09 16:39:03,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:39:03" (1/1) ... [2025-01-09 16:39:03,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:39:03,193 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-name-comparator-trans.wvr.c[4827,4840] [2025-01-09 16:39:03,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:39:03,214 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:39:03,234 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-name-comparator-trans.wvr.c[4827,4840] [2025-01-09 16:39:03,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:39:03,254 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:39:03,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:03 WrapperNode [2025-01-09 16:39:03,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:39:03,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:39:03,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:39:03,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:39:03,263 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:39:03" (1/1) ... [2025-01-09 16:39:03,272 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:39:03" (1/1) ... [2025-01-09 16:39:03,299 INFO L138 Inliner]: procedures = 25, calls = 29, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 298 [2025-01-09 16:39:03,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:39:03,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:39:03,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:39:03,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:39:03,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:03" (1/1) ... [2025-01-09 16:39:03,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:03" (1/1) ... [2025-01-09 16:39:03,316 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:03" (1/1) ... [2025-01-09 16:39:03,335 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-09 16:39:03,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:03" (1/1) ... [2025-01-09 16:39:03,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:03" (1/1) ... [2025-01-09 16:39:03,341 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:03" (1/1) ... [2025-01-09 16:39:03,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:03" (1/1) ... [2025-01-09 16:39:03,346 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:03" (1/1) ... [2025-01-09 16:39:03,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:03" (1/1) ... [2025-01-09 16:39:03,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:03" (1/1) ... [2025-01-09 16:39:03,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:39:03,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:39:03,356 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:39:03,356 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:39:03,357 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:03" (1/1) ... [2025-01-09 16:39:03,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:39:03,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:03,380 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:39:03,381 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:39:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:39:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:39:03,401 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:39:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:39:03,401 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:39:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:39:03,401 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:39:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:39:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:39:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:39:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:39:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:39:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:39:03,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:39:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:39:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:39:03,403 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:39:03,488 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:39:03,490 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:39:03,809 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:39:03,809 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:39:04,101 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:39:04,101 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 16:39:04,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:39:04 BoogieIcfgContainer [2025-01-09 16:39:04,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:39:04,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:39:04,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:39:04,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:39:04,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:39:03" (1/3) ... [2025-01-09 16:39:04,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b339f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:39:04, skipping insertion in model container [2025-01-09 16:39:04,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:03" (2/3) ... [2025-01-09 16:39:04,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b339f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:39:04, skipping insertion in model container [2025-01-09 16:39:04,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:39:04" (3/3) ... [2025-01-09 16:39:04,110 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-trans.wvr.c [2025-01-09 16:39:04,122 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:39:04,123 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-trans.wvr.c that has 4 procedures, 30 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 16:39:04,123 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:39:04,173 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:39:04,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 36 transitions, 93 flow [2025-01-09 16:39:04,225 INFO L124 PetriNetUnfolderBase]: 7/33 cut-off events. [2025-01-09 16:39:04,226 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:39:04,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 33 events. 7/33 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 34 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-01-09 16:39:04,230 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 36 transitions, 93 flow [2025-01-09 16:39:04,232 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 32 transitions, 82 flow [2025-01-09 16:39:04,241 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:39:04,252 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;@4e986c68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:39:04,252 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:39:04,280 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:39:04,280 INFO L124 PetriNetUnfolderBase]: 7/31 cut-off events. [2025-01-09 16:39:04,280 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:39:04,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:04,281 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] [2025-01-09 16:39:04,281 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:39:04,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:04,285 INFO L85 PathProgramCache]: Analyzing trace with hash -762245982, now seen corresponding path program 1 times [2025-01-09 16:39:04,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:04,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231664810] [2025-01-09 16:39:04,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:04,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:04,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:39:04,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:39:04,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:04,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:04,485 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:39:04,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:04,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231664810] [2025-01-09 16:39:04,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231664810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:04,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:04,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:39:04,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120565984] [2025-01-09 16:39:04,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:04,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:39:04,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:04,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:39:04,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:39:04,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:04,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 82 flow. Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:04,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:04,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:04,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:04,741 INFO L124 PetriNetUnfolderBase]: 792/1137 cut-off events. [2025-01-09 16:39:04,742 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-01-09 16:39:04,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2371 conditions, 1137 events. 792/1137 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3702 event pairs, 608 based on Foata normal form. 0/953 useless extension candidates. Maximal degree in co-relation 2150. Up to 1137 conditions per place. [2025-01-09 16:39:04,752 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 28 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2025-01-09 16:39:04,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 132 flow [2025-01-09 16:39:04,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:39:04,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 16:39:04,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2025-01-09 16:39:04,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-01-09 16:39:04,770 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 82 flow. Second operand 2 states and 39 transitions. [2025-01-09 16:39:04,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 132 flow [2025-01-09 16:39:04,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 120 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:39:04,777 INFO L231 Difference]: Finished difference. Result has 30 places, 29 transitions, 64 flow [2025-01-09 16:39:04,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=30, PETRI_TRANSITIONS=29} [2025-01-09 16:39:04,781 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2025-01-09 16:39:04,781 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 29 transitions, 64 flow [2025-01-09 16:39:04,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:04,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:04,782 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] [2025-01-09 16:39:04,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:39:04,782 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:39:04,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:04,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1132213606, now seen corresponding path program 1 times [2025-01-09 16:39:04,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:04,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143803231] [2025-01-09 16:39:04,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:04,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:04,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:39:04,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:39:04,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:04,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:04,972 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:39:04,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:04,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143803231] [2025-01-09 16:39:04,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143803231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:04,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:04,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:39:04,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906477163] [2025-01-09 16:39:04,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:04,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:39:04,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:04,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:39:04,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:39:04,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:04,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:39:04,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:04,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:04,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:05,136 INFO L124 PetriNetUnfolderBase]: 792/1138 cut-off events. [2025-01-09 16:39:05,139 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-09 16:39:05,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2309 conditions, 1138 events. 792/1138 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3697 event pairs, 608 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 2306. Up to 1137 conditions per place. [2025-01-09 16:39:05,147 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 27 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2025-01-09 16:39:05,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 124 flow [2025-01-09 16:39:05,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:39:05,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:39:05,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-01-09 16:39:05,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-01-09 16:39:05,148 INFO L175 Difference]: Start difference. First operand has 30 places, 29 transitions, 64 flow. Second operand 3 states and 42 transitions. [2025-01-09 16:39:05,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 124 flow [2025-01-09 16:39:05,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:39:05,150 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 76 flow [2025-01-09 16:39:05,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2025-01-09 16:39:05,151 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2025-01-09 16:39:05,151 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 76 flow [2025-01-09 16:39:05,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:39:05,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:05,151 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:39:05,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:39:05,152 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:39:05,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:05,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1732024641, now seen corresponding path program 1 times [2025-01-09 16:39:05,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:05,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748909265] [2025-01-09 16:39:05,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:05,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:05,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:39:05,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:39:05,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:05,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:05,299 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:39:05,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:05,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748909265] [2025-01-09 16:39:05,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748909265] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:05,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631540632] [2025-01-09 16:39:05,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:05,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:05,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:05,302 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:39:05,304 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:39:05,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:39:05,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:39:05,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:05,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:05,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 16:39:05,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:05,453 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:39:05,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:39:05,472 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:39:05,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631540632] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:39:05,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:39:05,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-09 16:39:05,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179555795] [2025-01-09 16:39:05,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:39:05,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:39:05,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:05,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:39:05,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:39:05,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:05,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 76 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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:39:05,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:05,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:05,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:05,695 INFO L124 PetriNetUnfolderBase]: 792/1140 cut-off events. [2025-01-09 16:39:05,695 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-09 16:39:05,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2322 conditions, 1140 events. 792/1140 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3697 event pairs, 608 based on Foata normal form. 0/956 useless extension candidates. Maximal degree in co-relation 2317. Up to 1137 conditions per place. [2025-01-09 16:39:05,702 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 27 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2025-01-09 16:39:05,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 146 flow [2025-01-09 16:39:05,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:39:05,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:39:05,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2025-01-09 16:39:05,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29444444444444445 [2025-01-09 16:39:05,704 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 76 flow. Second operand 5 states and 53 transitions. [2025-01-09 16:39:05,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 146 flow [2025-01-09 16:39:05,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 142 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:39:05,706 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 98 flow [2025-01-09 16:39:05,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2025-01-09 16:39:05,706 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-01-09 16:39:05,706 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 98 flow [2025-01-09 16:39:05,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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:39:05,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:05,708 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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:39:05,718 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:39:05,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:05,912 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:39:05,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:05,914 INFO L85 PathProgramCache]: Analyzing trace with hash 211984287, now seen corresponding path program 2 times [2025-01-09 16:39:05,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:05,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157847077] [2025-01-09 16:39:05,915 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:39:05,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:05,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:39:05,971 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-01-09 16:39:05,971 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:39:05,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:06,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:06,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157847077] [2025-01-09 16:39:06,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157847077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:06,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:06,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:39:06,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650680463] [2025-01-09 16:39:06,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:06,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:39:06,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:06,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:39:06,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:39:06,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:06,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:39:06,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:06,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:06,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:06,501 INFO L124 PetriNetUnfolderBase]: 1435/2062 cut-off events. [2025-01-09 16:39:06,501 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-01-09 16:39:06,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4199 conditions, 2062 events. 1435/2062 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8198 event pairs, 608 based on Foata normal form. 1/1719 useless extension candidates. Maximal degree in co-relation 4192. Up to 1140 conditions per place. [2025-01-09 16:39:06,510 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 46 selfloop transitions, 2 changer transitions 20/69 dead transitions. [2025-01-09 16:39:06,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 69 transitions, 315 flow [2025-01-09 16:39:06,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:39:06,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:39:06,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-01-09 16:39:06,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2025-01-09 16:39:06,512 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 98 flow. Second operand 4 states and 82 transitions. [2025-01-09 16:39:06,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 69 transitions, 315 flow [2025-01-09 16:39:06,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 69 transitions, 305 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-01-09 16:39:06,515 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 102 flow [2025-01-09 16:39:06,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2025-01-09 16:39:06,516 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-01-09 16:39:06,516 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 102 flow [2025-01-09 16:39:06,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:39:06,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:06,517 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:06,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:39:06,517 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:39:06,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:06,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1178631928, now seen corresponding path program 1 times [2025-01-09 16:39:06,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:06,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927343349] [2025-01-09 16:39:06,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:06,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:06,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:39:06,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:39:06,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:06,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:06,760 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 16:39:06,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:06,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927343349] [2025-01-09 16:39:06,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927343349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:06,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:06,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:39:06,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780780835] [2025-01-09 16:39:06,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:06,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:39:06,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:06,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:39:06,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:39:06,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:06,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:39:06,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:06,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:06,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:07,093 INFO L124 PetriNetUnfolderBase]: 2206/3150 cut-off events. [2025-01-09 16:39:07,093 INFO L125 PetriNetUnfolderBase]: For 695/695 co-relation queries the response was YES. [2025-01-09 16:39:07,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6950 conditions, 3150 events. 2206/3150 cut-off events. For 695/695 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 13300 event pairs, 983 based on Foata normal form. 1/2794 useless extension candidates. Maximal degree in co-relation 6940. Up to 1767 conditions per place. [2025-01-09 16:39:07,105 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 47 selfloop transitions, 2 changer transitions 19/69 dead transitions. [2025-01-09 16:39:07,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 69 transitions, 336 flow [2025-01-09 16:39:07,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:39:07,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:39:07,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-01-09 16:39:07,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5486111111111112 [2025-01-09 16:39:07,107 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 102 flow. Second operand 4 states and 79 transitions. [2025-01-09 16:39:07,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 69 transitions, 336 flow [2025-01-09 16:39:07,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 69 transitions, 328 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-09 16:39:07,108 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 112 flow [2025-01-09 16:39:07,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2025-01-09 16:39:07,110 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2025-01-09 16:39:07,110 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 112 flow [2025-01-09 16:39:07,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:39:07,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:07,111 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:07,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:39:07,111 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:39:07,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:07,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1292343083, now seen corresponding path program 1 times [2025-01-09 16:39:07,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:07,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526698896] [2025-01-09 16:39:07,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:07,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:07,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 16:39:07,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:39:07,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:07,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:08,051 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:08,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:08,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526698896] [2025-01-09 16:39:08,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526698896] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:08,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865028742] [2025-01-09 16:39:08,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:08,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:08,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:08,054 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:39:08,055 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:39:08,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 16:39:08,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:39:08,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:08,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:08,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 16:39:08,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:08,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 101 [2025-01-09 16:39:09,394 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:09,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:39:10,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:39:10,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 103 [2025-01-09 16:39:10,479 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:10,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865028742] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:39:10,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:39:10,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 26 [2025-01-09 16:39:10,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219027943] [2025-01-09 16:39:10,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:39:10,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 16:39:10,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:10,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 16:39:10,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2025-01-09 16:39:10,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:10,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 112 flow. Second operand has 26 states, 26 states have (on average 7.1923076923076925) internal successors, (187), 26 states have internal predecessors, (187), 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:39:10,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:10,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:10,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:19,392 INFO L124 PetriNetUnfolderBase]: 12300/17632 cut-off events. [2025-01-09 16:39:19,392 INFO L125 PetriNetUnfolderBase]: For 3801/3801 co-relation queries the response was YES. [2025-01-09 16:39:19,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40810 conditions, 17632 events. 12300/17632 cut-off events. For 3801/3801 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 99397 event pairs, 602 based on Foata normal form. 8/16621 useless extension candidates. Maximal degree in co-relation 40799. Up to 2095 conditions per place. [2025-01-09 16:39:19,458 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 546 selfloop transitions, 169 changer transitions 94/810 dead transitions. [2025-01-09 16:39:19,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 810 transitions, 3738 flow [2025-01-09 16:39:19,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-01-09 16:39:19,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2025-01-09 16:39:19,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 1070 transitions. [2025-01-09 16:39:19,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4503367003367003 [2025-01-09 16:39:19,467 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 112 flow. Second operand 66 states and 1070 transitions. [2025-01-09 16:39:19,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 810 transitions, 3738 flow [2025-01-09 16:39:19,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 810 transitions, 3679 flow, removed 11 selfloop flow, removed 2 redundant places. [2025-01-09 16:39:19,520 INFO L231 Difference]: Finished difference. Result has 126 places, 240 transitions, 1320 flow [2025-01-09 16:39:19,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=66, PETRI_FLOW=1320, PETRI_PLACES=126, PETRI_TRANSITIONS=240} [2025-01-09 16:39:19,520 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 91 predicate places. [2025-01-09 16:39:19,521 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 240 transitions, 1320 flow [2025-01-09 16:39:19,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.1923076923076925) internal successors, (187), 26 states have internal predecessors, (187), 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:39:19,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:19,521 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:19,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:39:19,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:19,722 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:39:19,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:19,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1539960221, now seen corresponding path program 2 times [2025-01-09 16:39:19,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:19,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348452215] [2025-01-09 16:39:19,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:39:19,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:19,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-01-09 16:39:19,785 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:39:19,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:39:19,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:20,633 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:20,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:20,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348452215] [2025-01-09 16:39:20,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348452215] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:20,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474693877] [2025-01-09 16:39:20,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:39:20,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:20,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:20,636 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:39:20,639 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:39:20,696 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-01-09 16:39:20,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:39:20,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:39:20,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:20,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 16:39:20,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:21,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 97 [2025-01-09 16:39:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:21,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:39:21,889 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 16:39:21,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 56 [2025-01-09 16:39:21,917 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:21,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474693877] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:39:21,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:39:21,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 29 [2025-01-09 16:39:21,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980637887] [2025-01-09 16:39:21,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:39:21,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 16:39:21,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:21,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 16:39:21,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2025-01-09 16:39:21,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:21,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 240 transitions, 1320 flow. Second operand has 29 states, 29 states have (on average 6.793103448275862) internal successors, (197), 29 states have internal predecessors, (197), 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:39:21,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:21,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:21,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:28,166 INFO L124 PetriNetUnfolderBase]: 19018/27902 cut-off events. [2025-01-09 16:39:28,167 INFO L125 PetriNetUnfolderBase]: For 108217/108217 co-relation queries the response was YES. [2025-01-09 16:39:28,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93030 conditions, 27902 events. 19018/27902 cut-off events. For 108217/108217 co-relation queries the response was YES. Maximal size of possible extension queue 932. Compared 175152 event pairs, 3550 based on Foata normal form. 2/27904 useless extension candidates. Maximal degree in co-relation 93000. Up to 6567 conditions per place. [2025-01-09 16:39:28,418 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 430 selfloop transitions, 290 changer transitions 24/745 dead transitions. [2025-01-09 16:39:28,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 745 transitions, 5454 flow [2025-01-09 16:39:28,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-01-09 16:39:28,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-01-09 16:39:28,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 500 transitions. [2025-01-09 16:39:28,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38580246913580246 [2025-01-09 16:39:28,421 INFO L175 Difference]: Start difference. First operand has 126 places, 240 transitions, 1320 flow. Second operand 36 states and 500 transitions. [2025-01-09 16:39:28,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 745 transitions, 5454 flow [2025-01-09 16:39:29,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 745 transitions, 4903 flow, removed 238 selfloop flow, removed 10 redundant places. [2025-01-09 16:39:29,420 INFO L231 Difference]: Finished difference. Result has 159 places, 434 transitions, 3429 flow [2025-01-09 16:39:29,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1159, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=3429, PETRI_PLACES=159, PETRI_TRANSITIONS=434} [2025-01-09 16:39:29,421 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 124 predicate places. [2025-01-09 16:39:29,423 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 434 transitions, 3429 flow [2025-01-09 16:39:29,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.793103448275862) internal successors, (197), 29 states have internal predecessors, (197), 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:39:29,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:29,423 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:29,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:39:29,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:29,624 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:39:29,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:29,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1593030303, now seen corresponding path program 3 times [2025-01-09 16:39:29,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:29,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119102242] [2025-01-09 16:39:29,624 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:39:29,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:29,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 3 equivalence classes. [2025-01-09 16:39:29,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 32 statements. [2025-01-09 16:39:29,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:39:29,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:30,143 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:30,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:30,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119102242] [2025-01-09 16:39:30,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119102242] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:30,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494998071] [2025-01-09 16:39:30,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:39:30,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:30,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:30,149 INFO L229 MonitoredProcess]: Starting monitored process 5 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:39:30,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:39:30,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 3 equivalence classes. [2025-01-09 16:39:30,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 32 statements. [2025-01-09 16:39:30,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:39:30,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:30,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 16:39:30,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:30,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 85 [2025-01-09 16:39:30,853 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:30,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:39:31,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:39:31,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 94 [2025-01-09 16:39:31,738 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:31,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494998071] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:39:31,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:39:31,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 26 [2025-01-09 16:39:31,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803141654] [2025-01-09 16:39:31,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:39:31,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 16:39:31,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:31,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 16:39:31,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2025-01-09 16:39:31,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:31,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 434 transitions, 3429 flow. Second operand has 26 states, 26 states have (on average 7.0) internal successors, (182), 26 states have internal predecessors, (182), 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:39:31,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:31,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:31,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:39,835 INFO L124 PetriNetUnfolderBase]: 32664/47982 cut-off events. [2025-01-09 16:39:39,835 INFO L125 PetriNetUnfolderBase]: For 334066/334066 co-relation queries the response was YES. [2025-01-09 16:39:40,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186881 conditions, 47982 events. 32664/47982 cut-off events. For 334066/334066 co-relation queries the response was YES. Maximal size of possible extension queue 1543. Compared 322204 event pairs, 6200 based on Foata normal form. 15/47997 useless extension candidates. Maximal degree in co-relation 186844. Up to 10050 conditions per place. [2025-01-09 16:39:40,452 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 637 selfloop transitions, 562 changer transitions 123/1323 dead transitions. [2025-01-09 16:39:40,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 1323 transitions, 12641 flow [2025-01-09 16:39:40,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-01-09 16:39:40,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2025-01-09 16:39:40,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 809 transitions. [2025-01-09 16:39:40,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3808851224105461 [2025-01-09 16:39:40,455 INFO L175 Difference]: Start difference. First operand has 159 places, 434 transitions, 3429 flow. Second operand 59 states and 809 transitions. [2025-01-09 16:39:40,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 1323 transitions, 12641 flow [2025-01-09 16:39:51,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 1323 transitions, 10933 flow, removed 798 selfloop flow, removed 4 redundant places. [2025-01-09 16:39:51,710 INFO L231 Difference]: Finished difference. Result has 247 places, 760 transitions, 7444 flow [2025-01-09 16:39:51,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2939, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=254, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=7444, PETRI_PLACES=247, PETRI_TRANSITIONS=760} [2025-01-09 16:39:51,710 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 212 predicate places. [2025-01-09 16:39:51,711 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 760 transitions, 7444 flow [2025-01-09 16:39:51,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.0) internal successors, (182), 26 states have internal predecessors, (182), 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:39:51,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:51,711 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:51,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 16:39:51,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 16:39:51,913 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:39:51,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:51,913 INFO L85 PathProgramCache]: Analyzing trace with hash -901384151, now seen corresponding path program 4 times [2025-01-09 16:39:51,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:51,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929153332] [2025-01-09 16:39:51,913 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:39:51,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:51,922 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-01-09 16:39:51,948 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:39:51,949 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:39:51,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:52,522 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:52,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:52,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929153332] [2025-01-09 16:39:52,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929153332] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:52,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120058260] [2025-01-09 16:39:52,522 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:39:52,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:52,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:52,525 INFO L229 MonitoredProcess]: Starting monitored process 6 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:39:52,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:39:52,590 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-01-09 16:39:52,614 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:39:52,615 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:39:52,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:52,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 16:39:52,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:52,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 96 [2025-01-09 16:39:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:53,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:39:53,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:39:53,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 62 [2025-01-09 16:39:53,972 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:53,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120058260] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:39:53,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:39:53,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2025-01-09 16:39:53,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054102879] [2025-01-09 16:39:53,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:39:53,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 16:39:53,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:53,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 16:39:53,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2025-01-09 16:39:53,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:53,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 760 transitions, 7444 flow. Second operand has 28 states, 28 states have (on average 6.892857142857143) internal successors, (193), 28 states have internal predecessors, (193), 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:39:53,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:53,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:53,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:04,149 INFO L124 PetriNetUnfolderBase]: 37629/55573 cut-off events. [2025-01-09 16:40:04,150 INFO L125 PetriNetUnfolderBase]: For 776767/776767 co-relation queries the response was YES. [2025-01-09 16:40:05,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249896 conditions, 55573 events. 37629/55573 cut-off events. For 776767/776767 co-relation queries the response was YES. Maximal size of possible extension queue 1849. Compared 385502 event pairs, 10890 based on Foata normal form. 3/55576 useless extension candidates. Maximal degree in co-relation 249825. Up to 19828 conditions per place. [2025-01-09 16:40:05,547 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 727 selfloop transitions, 603 changer transitions 27/1358 dead transitions. [2025-01-09 16:40:05,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 1358 transitions, 15595 flow [2025-01-09 16:40:05,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-01-09 16:40:05,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-01-09 16:40:05,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 544 transitions. [2025-01-09 16:40:05,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4084084084084084 [2025-01-09 16:40:05,548 INFO L175 Difference]: Start difference. First operand has 247 places, 760 transitions, 7444 flow. Second operand 37 states and 544 transitions. [2025-01-09 16:40:05,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 1358 transitions, 15595 flow [2025-01-09 16:40:23,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 1358 transitions, 14690 flow, removed 451 selfloop flow, removed 10 redundant places. [2025-01-09 16:40:23,374 INFO L231 Difference]: Finished difference. Result has 280 places, 967 transitions, 10778 flow [2025-01-09 16:40:23,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=6979, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=760, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=402, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=10778, PETRI_PLACES=280, PETRI_TRANSITIONS=967} [2025-01-09 16:40:23,375 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 245 predicate places. [2025-01-09 16:40:23,376 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 967 transitions, 10778 flow [2025-01-09 16:40:23,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.892857142857143) internal successors, (193), 28 states have internal predecessors, (193), 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,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:23,376 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:40:23,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 16:40:23,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:40:23,576 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:23,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:23,577 INFO L85 PathProgramCache]: Analyzing trace with hash -926821477, now seen corresponding path program 5 times [2025-01-09 16:40:23,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:23,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576789585] [2025-01-09 16:40:23,577 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:40:23,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:23,586 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 3 equivalence classes. [2025-01-09 16:40:23,610 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:40:23,611 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-09 16:40:23,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:40:24,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:24,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576789585] [2025-01-09 16:40:24,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576789585] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:40:24,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911784445] [2025-01-09 16:40:24,048 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:40:24,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:40:24,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:40:24,050 INFO L229 MonitoredProcess]: Starting monitored process 7 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:24,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 16:40:24,109 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 3 equivalence classes. [2025-01-09 16:40:24,138 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:40:24,138 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-09 16:40:24,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:24,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 16:40:24,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:40:24,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 85 [2025-01-09 16:40:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:40:24,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:40:25,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:40:25,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 94 [2025-01-09 16:40:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:40:25,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911784445] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:40:25,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:40:25,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 27 [2025-01-09 16:40:25,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691668693] [2025-01-09 16:40:25,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:40:25,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 16:40:25,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:25,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 16:40:25,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2025-01-09 16:40:25,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:40:25,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 967 transitions, 10778 flow. Second operand has 27 states, 27 states have (on average 6.62962962962963) internal successors, (179), 27 states have internal predecessors, (179), 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,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:25,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:40:25,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand