./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-nzb-file-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-nzb-file-subst.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 47976145f2a7f206dd7d2e7a0ffeac879f94f33f7a5b87161ebd997173567eb0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:39:06,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:39:06,929 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:06,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:39:06,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:39:06,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:39:06,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:39:06,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:39:06,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:39:06,966 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:39:06,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:39:06,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:39:06,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:39:06,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:39:06,968 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:39:06,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:39:06,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:39:06,968 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:39:06,969 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:39:06,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:39:06,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:39:06,969 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:39:06,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:39:06,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:39:06,969 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:39:06,969 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:39:06,970 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:39:06,970 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:39:06,970 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:39:06,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:39:06,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:39:06,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:39:06,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:39:06,971 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:39:06,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:39:06,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:39:06,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:39:06,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:39:06,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:39:06,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:39:06,972 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:39:06,972 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:39:06,972 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:39:06,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:39:06,972 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:39:06,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:39:06,972 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:39:06,972 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:39:06,972 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 -> 47976145f2a7f206dd7d2e7a0ffeac879f94f33f7a5b87161ebd997173567eb0 [2025-01-09 16:39:07,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:39:07,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:39:07,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:39:07,255 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:39:07,255 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:39:07,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-nzb-file-subst.wvr.c [2025-01-09 16:39:08,557 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4304d08d5/efd8af602c234396877acf71dca8f7b5/FLAG60494fdc6 [2025-01-09 16:39:08,872 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:39:08,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-nzb-file-subst.wvr.c [2025-01-09 16:39:08,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4304d08d5/efd8af602c234396877acf71dca8f7b5/FLAG60494fdc6 [2025-01-09 16:39:09,121 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4304d08d5/efd8af602c234396877acf71dca8f7b5 [2025-01-09 16:39:09,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:39:09,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:39:09,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:39:09,127 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:39:09,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:39:09,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:39:09" (1/1) ... [2025-01-09 16:39:09,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f9fcaa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:09, skipping insertion in model container [2025-01-09 16:39:09,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:39:09" (1/1) ... [2025-01-09 16:39:09,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:39:09,348 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-nzb-file-subst.wvr.c[6540,6553] [2025-01-09 16:39:09,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:39:09,375 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:39:09,429 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-nzb-file-subst.wvr.c[6540,6553] [2025-01-09 16:39:09,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:39:09,456 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:39:09,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:09 WrapperNode [2025-01-09 16:39:09,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:39:09,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:39:09,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:39:09,460 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:39:09,467 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:09" (1/1) ... [2025-01-09 16:39:09,481 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:09" (1/1) ... [2025-01-09 16:39:09,536 INFO L138 Inliner]: procedures = 25, calls = 61, calls flagged for inlining = 28, calls inlined = 42, statements flattened = 591 [2025-01-09 16:39:09,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:39:09,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:39:09,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:39:09,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:39:09,546 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:09" (1/1) ... [2025-01-09 16:39:09,547 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:09" (1/1) ... [2025-01-09 16:39:09,556 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:09" (1/1) ... [2025-01-09 16:39:09,585 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-01-09 16:39:09,585 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:09" (1/1) ... [2025-01-09 16:39:09,585 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:09" (1/1) ... [2025-01-09 16:39:09,606 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:09" (1/1) ... [2025-01-09 16:39:09,608 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:09" (1/1) ... [2025-01-09 16:39:09,614 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:09" (1/1) ... [2025-01-09 16:39:09,616 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:09" (1/1) ... [2025-01-09 16:39:09,618 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:09" (1/1) ... [2025-01-09 16:39:09,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:39:09,623 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:39:09,623 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:39:09,623 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:39:09,624 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:09" (1/1) ... [2025-01-09 16:39:09,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:39:09,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:09,660 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:09,666 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:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:39:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:39:09,685 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:39:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:39:09,686 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:39:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:39:09,686 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:39:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:39:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:39:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:39:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:39:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:39:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:39:09,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:39:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:39:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:39:09,689 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:09,826 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:39:09,828 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:39:10,556 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:39:10,557 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:39:11,362 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:39:11,363 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 16:39:11,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:39:11 BoogieIcfgContainer [2025-01-09 16:39:11,363 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:39:11,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:39:11,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:39:11,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:39:11,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:39:09" (1/3) ... [2025-01-09 16:39:11,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b54fe50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:39:11, skipping insertion in model container [2025-01-09 16:39:11,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:09" (2/3) ... [2025-01-09 16:39:11,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b54fe50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:39:11, skipping insertion in model container [2025-01-09 16:39:11,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:39:11" (3/3) ... [2025-01-09 16:39:11,373 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-subst.wvr.c [2025-01-09 16:39:11,388 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:39:11,391 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-subst.wvr.c that has 4 procedures, 38 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-09 16:39:11,392 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:39:11,558 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:39:11,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 49 transitions, 119 flow [2025-01-09 16:39:11,652 INFO L124 PetriNetUnfolderBase]: 12/46 cut-off events. [2025-01-09 16:39:11,654 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:39:11,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 12/46 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-01-09 16:39:11,660 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 49 transitions, 119 flow [2025-01-09 16:39:11,663 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 45 transitions, 108 flow [2025-01-09 16:39:11,673 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:39:11,690 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;@262011e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:39:11,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:39:11,723 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:39:11,724 INFO L124 PetriNetUnfolderBase]: 12/44 cut-off events. [2025-01-09 16:39:11,724 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:39:11,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:11,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:11,725 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:11,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:11,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1867896692, now seen corresponding path program 1 times [2025-01-09 16:39:11,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:11,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559869536] [2025-01-09 16:39:11,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:11,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:11,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:39:11,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:39:11,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:11,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:12,253 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:12,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:12,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559869536] [2025-01-09 16:39:12,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559869536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:12,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:12,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:39:12,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827798106] [2025-01-09 16:39:12,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:12,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:39:12,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:12,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:39:12,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:39:12,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:12,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 45 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:12,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:12,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:12,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:13,137 INFO L124 PetriNetUnfolderBase]: 2373/3237 cut-off events. [2025-01-09 16:39:13,138 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2025-01-09 16:39:13,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6649 conditions, 3237 events. 2373/3237 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12260 event pairs, 1692 based on Foata normal form. 0/2556 useless extension candidates. Maximal degree in co-relation 6206. Up to 3234 conditions per place. [2025-01-09 16:39:13,164 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 38 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2025-01-09 16:39:13,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 196 flow [2025-01-09 16:39:13,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:39:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:39:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-01-09 16:39:13,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4217687074829932 [2025-01-09 16:39:13,179 INFO L175 Difference]: Start difference. First operand has 43 places, 45 transitions, 108 flow. Second operand 3 states and 62 transitions. [2025-01-09 16:39:13,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 196 flow [2025-01-09 16:39:13,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:39:13,192 INFO L231 Difference]: Finished difference. Result has 40 places, 45 transitions, 122 flow [2025-01-09 16:39:13,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=40, PETRI_TRANSITIONS=45} [2025-01-09 16:39:13,198 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2025-01-09 16:39:13,199 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 45 transitions, 122 flow [2025-01-09 16:39:13,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:13,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:13,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:13,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:39:13,200 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:13,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:13,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1369665860, now seen corresponding path program 1 times [2025-01-09 16:39:13,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:13,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754196566] [2025-01-09 16:39:13,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:13,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:13,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:39:13,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:39:13,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:13,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:13,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:39:13,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:13,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754196566] [2025-01-09 16:39:13,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754196566] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:13,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316311652] [2025-01-09 16:39:13,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:13,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:13,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:13,495 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:13,497 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:13,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:39:13,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:39:13,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:13,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:13,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 16:39:13,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:13,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:39:13,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:39:13,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:39:13,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316311652] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:39:13,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:39:13,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-01-09 16:39:13,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631898642] [2025-01-09 16:39:13,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:39:13,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:39:13,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:13,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:39:13,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:39:13,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:13,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 45 transitions, 122 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:13,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:13,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:13,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:14,568 INFO L124 PetriNetUnfolderBase]: 2373/3246 cut-off events. [2025-01-09 16:39:14,569 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2025-01-09 16:39:14,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6574 conditions, 3246 events. 2373/3246 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12256 event pairs, 1692 based on Foata normal form. 6/2573 useless extension candidates. Maximal degree in co-relation 6525. Up to 3234 conditions per place. [2025-01-09 16:39:14,589 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 38 selfloop transitions, 15 changer transitions 0/54 dead transitions. [2025-01-09 16:39:14,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 264 flow [2025-01-09 16:39:14,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:39:14,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:39:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2025-01-09 16:39:14,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2925170068027211 [2025-01-09 16:39:14,594 INFO L175 Difference]: Start difference. First operand has 40 places, 45 transitions, 122 flow. Second operand 6 states and 86 transitions. [2025-01-09 16:39:14,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 264 flow [2025-01-09 16:39:14,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:39:14,598 INFO L231 Difference]: Finished difference. Result has 47 places, 54 transitions, 212 flow [2025-01-09 16:39:14,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=47, PETRI_TRANSITIONS=54} [2025-01-09 16:39:14,600 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2025-01-09 16:39:14,600 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 54 transitions, 212 flow [2025-01-09 16:39:14,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:14,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:14,601 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 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:14,610 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:14,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:14,802 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:14,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:14,803 INFO L85 PathProgramCache]: Analyzing trace with hash 998091822, now seen corresponding path program 2 times [2025-01-09 16:39:14,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:14,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135042885] [2025-01-09 16:39:14,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:39:14,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:14,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-09 16:39:15,053 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 36 statements. [2025-01-09 16:39:15,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:39:15,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:16,448 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:39:16,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:16,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135042885] [2025-01-09 16:39:16,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135042885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:16,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:16,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:39:16,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725269977] [2025-01-09 16:39:16,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:16,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:39:16,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:16,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:39:16,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:39:16,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:16,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 54 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:16,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:16,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:16,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:17,592 INFO L124 PetriNetUnfolderBase]: 3867/5443 cut-off events. [2025-01-09 16:39:17,592 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2025-01-09 16:39:17,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11022 conditions, 5443 events. 3867/5443 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 24866 event pairs, 1692 based on Foata normal form. 1/4412 useless extension candidates. Maximal degree in co-relation 10934. Up to 3132 conditions per place. [2025-01-09 16:39:17,623 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 111 selfloop transitions, 13 changer transitions 2/127 dead transitions. [2025-01-09 16:39:17,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 127 transitions, 623 flow [2025-01-09 16:39:17,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:39:17,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:39:17,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-01-09 16:39:17,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2025-01-09 16:39:17,626 INFO L175 Difference]: Start difference. First operand has 47 places, 54 transitions, 212 flow. Second operand 5 states and 135 transitions. [2025-01-09 16:39:17,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 127 transitions, 623 flow [2025-01-09 16:39:17,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 127 transitions, 599 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-01-09 16:39:17,631 INFO L231 Difference]: Finished difference. Result has 53 places, 66 transitions, 291 flow [2025-01-09 16:39:17,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=53, PETRI_TRANSITIONS=66} [2025-01-09 16:39:17,633 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2025-01-09 16:39:17,633 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 66 transitions, 291 flow [2025-01-09 16:39:17,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:17,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:17,634 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 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:17,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:39:17,635 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:17,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:17,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1713295804, now seen corresponding path program 3 times [2025-01-09 16:39:17,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:17,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390173203] [2025-01-09 16:39:17,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:39:17,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:17,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 3 equivalence classes. [2025-01-09 16:39:17,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 36 statements. [2025-01-09 16:39:17,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:39:17,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:39:18,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:18,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390173203] [2025-01-09 16:39:18,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390173203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:18,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:18,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:39:18,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120806674] [2025-01-09 16:39:18,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:18,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:39:18,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:18,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:39:18,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:39:18,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:18,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 66 transitions, 291 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:18,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:18,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:18,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:21,357 INFO L124 PetriNetUnfolderBase]: 9056/12714 cut-off events. [2025-01-09 16:39:21,357 INFO L125 PetriNetUnfolderBase]: For 6105/6105 co-relation queries the response was YES. [2025-01-09 16:39:21,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31637 conditions, 12714 events. 9056/12714 cut-off events. For 6105/6105 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 66545 event pairs, 2269 based on Foata normal form. 1/12419 useless extension candidates. Maximal degree in co-relation 31557. Up to 4719 conditions per place. [2025-01-09 16:39:21,521 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 143 selfloop transitions, 55 changer transitions 1/200 dead transitions. [2025-01-09 16:39:21,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 200 transitions, 1141 flow [2025-01-09 16:39:21,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:39:21,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:39:21,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 193 transitions. [2025-01-09 16:39:21,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5626822157434402 [2025-01-09 16:39:21,524 INFO L175 Difference]: Start difference. First operand has 53 places, 66 transitions, 291 flow. Second operand 7 states and 193 transitions. [2025-01-09 16:39:21,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 200 transitions, 1141 flow [2025-01-09 16:39:21,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 200 transitions, 1131 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-09 16:39:21,534 INFO L231 Difference]: Finished difference. Result has 63 places, 114 transitions, 787 flow [2025-01-09 16:39:21,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=787, PETRI_PLACES=63, PETRI_TRANSITIONS=114} [2025-01-09 16:39:21,534 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2025-01-09 16:39:21,535 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 114 transitions, 787 flow [2025-01-09 16:39:21,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:21,535 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 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:21,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:39:21,535 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:21,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:21,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1598274702, now seen corresponding path program 4 times [2025-01-09 16:39:21,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:21,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484412131] [2025-01-09 16:39:21,536 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:39:21,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:21,563 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-01-09 16:39:21,583 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:39:21,584 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:39:21,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:21,738 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 16:39:21,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:21,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484412131] [2025-01-09 16:39:21,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484412131] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:21,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755530217] [2025-01-09 16:39:21,739 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:39:21,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:21,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:21,743 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:21,746 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:21,907 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-01-09 16:39:21,955 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:39:21,955 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:39:21,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:21,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:39:21,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:22,026 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 16:39:22,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:39:22,066 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 16:39:22,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755530217] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:39:22,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:39:22,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-09 16:39:22,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222373823] [2025-01-09 16:39:22,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:39:22,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:39:22,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:22,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:39:22,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:39:22,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:22,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 114 transitions, 787 flow. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:22,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:22,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:22,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:23,894 INFO L124 PetriNetUnfolderBase]: 9056/12717 cut-off events. [2025-01-09 16:39:23,894 INFO L125 PetriNetUnfolderBase]: For 20987/20987 co-relation queries the response was YES. [2025-01-09 16:39:23,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38518 conditions, 12717 events. 9056/12717 cut-off events. For 20987/20987 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 65254 event pairs, 6332 based on Foata normal form. 1/12422 useless extension candidates. Maximal degree in co-relation 38422. Up to 12695 conditions per place. [2025-01-09 16:39:23,965 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 98 selfloop transitions, 18 changer transitions 0/117 dead transitions. [2025-01-09 16:39:23,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 117 transitions, 1037 flow [2025-01-09 16:39:23,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:39:23,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:39:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2025-01-09 16:39:23,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2536443148688047 [2025-01-09 16:39:23,967 INFO L175 Difference]: Start difference. First operand has 63 places, 114 transitions, 787 flow. Second operand 7 states and 87 transitions. [2025-01-09 16:39:23,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 117 transitions, 1037 flow [2025-01-09 16:39:24,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 117 transitions, 999 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-01-09 16:39:24,023 INFO L231 Difference]: Finished difference. Result has 70 places, 117 transitions, 817 flow [2025-01-09 16:39:24,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=817, PETRI_PLACES=70, PETRI_TRANSITIONS=117} [2025-01-09 16:39:24,024 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2025-01-09 16:39:24,024 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 117 transitions, 817 flow [2025-01-09 16:39:24,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:24,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:24,025 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:24,034 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:24,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:24,227 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:24,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:24,227 INFO L85 PathProgramCache]: Analyzing trace with hash 593340338, now seen corresponding path program 5 times [2025-01-09 16:39:24,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:24,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398735649] [2025-01-09 16:39:24,228 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:39:24,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:24,258 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-01-09 16:39:24,721 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 16:39:24,721 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-09 16:39:24,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:26,742 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 16:39:26,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:26,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398735649] [2025-01-09 16:39:26,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398735649] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:26,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83434958] [2025-01-09 16:39:26,743 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:39:26,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:26,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:26,745 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:26,747 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:26,913 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-01-09 16:39:27,177 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 16:39:27,177 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-09 16:39:27,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:27,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:39:27,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:28,467 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 16:39:28,468 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:39:28,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83434958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:28,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:39:28,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2025-01-09 16:39:28,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469811708] [2025-01-09 16:39:28,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:28,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:39:28,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:28,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:39:28,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:39:28,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:28,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 117 transitions, 817 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:28,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:28,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:28,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:30,362 INFO L124 PetriNetUnfolderBase]: 10177/14440 cut-off events. [2025-01-09 16:39:30,363 INFO L125 PetriNetUnfolderBase]: For 20525/20525 co-relation queries the response was YES. [2025-01-09 16:39:30,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41983 conditions, 14440 events. 10177/14440 cut-off events. For 20525/20525 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 77203 event pairs, 6082 based on Foata normal form. 1/14091 useless extension candidates. Maximal degree in co-relation 41866. Up to 12229 conditions per place. [2025-01-09 16:39:30,586 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 158 selfloop transitions, 6 changer transitions 8/173 dead transitions. [2025-01-09 16:39:30,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 173 transitions, 1410 flow [2025-01-09 16:39:30,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:39:30,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:39:30,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-01-09 16:39:30,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4326530612244898 [2025-01-09 16:39:30,588 INFO L175 Difference]: Start difference. First operand has 70 places, 117 transitions, 817 flow. Second operand 5 states and 106 transitions. [2025-01-09 16:39:30,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 173 transitions, 1410 flow [2025-01-09 16:39:30,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 173 transitions, 1374 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-01-09 16:39:30,641 INFO L231 Difference]: Finished difference. Result has 73 places, 120 transitions, 840 flow [2025-01-09 16:39:30,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=840, PETRI_PLACES=73, PETRI_TRANSITIONS=120} [2025-01-09 16:39:30,642 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2025-01-09 16:39:30,642 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 120 transitions, 840 flow [2025-01-09 16:39:30,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:30,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:30,642 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:30,652 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:30,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:30,843 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:30,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:30,844 INFO L85 PathProgramCache]: Analyzing trace with hash -566963502, now seen corresponding path program 6 times [2025-01-09 16:39:30,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:30,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612857128] [2025-01-09 16:39:30,844 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:39:30,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:30,862 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 4 equivalence classes. [2025-01-09 16:39:30,905 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 39 statements. [2025-01-09 16:39:30,905 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:39:30,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 16:39:31,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:31,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612857128] [2025-01-09 16:39:31,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612857128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:31,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:31,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:39:31,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999345225] [2025-01-09 16:39:31,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:31,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:39:31,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:31,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:39:31,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:39:31,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:31,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 120 transitions, 840 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:31,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:31,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:33,909 INFO L124 PetriNetUnfolderBase]: 10582/15031 cut-off events. [2025-01-09 16:39:33,909 INFO L125 PetriNetUnfolderBase]: For 25662/25662 co-relation queries the response was YES. [2025-01-09 16:39:33,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44553 conditions, 15031 events. 10582/15031 cut-off events. For 25662/25662 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 82080 event pairs, 4301 based on Foata normal form. 1/14682 useless extension candidates. Maximal degree in co-relation 44467. Up to 6846 conditions per place. [2025-01-09 16:39:34,001 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 140 selfloop transitions, 43 changer transitions 2/186 dead transitions. [2025-01-09 16:39:34,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 186 transitions, 1492 flow [2025-01-09 16:39:34,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:39:34,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:39:34,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-01-09 16:39:34,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2025-01-09 16:39:34,003 INFO L175 Difference]: Start difference. First operand has 73 places, 120 transitions, 840 flow. Second operand 5 states and 131 transitions. [2025-01-09 16:39:34,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 186 transitions, 1492 flow [2025-01-09 16:39:34,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 186 transitions, 1481 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-09 16:39:34,102 INFO L231 Difference]: Finished difference. Result has 77 places, 133 transitions, 1117 flow [2025-01-09 16:39:34,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1117, PETRI_PLACES=77, PETRI_TRANSITIONS=133} [2025-01-09 16:39:34,103 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2025-01-09 16:39:34,104 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 133 transitions, 1117 flow [2025-01-09 16:39:34,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:34,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:34,104 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:34,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:39:34,104 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:34,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:34,106 INFO L85 PathProgramCache]: Analyzing trace with hash 2064541084, now seen corresponding path program 7 times [2025-01-09 16:39:34,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:34,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414772345] [2025-01-09 16:39:34,106 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:39:34,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:34,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 16:39:34,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 16:39:34,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:34,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:35,548 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 16:39:35,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:35,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414772345] [2025-01-09 16:39:35,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414772345] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:35,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:35,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:39:35,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315600873] [2025-01-09 16:39:35,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:35,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:39:35,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:35,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:39:35,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:39:35,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:35,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 133 transitions, 1117 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:35,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:35,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:35,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:37,380 INFO L124 PetriNetUnfolderBase]: 11214/16006 cut-off events. [2025-01-09 16:39:37,380 INFO L125 PetriNetUnfolderBase]: For 36124/36124 co-relation queries the response was YES. [2025-01-09 16:39:37,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50159 conditions, 16006 events. 11214/16006 cut-off events. For 36124/36124 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 89351 event pairs, 5154 based on Foata normal form. 1/15657 useless extension candidates. Maximal degree in co-relation 50054. Up to 9191 conditions per place. [2025-01-09 16:39:37,461 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 164 selfloop transitions, 38 changer transitions 2/205 dead transitions. [2025-01-09 16:39:37,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 205 transitions, 1834 flow [2025-01-09 16:39:37,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:39:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:39:37,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-01-09 16:39:37,462 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2025-01-09 16:39:37,462 INFO L175 Difference]: Start difference. First operand has 77 places, 133 transitions, 1117 flow. Second operand 5 states and 135 transitions. [2025-01-09 16:39:37,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 205 transitions, 1834 flow [2025-01-09 16:39:37,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 205 transitions, 1782 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-09 16:39:37,581 INFO L231 Difference]: Finished difference. Result has 83 places, 143 transitions, 1329 flow [2025-01-09 16:39:37,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1329, PETRI_PLACES=83, PETRI_TRANSITIONS=143} [2025-01-09 16:39:37,582 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 40 predicate places. [2025-01-09 16:39:37,582 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 143 transitions, 1329 flow [2025-01-09 16:39:37,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:37,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:37,582 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:37,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:39:37,582 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:37,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:37,583 INFO L85 PathProgramCache]: Analyzing trace with hash -895200014, now seen corresponding path program 8 times [2025-01-09 16:39:37,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:37,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527947212] [2025-01-09 16:39:37,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:39:37,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:37,601 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-01-09 16:39:37,639 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 39 statements. [2025-01-09 16:39:37,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:39:37,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:38,151 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 16:39:38,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:38,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527947212] [2025-01-09 16:39:38,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527947212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:38,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:38,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:39:38,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910942089] [2025-01-09 16:39:38,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:38,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:39:38,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:38,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:39:38,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:39:38,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:38,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 143 transitions, 1329 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:38,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:38,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:38,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:40,536 INFO L124 PetriNetUnfolderBase]: 13749/19559 cut-off events. [2025-01-09 16:39:40,536 INFO L125 PetriNetUnfolderBase]: For 54021/54021 co-relation queries the response was YES. [2025-01-09 16:39:40,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62599 conditions, 19559 events. 13749/19559 cut-off events. For 54021/54021 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 111172 event pairs, 5937 based on Foata normal form. 1/19130 useless extension candidates. Maximal degree in co-relation 62491. Up to 9608 conditions per place. [2025-01-09 16:39:40,641 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 170 selfloop transitions, 61 changer transitions 2/234 dead transitions. [2025-01-09 16:39:40,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 234 transitions, 2343 flow [2025-01-09 16:39:40,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:39:40,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:39:40,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-01-09 16:39:40,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5265306122448979 [2025-01-09 16:39:40,642 INFO L175 Difference]: Start difference. First operand has 83 places, 143 transitions, 1329 flow. Second operand 5 states and 129 transitions. [2025-01-09 16:39:40,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 234 transitions, 2343 flow [2025-01-09 16:39:40,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 234 transitions, 2330 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-09 16:39:40,826 INFO L231 Difference]: Finished difference. Result has 90 places, 174 transitions, 1907 flow [2025-01-09 16:39:40,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1323, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1907, PETRI_PLACES=90, PETRI_TRANSITIONS=174} [2025-01-09 16:39:40,827 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 47 predicate places. [2025-01-09 16:39:40,828 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 174 transitions, 1907 flow [2025-01-09 16:39:40,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:40,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:40,828 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:40,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:39:40,828 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:39:40,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:40,829 INFO L85 PathProgramCache]: Analyzing trace with hash -844672892, now seen corresponding path program 1 times [2025-01-09 16:39:40,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:40,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427259571] [2025-01-09 16:39:40,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:40,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:40,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 16:39:40,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 16:39:40,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:40,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 16:39:40,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:40,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427259571] [2025-01-09 16:39:40,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427259571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:40,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:40,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:39:40,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455833306] [2025-01-09 16:39:40,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:40,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:39:40,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:40,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:39:40,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:39:40,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:40,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 174 transitions, 1907 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:40,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:40,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:40,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:43,552 INFO L124 PetriNetUnfolderBase]: 14662/20918 cut-off events. [2025-01-09 16:39:43,553 INFO L125 PetriNetUnfolderBase]: For 76924/76924 co-relation queries the response was YES. [2025-01-09 16:39:43,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72134 conditions, 20918 events. 14662/20918 cut-off events. For 76924/76924 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 121542 event pairs, 5301 based on Foata normal form. 4/20492 useless extension candidates. Maximal degree in co-relation 72023. Up to 14298 conditions per place. [2025-01-09 16:39:43,638 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 175 selfloop transitions, 13 changer transitions 60/249 dead transitions. [2025-01-09 16:39:43,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 249 transitions, 3025 flow [2025-01-09 16:39:43,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:39:43,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:39:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-01-09 16:39:43,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5255102040816326 [2025-01-09 16:39:43,639 INFO L175 Difference]: Start difference. First operand has 90 places, 174 transitions, 1907 flow. Second operand 4 states and 103 transitions. [2025-01-09 16:39:43,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 249 transitions, 3025 flow [2025-01-09 16:39:43,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 249 transitions, 3009 flow, removed 8 selfloop flow, removed 0 redundant places. [2025-01-09 16:39:43,884 INFO L231 Difference]: Finished difference. Result has 96 places, 158 transitions, 1745 flow [2025-01-09 16:39:43,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1745, PETRI_PLACES=96, PETRI_TRANSITIONS=158} [2025-01-09 16:39:43,886 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 53 predicate places. [2025-01-09 16:39:43,886 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 158 transitions, 1745 flow [2025-01-09 16:39:43,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:43,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:43,886 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:43,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:39:43,886 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:43,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:43,887 INFO L85 PathProgramCache]: Analyzing trace with hash 142562768, now seen corresponding path program 1 times [2025-01-09 16:39:43,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:43,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744205917] [2025-01-09 16:39:43,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:43,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:43,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 16:39:43,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 16:39:43,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:43,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:44,070 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 16:39:44,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:44,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744205917] [2025-01-09 16:39:44,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744205917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:44,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:44,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:39:44,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411582894] [2025-01-09 16:39:44,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:44,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:39:44,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:44,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:39:44,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:39:44,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:44,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 158 transitions, 1745 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:44,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:44,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:44,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:45,958 INFO L124 PetriNetUnfolderBase]: 12816/18367 cut-off events. [2025-01-09 16:39:45,958 INFO L125 PetriNetUnfolderBase]: For 67296/67296 co-relation queries the response was YES. [2025-01-09 16:39:46,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62813 conditions, 18367 events. 12816/18367 cut-off events. For 67296/67296 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 104469 event pairs, 6842 based on Foata normal form. 5/17942 useless extension candidates. Maximal degree in co-relation 62716. Up to 11238 conditions per place. [2025-01-09 16:39:46,048 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 156 selfloop transitions, 6 changer transitions 49/212 dead transitions. [2025-01-09 16:39:46,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 212 transitions, 2505 flow [2025-01-09 16:39:46,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:39:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:39:46,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-01-09 16:39:46,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5204081632653061 [2025-01-09 16:39:46,050 INFO L175 Difference]: Start difference. First operand has 96 places, 158 transitions, 1745 flow. Second operand 4 states and 102 transitions. [2025-01-09 16:39:46,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 212 transitions, 2505 flow [2025-01-09 16:39:46,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 212 transitions, 2461 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-01-09 16:39:46,194 INFO L231 Difference]: Finished difference. Result has 98 places, 138 transitions, 1409 flow [2025-01-09 16:39:46,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1710, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1409, PETRI_PLACES=98, PETRI_TRANSITIONS=138} [2025-01-09 16:39:46,195 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 55 predicate places. [2025-01-09 16:39:46,195 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 138 transitions, 1409 flow [2025-01-09 16:39:46,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:46,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:46,195 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:46,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:39:46,195 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:46,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:46,196 INFO L85 PathProgramCache]: Analyzing trace with hash 848993094, now seen corresponding path program 2 times [2025-01-09 16:39:46,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:46,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861543939] [2025-01-09 16:39:46,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:39:46,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:46,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-09 16:39:46,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 42 statements. [2025-01-09 16:39:46,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:39:46,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:46,315 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 16:39:46,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:46,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861543939] [2025-01-09 16:39:46,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861543939] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:46,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:46,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:39:46,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356726619] [2025-01-09 16:39:46,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:46,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:39:46,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:46,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:39:46,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:39:46,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:46,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 138 transitions, 1409 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:46,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:46,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:46,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:48,761 INFO L124 PetriNetUnfolderBase]: 16769/23619 cut-off events. [2025-01-09 16:39:48,761 INFO L125 PetriNetUnfolderBase]: For 70762/70762 co-relation queries the response was YES. [2025-01-09 16:39:48,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76476 conditions, 23619 events. 16769/23619 cut-off events. For 70762/70762 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 135631 event pairs, 4869 based on Foata normal form. 1/22648 useless extension candidates. Maximal degree in co-relation 76443. Up to 10518 conditions per place. [2025-01-09 16:39:49,219 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 206 selfloop transitions, 35 changer transitions 10/252 dead transitions. [2025-01-09 16:39:49,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 252 transitions, 2683 flow [2025-01-09 16:39:49,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:39:49,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:39:49,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2025-01-09 16:39:49,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.563265306122449 [2025-01-09 16:39:49,220 INFO L175 Difference]: Start difference. First operand has 98 places, 138 transitions, 1409 flow. Second operand 5 states and 138 transitions. [2025-01-09 16:39:49,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 252 transitions, 2683 flow [2025-01-09 16:39:49,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 252 transitions, 2620 flow, removed 27 selfloop flow, removed 2 redundant places. [2025-01-09 16:39:49,378 INFO L231 Difference]: Finished difference. Result has 102 places, 156 transitions, 1687 flow [2025-01-09 16:39:49,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1371, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1687, PETRI_PLACES=102, PETRI_TRANSITIONS=156} [2025-01-09 16:39:49,378 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 59 predicate places. [2025-01-09 16:39:49,378 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 156 transitions, 1687 flow [2025-01-09 16:39:49,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:49,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:49,379 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:49,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:39:49,379 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:49,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:49,380 INFO L85 PathProgramCache]: Analyzing trace with hash -678969294, now seen corresponding path program 3 times [2025-01-09 16:39:49,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:49,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551028855] [2025-01-09 16:39:49,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:39:49,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:49,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 4 equivalence classes. [2025-01-09 16:39:49,401 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 42 statements. [2025-01-09 16:39:49,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:39:49,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 16:39:49,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:49,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551028855] [2025-01-09 16:39:49,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551028855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:49,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:49,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:39:49,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307898255] [2025-01-09 16:39:49,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:49,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:39:49,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:49,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:39:49,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:39:49,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:49,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 156 transitions, 1687 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:49,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:49,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:49,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:52,832 INFO L124 PetriNetUnfolderBase]: 18331/25924 cut-off events. [2025-01-09 16:39:52,832 INFO L125 PetriNetUnfolderBase]: For 82568/82568 co-relation queries the response was YES. [2025-01-09 16:39:52,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86771 conditions, 25924 events. 18331/25924 cut-off events. For 82568/82568 co-relation queries the response was YES. Maximal size of possible extension queue 932. Compared 153032 event pairs, 5105 based on Foata normal form. 4/25928 useless extension candidates. Maximal degree in co-relation 86736. Up to 10142 conditions per place. [2025-01-09 16:39:53,225 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 212 selfloop transitions, 42 changer transitions 38/293 dead transitions. [2025-01-09 16:39:53,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 293 transitions, 3056 flow [2025-01-09 16:39:53,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:39:53,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:39:53,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2025-01-09 16:39:53,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020408163265306 [2025-01-09 16:39:53,226 INFO L175 Difference]: Start difference. First operand has 102 places, 156 transitions, 1687 flow. Second operand 6 states and 177 transitions. [2025-01-09 16:39:53,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 293 transitions, 3056 flow [2025-01-09 16:39:53,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 293 transitions, 2992 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-01-09 16:39:53,423 INFO L231 Difference]: Finished difference. Result has 106 places, 148 transitions, 1537 flow [2025-01-09 16:39:53,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1643, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1537, PETRI_PLACES=106, PETRI_TRANSITIONS=148} [2025-01-09 16:39:53,424 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 63 predicate places. [2025-01-09 16:39:53,424 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 148 transitions, 1537 flow [2025-01-09 16:39:53,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:53,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:53,424 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:53,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:39:53,425 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:53,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:53,425 INFO L85 PathProgramCache]: Analyzing trace with hash -459243572, now seen corresponding path program 1 times [2025-01-09 16:39:53,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:53,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881963510] [2025-01-09 16:39:53,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:53,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:53,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 16:39:53,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 16:39:53,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:53,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:53,553 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 16:39:53,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:53,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881963510] [2025-01-09 16:39:53,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881963510] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:53,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:53,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:39:53,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60416180] [2025-01-09 16:39:53,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:53,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:39:53,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:53,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:39:53,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:39:53,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:53,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 148 transitions, 1537 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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:53,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:53,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:53,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:57,009 INFO L124 PetriNetUnfolderBase]: 18392/25920 cut-off events. [2025-01-09 16:39:57,009 INFO L125 PetriNetUnfolderBase]: For 92416/92416 co-relation queries the response was YES. [2025-01-09 16:39:57,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90148 conditions, 25920 events. 18392/25920 cut-off events. For 92416/92416 co-relation queries the response was YES. Maximal size of possible extension queue 848. Compared 148598 event pairs, 11044 based on Foata normal form. 674/26594 useless extension candidates. Maximal degree in co-relation 90112. Up to 19225 conditions per place. [2025-01-09 16:39:57,207 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 157 selfloop transitions, 26 changer transitions 1/185 dead transitions. [2025-01-09 16:39:57,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 185 transitions, 2160 flow [2025-01-09 16:39:57,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:39:57,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:39:57,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2025-01-09 16:39:57,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2025-01-09 16:39:57,208 INFO L175 Difference]: Start difference. First operand has 106 places, 148 transitions, 1537 flow. Second operand 3 states and 78 transitions. [2025-01-09 16:39:57,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 185 transitions, 2160 flow [2025-01-09 16:39:57,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 185 transitions, 2081 flow, removed 27 selfloop flow, removed 7 redundant places. [2025-01-09 16:39:57,508 INFO L231 Difference]: Finished difference. Result has 100 places, 146 transitions, 1537 flow [2025-01-09 16:39:57,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1433, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1537, PETRI_PLACES=100, PETRI_TRANSITIONS=146} [2025-01-09 16:39:57,509 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places. [2025-01-09 16:39:57,509 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 146 transitions, 1537 flow [2025-01-09 16:39:57,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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:57,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:57,509 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:57,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:39:57,509 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:57,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:57,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1079960692, now seen corresponding path program 2 times [2025-01-09 16:39:57,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:57,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893593977] [2025-01-09 16:39:57,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:39:57,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:57,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-09 16:39:57,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 42 statements. [2025-01-09 16:39:57,530 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:39:57,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:57,620 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 16:39:57,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:57,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893593977] [2025-01-09 16:39:57,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893593977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:57,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:57,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:39:57,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207920021] [2025-01-09 16:39:57,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:57,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:39:57,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:57,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:39:57,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:39:57,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:57,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 146 transitions, 1537 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:57,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:57,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:57,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:01,613 INFO L124 PetriNetUnfolderBase]: 18392/25916 cut-off events. [2025-01-09 16:40:01,613 INFO L125 PetriNetUnfolderBase]: For 92757/92757 co-relation queries the response was YES. [2025-01-09 16:40:01,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90955 conditions, 25916 events. 18392/25916 cut-off events. For 92757/92757 co-relation queries the response was YES. Maximal size of possible extension queue 845. Compared 149312 event pairs, 7859 based on Foata normal form. 2/25918 useless extension candidates. Maximal degree in co-relation 90924. Up to 24299 conditions per place. [2025-01-09 16:40:02,098 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 135 selfloop transitions, 12 changer transitions 29/177 dead transitions. [2025-01-09 16:40:02,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 177 transitions, 2017 flow [2025-01-09 16:40:02,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:40:02,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:40:02,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-01-09 16:40:02,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45918367346938777 [2025-01-09 16:40:02,100 INFO L175 Difference]: Start difference. First operand has 100 places, 146 transitions, 1537 flow. Second operand 4 states and 90 transitions. [2025-01-09 16:40:02,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 177 transitions, 2017 flow [2025-01-09 16:40:02,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 177 transitions, 1991 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:40:02,241 INFO L231 Difference]: Finished difference. Result has 103 places, 131 transitions, 1350 flow [2025-01-09 16:40:02,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1511, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1350, PETRI_PLACES=103, PETRI_TRANSITIONS=131} [2025-01-09 16:40:02,242 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 60 predicate places. [2025-01-09 16:40:02,242 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 131 transitions, 1350 flow [2025-01-09 16:40:02,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:02,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:02,242 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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, 1, 1] [2025-01-09 16:40:02,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:40:02,242 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:02,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:02,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1036522248, now seen corresponding path program 1 times [2025-01-09 16:40:02,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:02,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133226068] [2025-01-09 16:40:02,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:40:02,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:02,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 16:40:02,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 16:40:02,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:40:02,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:02,886 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-01-09 16:40:02,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:02,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133226068] [2025-01-09 16:40:02,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133226068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:02,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:02,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:02,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377981264] [2025-01-09 16:40:02,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:02,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:02,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:02,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:02,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:02,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:40:02,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 131 transitions, 1350 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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:02,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:02,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:40:02,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand