./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-channel-sum.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/popl20-channel-sum.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 bc55f480d2dabcba35697f502078f181c178ae095f610e1cdbc5d03f14d18670 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:43:07,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:43:07,840 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:43:07,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:43:07,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:43:07,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:43:07,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:43:07,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:43:07,858 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:43:07,858 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:43:07,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:43:07,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:43:07,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:43:07,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:43:07,859 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:43:07,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:43:07,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:43:07,859 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:43:07,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:43:07,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:43:07,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:43:07,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:43:07,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:43:07,860 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:43:07,860 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:43:07,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:43:07,860 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:43:07,860 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:43:07,860 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:43:07,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:43:07,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:43:07,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:43:07,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:43:07,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:43:07,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:43:07,861 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:43:07,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:43:07,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:43:07,861 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:43:07,861 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:43:07,861 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:43:07,861 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:43:07,861 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:43:07,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:43:07,861 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:43:07,861 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:43:07,862 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:43:07,862 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:43:07,862 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 -> bc55f480d2dabcba35697f502078f181c178ae095f610e1cdbc5d03f14d18670 [2025-01-09 16:43:08,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:43:08,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:43:08,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:43:08,127 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:43:08,127 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:43:08,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c [2025-01-09 16:43:09,272 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/323a7c1c3/882577feae1d44f588801a895b4401e3/FLAGc455964b7 [2025-01-09 16:43:09,488 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:43:09,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c [2025-01-09 16:43:09,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/323a7c1c3/882577feae1d44f588801a895b4401e3/FLAGc455964b7 [2025-01-09 16:43:09,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/323a7c1c3/882577feae1d44f588801a895b4401e3 [2025-01-09 16:43:09,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:43:09,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:43:09,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:43:09,838 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:43:09,841 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:43:09,841 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:43:09" (1/1) ... [2025-01-09 16:43:09,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@788e81ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:09, skipping insertion in model container [2025-01-09 16:43:09,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:43:09" (1/1) ... [2025-01-09 16:43:09,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:43:09,965 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/popl20-channel-sum.wvr.c[2423,2436] [2025-01-09 16:43:09,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:43:09,986 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:43:09,998 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/popl20-channel-sum.wvr.c[2423,2436] [2025-01-09 16:43:10,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:43:10,018 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:43:10,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:10 WrapperNode [2025-01-09 16:43:10,021 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:43:10,022 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:43:10,022 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:43:10,022 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:43:10,028 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:43:10" (1/1) ... [2025-01-09 16:43:10,034 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:43:10" (1/1) ... [2025-01-09 16:43:10,045 INFO L138 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 128 [2025-01-09 16:43:10,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:43:10,046 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:43:10,046 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:43:10,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:43:10,052 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:10" (1/1) ... [2025-01-09 16:43:10,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:10" (1/1) ... [2025-01-09 16:43:10,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:10" (1/1) ... [2025-01-09 16:43:10,061 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-09 16:43:10,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:10" (1/1) ... [2025-01-09 16:43:10,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:10" (1/1) ... [2025-01-09 16:43:10,064 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:10" (1/1) ... [2025-01-09 16:43:10,066 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:10" (1/1) ... [2025-01-09 16:43:10,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:10" (1/1) ... [2025-01-09 16:43:10,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:10" (1/1) ... [2025-01-09 16:43:10,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:10" (1/1) ... [2025-01-09 16:43:10,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:43:10,071 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:43:10,071 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:43:10,071 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:43:10,072 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:10" (1/1) ... [2025-01-09 16:43:10,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:43:10,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:10,097 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:43:10,101 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:43:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:43:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:43:10,118 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:43:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:43:10,118 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:43:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:43:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:43:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:43:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:43:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:43:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:43:10,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:43:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:43:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:43:10,120 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:43:10,195 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:43:10,197 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:43:10,400 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:43:10,401 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:43:10,530 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:43:10,530 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:43:10,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:43:10 BoogieIcfgContainer [2025-01-09 16:43:10,530 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:43:10,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:43:10,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:43:10,536 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:43:10,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:43:09" (1/3) ... [2025-01-09 16:43:10,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a53357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:43:10, skipping insertion in model container [2025-01-09 16:43:10,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:10" (2/3) ... [2025-01-09 16:43:10,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a53357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:43:10, skipping insertion in model container [2025-01-09 16:43:10,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:43:10" (3/3) ... [2025-01-09 16:43:10,539 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2025-01-09 16:43:10,548 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:43:10,550 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-channel-sum.wvr.c that has 3 procedures, 32 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-09 16:43:10,550 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:43:10,595 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:43:10,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 36 transitions, 86 flow [2025-01-09 16:43:10,643 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2025-01-09 16:43:10,644 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:43:10,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 34 events. 5/34 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-01-09 16:43:10,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 36 transitions, 86 flow [2025-01-09 16:43:10,651 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 33 transitions, 78 flow [2025-01-09 16:43:10,656 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:43:10,664 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;@75b3185d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:43:10,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:43:10,672 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:43:10,672 INFO L124 PetriNetUnfolderBase]: 5/32 cut-off events. [2025-01-09 16:43:10,672 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:43:10,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:10,672 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:10,673 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:43:10,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:10,676 INFO L85 PathProgramCache]: Analyzing trace with hash 876496874, now seen corresponding path program 1 times [2025-01-09 16:43:10,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:10,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144588565] [2025-01-09 16:43:10,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:10,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:10,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 16:43:10,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:43:10,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:10,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:10,839 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:43:10,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:10,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144588565] [2025-01-09 16:43:10,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144588565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:10,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:10,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:43:10,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441011519] [2025-01-09 16:43:10,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:10,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:43:10,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:10,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:43:10,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:43:10,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-01-09 16:43:10,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 78 flow. Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:10,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:10,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-01-09 16:43:10,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:10,983 INFO L124 PetriNetUnfolderBase]: 203/343 cut-off events. [2025-01-09 16:43:10,983 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-01-09 16:43:10,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 343 events. 203/343 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1216 event pairs, 137 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 599. Up to 306 conditions per place. [2025-01-09 16:43:10,987 INFO L140 encePairwiseOnDemand]: 35/36 looper letters, 24 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2025-01-09 16:43:10,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 124 flow [2025-01-09 16:43:10,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:43:10,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 16:43:10,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2025-01-09 16:43:10,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-01-09 16:43:10,998 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 78 flow. Second operand 2 states and 45 transitions. [2025-01-09 16:43:10,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 124 flow [2025-01-09 16:43:11,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 116 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 16:43:11,002 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 68 flow [2025-01-09 16:43:11,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=32, PETRI_TRANSITIONS=32} [2025-01-09 16:43:11,006 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2025-01-09 16:43:11,006 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 68 flow [2025-01-09 16:43:11,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:11,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:11,006 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] [2025-01-09 16:43:11,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:43:11,007 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:43:11,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:11,007 INFO L85 PathProgramCache]: Analyzing trace with hash -135633428, now seen corresponding path program 1 times [2025-01-09 16:43:11,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:11,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63266139] [2025-01-09 16:43:11,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:11,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:11,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:43:11,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:43:11,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:11,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:11,155 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:43:11,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:11,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63266139] [2025-01-09 16:43:11,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63266139] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:11,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:11,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:43:11,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839280751] [2025-01-09 16:43:11,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:11,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:43:11,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:11,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:43:11,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:43:11,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-01-09 16:43:11,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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:43:11,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:11,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-01-09 16:43:11,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:11,260 INFO L124 PetriNetUnfolderBase]: 278/494 cut-off events. [2025-01-09 16:43:11,260 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 16:43:11,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 494 events. 278/494 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2104 event pairs, 108 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 965. Up to 252 conditions per place. [2025-01-09 16:43:11,262 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 38 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2025-01-09 16:43:11,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 50 transitions, 191 flow [2025-01-09 16:43:11,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:43:11,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:43:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-01-09 16:43:11,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6759259259259259 [2025-01-09 16:43:11,263 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 68 flow. Second operand 3 states and 73 transitions. [2025-01-09 16:43:11,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 50 transitions, 191 flow [2025-01-09 16:43:11,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 50 transitions, 191 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:43:11,265 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 80 flow [2025-01-09 16:43:11,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2025-01-09 16:43:11,266 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2025-01-09 16:43:11,266 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 80 flow [2025-01-09 16:43:11,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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:43:11,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:11,266 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] [2025-01-09 16:43:11,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:43:11,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:43:11,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:11,267 INFO L85 PathProgramCache]: Analyzing trace with hash 259619789, now seen corresponding path program 1 times [2025-01-09 16:43:11,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:11,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307411256] [2025-01-09 16:43:11,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:11,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:11,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:43:11,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:43:11,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:11,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:11,320 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:43:11,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:11,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307411256] [2025-01-09 16:43:11,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307411256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:11,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:11,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:43:11,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677951406] [2025-01-09 16:43:11,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:11,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:43:11,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:11,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:43:11,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:43:11,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-01-09 16:43:11,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:11,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:11,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-01-09 16:43:11,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:11,438 INFO L124 PetriNetUnfolderBase]: 282/531 cut-off events. [2025-01-09 16:43:11,439 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 16:43:11,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 531 events. 282/531 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1957 event pairs, 114 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 1088. Up to 341 conditions per place. [2025-01-09 16:43:11,442 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 33 selfloop transitions, 6 changer transitions 1/46 dead transitions. [2025-01-09 16:43:11,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 190 flow [2025-01-09 16:43:11,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:43:11,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:43:11,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-01-09 16:43:11,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2025-01-09 16:43:11,443 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 80 flow. Second operand 3 states and 64 transitions. [2025-01-09 16:43:11,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 190 flow [2025-01-09 16:43:11,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:43:11,445 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 106 flow [2025-01-09 16:43:11,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2025-01-09 16:43:11,445 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2025-01-09 16:43:11,445 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 106 flow [2025-01-09 16:43:11,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:11,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:11,446 INFO L206 CegarLoopForPetriNet]: trace histogram [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:43:11,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:43:11,446 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:43:11,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:11,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1884701496, now seen corresponding path program 1 times [2025-01-09 16:43:11,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:11,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234948004] [2025-01-09 16:43:11,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:11,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:11,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:43:11,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:43:11,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:11,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:43:11,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:11,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234948004] [2025-01-09 16:43:11,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234948004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:11,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:11,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:43:11,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165914808] [2025-01-09 16:43:11,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:11,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:43:11,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:11,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:43:11,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:43:11,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-01-09 16:43:11,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:43:11,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:11,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-01-09 16:43:11,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:11,692 INFO L124 PetriNetUnfolderBase]: 262/514 cut-off events. [2025-01-09 16:43:11,693 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2025-01-09 16:43:11,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1184 conditions, 514 events. 262/514 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1907 event pairs, 203 based on Foata normal form. 0/454 useless extension candidates. Maximal degree in co-relation 1178. Up to 471 conditions per place. [2025-01-09 16:43:11,696 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 25 selfloop transitions, 3 changer transitions 9/45 dead transitions. [2025-01-09 16:43:11,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 202 flow [2025-01-09 16:43:11,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:43:11,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:43:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-01-09 16:43:11,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2025-01-09 16:43:11,698 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 106 flow. Second operand 4 states and 75 transitions. [2025-01-09 16:43:11,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 202 flow [2025-01-09 16:43:11,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 196 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:43:11,701 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 118 flow [2025-01-09 16:43:11,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2025-01-09 16:43:11,702 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2025-01-09 16:43:11,702 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 118 flow [2025-01-09 16:43:11,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:43:11,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:11,703 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1] [2025-01-09 16:43:11,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:43:11,703 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:43:11,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:11,704 INFO L85 PathProgramCache]: Analyzing trace with hash 572083366, now seen corresponding path program 1 times [2025-01-09 16:43:11,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:11,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427552331] [2025-01-09 16:43:11,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:11,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:11,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:43:11,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:43:11,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:11,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:12,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:12,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:12,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427552331] [2025-01-09 16:43:12,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427552331] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:12,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25262031] [2025-01-09 16:43:12,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:12,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:12,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:12,445 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:43:12,447 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:43:12,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:43:12,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:43:12,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:12,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:12,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 16:43:12,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:43:12,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-09 16:43:12,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:12,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:43:13,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2025-01-09 16:43:13,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:43:13,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 68 [2025-01-09 16:43:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:13,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25262031] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:43:13,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:43:13,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2025-01-09 16:43:13,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16438234] [2025-01-09 16:43:13,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:43:13,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 16:43:13,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:13,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 16:43:13,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2025-01-09 16:43:13,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-01-09 16:43:13,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 118 flow. Second operand has 27 states, 27 states have (on average 10.481481481481481) internal successors, (283), 27 states have internal predecessors, (283), 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:43:13,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:13,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-01-09 16:43:13,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:15,330 INFO L124 PetriNetUnfolderBase]: 1163/2175 cut-off events. [2025-01-09 16:43:15,331 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2025-01-09 16:43:15,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4957 conditions, 2175 events. 1163/2175 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12898 event pairs, 64 based on Foata normal form. 4/1957 useless extension candidates. Maximal degree in co-relation 4949. Up to 370 conditions per place. [2025-01-09 16:43:15,341 INFO L140 encePairwiseOnDemand]: 20/36 looper letters, 205 selfloop transitions, 103 changer transitions 86/400 dead transitions. [2025-01-09 16:43:15,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 400 transitions, 1929 flow [2025-01-09 16:43:15,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-01-09 16:43:15,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2025-01-09 16:43:15,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 807 transitions. [2025-01-09 16:43:15,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4310897435897436 [2025-01-09 16:43:15,346 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 118 flow. Second operand 52 states and 807 transitions. [2025-01-09 16:43:15,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 400 transitions, 1929 flow [2025-01-09 16:43:15,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 400 transitions, 1865 flow, removed 29 selfloop flow, removed 3 redundant places. [2025-01-09 16:43:15,351 INFO L231 Difference]: Finished difference. Result has 112 places, 155 transitions, 891 flow [2025-01-09 16:43:15,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=891, PETRI_PLACES=112, PETRI_TRANSITIONS=155} [2025-01-09 16:43:15,352 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 77 predicate places. [2025-01-09 16:43:15,352 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 155 transitions, 891 flow [2025-01-09 16:43:15,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 10.481481481481481) internal successors, (283), 27 states have internal predecessors, (283), 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:43:15,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:15,353 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1] [2025-01-09 16:43:15,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 16:43:15,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:15,554 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:43:15,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:15,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1465026391, now seen corresponding path program 1 times [2025-01-09 16:43:15,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:15,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370357852] [2025-01-09 16:43:15,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:15,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:15,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:43:15,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:43:15,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:15,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:43:15,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:15,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370357852] [2025-01-09 16:43:15,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370357852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:15,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:15,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:43:15,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871856110] [2025-01-09 16:43:15,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:15,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:43:15,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:15,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:43:15,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:43:15,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2025-01-09 16:43:15,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 155 transitions, 891 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:43:15,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:15,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2025-01-09 16:43:15,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:15,736 INFO L124 PetriNetUnfolderBase]: 734/1324 cut-off events. [2025-01-09 16:43:15,736 INFO L125 PetriNetUnfolderBase]: For 3722/3722 co-relation queries the response was YES. [2025-01-09 16:43:15,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4653 conditions, 1324 events. 734/1324 cut-off events. For 3722/3722 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 6361 event pairs, 213 based on Foata normal form. 2/1303 useless extension candidates. Maximal degree in co-relation 4623. Up to 1153 conditions per place. [2025-01-09 16:43:15,746 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 120 selfloop transitions, 2 changer transitions 4/133 dead transitions. [2025-01-09 16:43:15,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 133 transitions, 1028 flow [2025-01-09 16:43:15,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:43:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:43:15,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-01-09 16:43:15,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-01-09 16:43:15,747 INFO L175 Difference]: Start difference. First operand has 112 places, 155 transitions, 891 flow. Second operand 3 states and 66 transitions. [2025-01-09 16:43:15,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 133 transitions, 1028 flow [2025-01-09 16:43:15,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 133 transitions, 895 flow, removed 44 selfloop flow, removed 15 redundant places. [2025-01-09 16:43:15,764 INFO L231 Difference]: Finished difference. Result has 78 places, 109 transitions, 531 flow [2025-01-09 16:43:15,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=531, PETRI_PLACES=78, PETRI_TRANSITIONS=109} [2025-01-09 16:43:15,766 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 43 predicate places. [2025-01-09 16:43:15,766 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 109 transitions, 531 flow [2025-01-09 16:43:15,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:43:15,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:15,766 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:15,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:43:15,766 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:43:15,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:15,769 INFO L85 PathProgramCache]: Analyzing trace with hash -110625647, now seen corresponding path program 2 times [2025-01-09 16:43:15,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:15,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548743068] [2025-01-09 16:43:15,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:43:15,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:15,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-09 16:43:15,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 16:43:15,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:43:15,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:15,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:43:15,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:15,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548743068] [2025-01-09 16:43:15,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548743068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:15,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:15,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:43:15,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541583922] [2025-01-09 16:43:15,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:15,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:43:15,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:15,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:43:15,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:43:15,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-01-09 16:43:15,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 109 transitions, 531 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:43:15,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:15,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-01-09 16:43:15,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:16,012 INFO L124 PetriNetUnfolderBase]: 1223/2213 cut-off events. [2025-01-09 16:43:16,012 INFO L125 PetriNetUnfolderBase]: For 3042/3042 co-relation queries the response was YES. [2025-01-09 16:43:16,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7068 conditions, 2213 events. 1223/2213 cut-off events. For 3042/3042 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 10918 event pairs, 302 based on Foata normal form. 48/2210 useless extension candidates. Maximal degree in co-relation 7047. Up to 952 conditions per place. [2025-01-09 16:43:16,024 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 153 selfloop transitions, 54 changer transitions 1/215 dead transitions. [2025-01-09 16:43:16,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 215 transitions, 1473 flow [2025-01-09 16:43:16,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:43:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:43:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-01-09 16:43:16,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6180555555555556 [2025-01-09 16:43:16,026 INFO L175 Difference]: Start difference. First operand has 78 places, 109 transitions, 531 flow. Second operand 4 states and 89 transitions. [2025-01-09 16:43:16,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 215 transitions, 1473 flow [2025-01-09 16:43:16,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 215 transitions, 1471 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:43:16,035 INFO L231 Difference]: Finished difference. Result has 82 places, 154 transitions, 1055 flow [2025-01-09 16:43:16,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1055, PETRI_PLACES=82, PETRI_TRANSITIONS=154} [2025-01-09 16:43:16,037 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 47 predicate places. [2025-01-09 16:43:16,037 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 154 transitions, 1055 flow [2025-01-09 16:43:16,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:43:16,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:16,038 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:16,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:43:16,039 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:43:16,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:16,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1444732394, now seen corresponding path program 3 times [2025-01-09 16:43:16,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:16,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416548445] [2025-01-09 16:43:16,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:43:16,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:16,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 2 equivalence classes. [2025-01-09 16:43:16,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 16:43:16,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:43:16,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:16,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:16,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:16,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416548445] [2025-01-09 16:43:16,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416548445] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:16,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424966533] [2025-01-09 16:43:16,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:43:16,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:16,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:16,181 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:43:16,183 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:43:16,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 2 equivalence classes. [2025-01-09 16:43:16,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 16:43:16,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:43:16,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:16,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 16:43:16,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:43:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:16,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:43:16,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:16,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424966533] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:43:16,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:43:16,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-01-09 16:43:16,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428924705] [2025-01-09 16:43:16,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:43:16,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 16:43:16,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:16,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 16:43:16,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:43:16,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-01-09 16:43:16,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 154 transitions, 1055 flow. Second operand has 15 states, 15 states have (on average 11.733333333333333) internal successors, (176), 15 states have internal predecessors, (176), 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:43:16,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:16,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-01-09 16:43:16,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:16,701 INFO L124 PetriNetUnfolderBase]: 844/1559 cut-off events. [2025-01-09 16:43:16,701 INFO L125 PetriNetUnfolderBase]: For 3194/3194 co-relation queries the response was YES. [2025-01-09 16:43:16,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5577 conditions, 1559 events. 844/1559 cut-off events. For 3194/3194 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7052 event pairs, 524 based on Foata normal form. 8/1554 useless extension candidates. Maximal degree in co-relation 5554. Up to 1378 conditions per place. [2025-01-09 16:43:16,710 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 92 selfloop transitions, 6 changer transitions 28/133 dead transitions. [2025-01-09 16:43:16,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 133 transitions, 1054 flow [2025-01-09 16:43:16,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:43:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:43:16,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2025-01-09 16:43:16,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3861111111111111 [2025-01-09 16:43:16,711 INFO L175 Difference]: Start difference. First operand has 82 places, 154 transitions, 1055 flow. Second operand 10 states and 139 transitions. [2025-01-09 16:43:16,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 133 transitions, 1054 flow [2025-01-09 16:43:16,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 133 transitions, 1022 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-01-09 16:43:16,717 INFO L231 Difference]: Finished difference. Result has 83 places, 105 transitions, 690 flow [2025-01-09 16:43:16,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=690, PETRI_PLACES=83, PETRI_TRANSITIONS=105} [2025-01-09 16:43:16,718 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 48 predicate places. [2025-01-09 16:43:16,718 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 105 transitions, 690 flow [2025-01-09 16:43:16,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.733333333333333) internal successors, (176), 15 states have internal predecessors, (176), 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:43:16,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:16,719 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:16,724 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:43:16,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:16,922 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:43:16,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:16,923 INFO L85 PathProgramCache]: Analyzing trace with hash 123170702, now seen corresponding path program 4 times [2025-01-09 16:43:16,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:16,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552095585] [2025-01-09 16:43:16,923 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:43:16,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:16,930 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-01-09 16:43:16,945 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 16:43:16,946 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:43:16,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:17,042 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 16:43:17,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:17,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552095585] [2025-01-09 16:43:17,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552095585] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:17,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:17,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:43:17,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121882593] [2025-01-09 16:43:17,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:17,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:43:17,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:17,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:43:17,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:43:17,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2025-01-09 16:43:17,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 105 transitions, 690 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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:43:17,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:17,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2025-01-09 16:43:17,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:17,207 INFO L124 PetriNetUnfolderBase]: 1131/2069 cut-off events. [2025-01-09 16:43:17,208 INFO L125 PetriNetUnfolderBase]: For 3253/3253 co-relation queries the response was YES. [2025-01-09 16:43:17,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7026 conditions, 2069 events. 1131/2069 cut-off events. For 3253/3253 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 9717 event pairs, 269 based on Foata normal form. 112/2180 useless extension candidates. Maximal degree in co-relation 7005. Up to 1045 conditions per place. [2025-01-09 16:43:17,235 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 115 selfloop transitions, 4 changer transitions 2/128 dead transitions. [2025-01-09 16:43:17,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 128 transitions, 1056 flow [2025-01-09 16:43:17,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:43:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:43:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-01-09 16:43:17,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2025-01-09 16:43:17,236 INFO L175 Difference]: Start difference. First operand has 83 places, 105 transitions, 690 flow. Second operand 4 states and 77 transitions. [2025-01-09 16:43:17,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 128 transitions, 1056 flow [2025-01-09 16:43:17,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 128 transitions, 1022 flow, removed 11 selfloop flow, removed 11 redundant places. [2025-01-09 16:43:17,241 INFO L231 Difference]: Finished difference. Result has 67 places, 100 transitions, 649 flow [2025-01-09 16:43:17,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=649, PETRI_PLACES=67, PETRI_TRANSITIONS=100} [2025-01-09 16:43:17,242 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2025-01-09 16:43:17,242 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 100 transitions, 649 flow [2025-01-09 16:43:17,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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:43:17,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:17,242 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:17,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:43:17,242 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:43:17,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:17,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1813624727, now seen corresponding path program 1 times [2025-01-09 16:43:17,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:17,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173401863] [2025-01-09 16:43:17,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:17,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:17,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 16:43:17,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 16:43:17,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:17,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:18,269 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:18,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:18,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173401863] [2025-01-09 16:43:18,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173401863] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:18,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732291687] [2025-01-09 16:43:18,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:18,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:18,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:18,272 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:43:18,273 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:43:18,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 16:43:18,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 16:43:18,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:18,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:18,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 16:43:18,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:43:18,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:18,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:43:19,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:43:19,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-01-09 16:43:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:19,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732291687] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:43:19,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:43:19,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 43 [2025-01-09 16:43:19,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777583832] [2025-01-09 16:43:19,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:43:19,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-09 16:43:19,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:19,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-09 16:43:19,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1621, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 16:43:19,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-01-09 16:43:19,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 100 transitions, 649 flow. Second operand has 44 states, 44 states have (on average 10.113636363636363) internal successors, (445), 44 states have internal predecessors, (445), 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:43:19,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:19,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-01-09 16:43:19,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:36,642 INFO L124 PetriNetUnfolderBase]: 12362/23053 cut-off events. [2025-01-09 16:43:36,643 INFO L125 PetriNetUnfolderBase]: For 33350/33350 co-relation queries the response was YES. [2025-01-09 16:43:36,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74387 conditions, 23053 events. 12362/23053 cut-off events. For 33350/33350 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 181897 event pairs, 473 based on Foata normal form. 152/21786 useless extension candidates. Maximal degree in co-relation 74369. Up to 5317 conditions per place. [2025-01-09 16:43:36,748 INFO L140 encePairwiseOnDemand]: 20/36 looper letters, 1038 selfloop transitions, 1304 changer transitions 426/2776 dead transitions. [2025-01-09 16:43:36,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 2776 transitions, 20705 flow [2025-01-09 16:43:36,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 278 states. [2025-01-09 16:43:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2025-01-09 16:43:36,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 4114 transitions. [2025-01-09 16:43:36,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41107114308553155 [2025-01-09 16:43:36,757 INFO L175 Difference]: Start difference. First operand has 67 places, 100 transitions, 649 flow. Second operand 278 states and 4114 transitions. [2025-01-09 16:43:36,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 2776 transitions, 20705 flow [2025-01-09 16:43:36,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 2776 transitions, 20687 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-01-09 16:43:36,892 INFO L231 Difference]: Finished difference. Result has 474 places, 1470 transitions, 14811 flow [2025-01-09 16:43:36,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=278, PETRI_FLOW=14811, PETRI_PLACES=474, PETRI_TRANSITIONS=1470} [2025-01-09 16:43:36,893 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 439 predicate places. [2025-01-09 16:43:36,893 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 1470 transitions, 14811 flow [2025-01-09 16:43:36,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 10.113636363636363) internal successors, (445), 44 states have internal predecessors, (445), 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:43:36,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:36,894 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:36,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 16:43:37,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:37,095 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:43:37,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:37,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1834800037, now seen corresponding path program 2 times [2025-01-09 16:43:37,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:37,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696528440] [2025-01-09 16:43:37,096 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:43:37,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:37,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-01-09 16:43:37,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 16:43:37,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:43:37,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:37,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:37,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696528440] [2025-01-09 16:43:37,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696528440] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:37,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895251579] [2025-01-09 16:43:37,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:43:37,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:37,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:37,935 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:43:37,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:43:37,972 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-01-09 16:43:37,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 16:43:37,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:43:37,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:37,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-09 16:43:37,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:43:38,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:38,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:43:38,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:43:38,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-01-09 16:43:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:38,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895251579] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:43:38,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:43:38,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 42 [2025-01-09 16:43:38,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927949830] [2025-01-09 16:43:38,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:43:38,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-01-09 16:43:38,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:38,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-01-09 16:43:38,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1528, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 16:43:38,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-01-09 16:43:38,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 1470 transitions, 14811 flow. Second operand has 43 states, 43 states have (on average 10.116279069767442) internal successors, (435), 43 states have internal predecessors, (435), 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:43:38,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:38,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-01-09 16:43:38,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand