./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-multiply-verify.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-more-multiply-verify.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 d79cb5dae664e13779624ff0ffbc531b419f89e2c7510a92e890992a52ee7c98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:46:03,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:46:03,943 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:46:03,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:46:03,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:46:03,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:46:03,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:46:03,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:46:03,975 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:46:03,975 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:46:03,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:46:03,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:46:03,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:46:03,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:46:03,976 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:46:03,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:46:03,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:46:03,976 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:46:03,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:46:03,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:46:03,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:46:03,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:46:03,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:46:03,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:46:03,976 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:46:03,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:46:03,976 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:46:03,976 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:46:03,976 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:46:03,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:46:03,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:46:03,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:46:03,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:46:03,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:46:03,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:46:03,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:46:03,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:46:03,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:46:03,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:46:03,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:46:03,977 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:46:03,977 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:46:03,977 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:46:03,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:46:03,977 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:46:03,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:46:03,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:46:03,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:46:03,977 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 -> d79cb5dae664e13779624ff0ffbc531b419f89e2c7510a92e890992a52ee7c98 [2025-01-09 16:46:04,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:46:04,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:46:04,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:46:04,213 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:46:04,213 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:46:04,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2025-01-09 16:46:05,351 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb69c15c9/2a75dc45e66c44bc8e26eb895dde013e/FLAG6fdff7ed8 [2025-01-09 16:46:05,576 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:46:05,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2025-01-09 16:46:05,598 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb69c15c9/2a75dc45e66c44bc8e26eb895dde013e/FLAG6fdff7ed8 [2025-01-09 16:46:05,942 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb69c15c9/2a75dc45e66c44bc8e26eb895dde013e [2025-01-09 16:46:05,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:46:05,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:46:05,946 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:46:05,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:46:05,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:46:05,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:46:05" (1/1) ... [2025-01-09 16:46:05,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b82d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:05, skipping insertion in model container [2025-01-09 16:46:05,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:46:05" (1/1) ... [2025-01-09 16:46:05,968 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:46:06,092 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-more-multiply-verify.wvr.c[3081,3094] [2025-01-09 16:46:06,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:46:06,106 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:46:06,124 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-more-multiply-verify.wvr.c[3081,3094] [2025-01-09 16:46:06,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:46:06,140 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:46:06,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:06 WrapperNode [2025-01-09 16:46:06,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:46:06,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:46:06,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:46:06,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:46:06,145 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:46:06" (1/1) ... [2025-01-09 16:46:06,150 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:46:06" (1/1) ... [2025-01-09 16:46:06,162 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 162 [2025-01-09 16:46:06,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:46:06,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:46:06,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:46:06,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:46:06,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:06" (1/1) ... [2025-01-09 16:46:06,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:06" (1/1) ... [2025-01-09 16:46:06,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:06" (1/1) ... [2025-01-09 16:46:06,179 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 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:46:06,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:06" (1/1) ... [2025-01-09 16:46:06,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:06" (1/1) ... [2025-01-09 16:46:06,184 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:06" (1/1) ... [2025-01-09 16:46:06,184 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:06" (1/1) ... [2025-01-09 16:46:06,186 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:06" (1/1) ... [2025-01-09 16:46:06,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:06" (1/1) ... [2025-01-09 16:46:06,188 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:06" (1/1) ... [2025-01-09 16:46:06,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:46:06,190 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:46:06,190 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:46:06,190 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:46:06,191 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:06" (1/1) ... [2025-01-09 16:46:06,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:46:06,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:06,215 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:46:06,217 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:46:06,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:46:06,233 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:46:06,233 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:46:06,233 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:46:06,233 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:46:06,233 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:46:06,233 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:46:06,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:46:06,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:46:06,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:46:06,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:46:06,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:46:06,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:46:06,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:46:06,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:46:06,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:46:06,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:46:06,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:46:06,235 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:46:06,315 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:46:06,316 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:46:06,521 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:46:06,521 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:46:06,673 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:46:06,674 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:46:06,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:46:06 BoogieIcfgContainer [2025-01-09 16:46:06,674 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:46:06,676 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:46:06,676 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:46:06,679 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:46:06,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:46:05" (1/3) ... [2025-01-09 16:46:06,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448c39e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:46:06, skipping insertion in model container [2025-01-09 16:46:06,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:06" (2/3) ... [2025-01-09 16:46:06,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448c39e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:46:06, skipping insertion in model container [2025-01-09 16:46:06,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:46:06" (3/3) ... [2025-01-09 16:46:06,682 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-multiply-verify.wvr.c [2025-01-09 16:46:06,692 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:46:06,693 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-multiply-verify.wvr.c that has 4 procedures, 33 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-09 16:46:06,693 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:46:06,743 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:46:06,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 91 flow [2025-01-09 16:46:06,787 INFO L124 PetriNetUnfolderBase]: 3/32 cut-off events. [2025-01-09 16:46:06,788 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:46:06,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 3/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-01-09 16:46:06,791 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 35 transitions, 91 flow [2025-01-09 16:46:06,793 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 31 transitions, 80 flow [2025-01-09 16:46:06,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:46:06,811 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;@7b9c9772, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:46:06,811 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:46:06,835 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:46:06,836 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2025-01-09 16:46:06,836 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:46:06,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:06,836 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:06,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:06,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:06,844 INFO L85 PathProgramCache]: Analyzing trace with hash -906306825, now seen corresponding path program 1 times [2025-01-09 16:46:06,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:06,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585894783] [2025-01-09 16:46:06,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:46:06,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:06,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:46:06,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:46:06,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:06,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:07,080 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:46:07,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:07,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585894783] [2025-01-09 16:46:07,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585894783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:07,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:07,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:46:07,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292049381] [2025-01-09 16:46:07,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:07,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:46:07,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:07,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:46:07,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:46:07,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-01-09 16:46:07,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:07,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:07,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-01-09 16:46:07,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:07,270 INFO L124 PetriNetUnfolderBase]: 350/564 cut-off events. [2025-01-09 16:46:07,270 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-01-09 16:46:07,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 564 events. 350/564 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1965 event pairs, 118 based on Foata normal form. 9/561 useless extension candidates. Maximal degree in co-relation 1067. Up to 432 conditions per place. [2025-01-09 16:46:07,279 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 35 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-01-09 16:46:07,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 44 transitions, 188 flow [2025-01-09 16:46:07,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:46:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:46:07,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-01-09 16:46:07,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-01-09 16:46:07,292 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 80 flow. Second operand 3 states and 66 transitions. [2025-01-09 16:46:07,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 44 transitions, 188 flow [2025-01-09 16:46:07,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 44 transitions, 172 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:46:07,302 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 87 flow [2025-01-09 16:46:07,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2025-01-09 16:46:07,306 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2025-01-09 16:46:07,308 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 87 flow [2025-01-09 16:46:07,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:07,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:07,309 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:07,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:46:07,309 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:07,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:07,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1365782967, now seen corresponding path program 2 times [2025-01-09 16:46:07,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:07,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71202048] [2025-01-09 16:46:07,310 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:46:07,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:07,323 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:46:07,340 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:46:07,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:46:07,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:07,566 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:46:07,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:07,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71202048] [2025-01-09 16:46:07,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71202048] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:07,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:07,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:46:07,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056575645] [2025-01-09 16:46:07,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:07,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:46:07,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:07,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:46:07,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:46:07,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-01-09 16:46:07,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:46:07,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:07,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-01-09 16:46:07,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:07,708 INFO L124 PetriNetUnfolderBase]: 420/703 cut-off events. [2025-01-09 16:46:07,709 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2025-01-09 16:46:07,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1537 conditions, 703 events. 420/703 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2644 event pairs, 316 based on Foata normal form. 26/707 useless extension candidates. Maximal degree in co-relation 578. Up to 547 conditions per place. [2025-01-09 16:46:07,715 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 26 selfloop transitions, 2 changer transitions 13/47 dead transitions. [2025-01-09 16:46:07,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 200 flow [2025-01-09 16:46:07,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:46:07,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:46:07,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-01-09 16:46:07,718 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-01-09 16:46:07,718 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 87 flow. Second operand 4 states and 77 transitions. [2025-01-09 16:46:07,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 200 flow [2025-01-09 16:46:07,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 197 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:46:07,719 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 100 flow [2025-01-09 16:46:07,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2025-01-09 16:46:07,720 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2025-01-09 16:46:07,721 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 100 flow [2025-01-09 16:46:07,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:46:07,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:07,721 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:07,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:46:07,722 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:07,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:07,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1086906639, now seen corresponding path program 1 times [2025-01-09 16:46:07,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:07,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525484476] [2025-01-09 16:46:07,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:46:07,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:07,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:46:07,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:46:07,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:07,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:07,801 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:46:07,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:07,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525484476] [2025-01-09 16:46:07,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525484476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:07,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:07,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:46:07,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920599017] [2025-01-09 16:46:07,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:07,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:46:07,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:07,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:46:07,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:46:07,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-01-09 16:46:07,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:07,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:07,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-01-09 16:46:07,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:07,887 INFO L124 PetriNetUnfolderBase]: 224/385 cut-off events. [2025-01-09 16:46:07,887 INFO L125 PetriNetUnfolderBase]: For 106/120 co-relation queries the response was YES. [2025-01-09 16:46:07,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 385 events. 224/385 cut-off events. For 106/120 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1267 event pairs, 56 based on Foata normal form. 31/405 useless extension candidates. Maximal degree in co-relation 861. Up to 146 conditions per place. [2025-01-09 16:46:07,891 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 40 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2025-01-09 16:46:07,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 228 flow [2025-01-09 16:46:07,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:46:07,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:46:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2025-01-09 16:46:07,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5785714285714286 [2025-01-09 16:46:07,893 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 100 flow. Second operand 4 states and 81 transitions. [2025-01-09 16:46:07,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 228 flow [2025-01-09 16:46:07,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 220 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-09 16:46:07,895 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 108 flow [2025-01-09 16:46:07,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2025-01-09 16:46:07,895 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2025-01-09 16:46:07,895 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 108 flow [2025-01-09 16:46:07,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:07,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:07,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:07,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:46:07,896 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:07,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:07,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1152591879, now seen corresponding path program 2 times [2025-01-09 16:46:07,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:07,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966043993] [2025-01-09 16:46:07,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:46:07,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:07,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-09 16:46:07,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 25 statements. [2025-01-09 16:46:07,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:46:07,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:08,362 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:46:08,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:08,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966043993] [2025-01-09 16:46:08,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966043993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:08,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:08,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:46:08,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917287179] [2025-01-09 16:46:08,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:08,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:46:08,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:08,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:46:08,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:46:08,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-01-09 16:46:08,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 108 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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:46:08,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:08,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-01-09 16:46:08,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:08,735 INFO L124 PetriNetUnfolderBase]: 548/923 cut-off events. [2025-01-09 16:46:08,736 INFO L125 PetriNetUnfolderBase]: For 432/439 co-relation queries the response was YES. [2025-01-09 16:46:08,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2177 conditions, 923 events. 548/923 cut-off events. For 432/439 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4192 event pairs, 131 based on Foata normal form. 6/925 useless extension candidates. Maximal degree in co-relation 2158. Up to 341 conditions per place. [2025-01-09 16:46:08,740 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 62 selfloop transitions, 14 changer transitions 17/97 dead transitions. [2025-01-09 16:46:08,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 97 transitions, 467 flow [2025-01-09 16:46:08,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:46:08,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:46:08,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2025-01-09 16:46:08,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2025-01-09 16:46:08,742 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 108 flow. Second operand 8 states and 149 transitions. [2025-01-09 16:46:08,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 97 transitions, 467 flow [2025-01-09 16:46:08,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 97 transitions, 447 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-01-09 16:46:08,744 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 207 flow [2025-01-09 16:46:08,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=207, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2025-01-09 16:46:08,745 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2025-01-09 16:46:08,745 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 207 flow [2025-01-09 16:46:08,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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:46:08,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:08,745 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:08,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:46:08,746 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:08,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:08,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1928703079, now seen corresponding path program 3 times [2025-01-09 16:46:08,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:08,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012224907] [2025-01-09 16:46:08,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:46:08,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:08,754 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-01-09 16:46:08,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 25 statements. [2025-01-09 16:46:08,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:46:08,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:09,150 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:46:09,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:09,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012224907] [2025-01-09 16:46:09,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012224907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:09,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:09,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:46:09,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664389412] [2025-01-09 16:46:09,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:09,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:46:09,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:09,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:46:09,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:46:09,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-01-09 16:46:09,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 207 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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:46:09,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:09,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-01-09 16:46:09,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:09,479 INFO L124 PetriNetUnfolderBase]: 742/1252 cut-off events. [2025-01-09 16:46:09,479 INFO L125 PetriNetUnfolderBase]: For 1227/1234 co-relation queries the response was YES. [2025-01-09 16:46:09,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3596 conditions, 1252 events. 742/1252 cut-off events. For 1227/1234 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6086 event pairs, 185 based on Foata normal form. 6/1256 useless extension candidates. Maximal degree in co-relation 3580. Up to 405 conditions per place. [2025-01-09 16:46:09,487 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 64 selfloop transitions, 21 changer transitions 17/106 dead transitions. [2025-01-09 16:46:09,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 106 transitions, 627 flow [2025-01-09 16:46:09,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:46:09,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:46:09,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2025-01-09 16:46:09,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2025-01-09 16:46:09,491 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 207 flow. Second operand 8 states and 148 transitions. [2025-01-09 16:46:09,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 106 transitions, 627 flow [2025-01-09 16:46:09,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 106 transitions, 599 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-01-09 16:46:09,499 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 355 flow [2025-01-09 16:46:09,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=355, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2025-01-09 16:46:09,499 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2025-01-09 16:46:09,500 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 355 flow [2025-01-09 16:46:09,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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:46:09,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:09,500 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:09,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:46:09,501 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:09,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:09,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1268113839, now seen corresponding path program 4 times [2025-01-09 16:46:09,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:09,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401535749] [2025-01-09 16:46:09,503 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:46:09,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:09,510 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-09 16:46:09,515 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:46:09,515 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:46:09,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:09,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:09,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401535749] [2025-01-09 16:46:09,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401535749] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:09,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247281391] [2025-01-09 16:46:09,590 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:46:09,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:09,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:09,592 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:46:09,594 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:46:09,636 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-09 16:46:09,655 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:46:09,655 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:46:09,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:09,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:46:09,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:09,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:09,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:09,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:09,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247281391] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:46:09,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:46:09,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-09 16:46:09,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593238425] [2025-01-09 16:46:09,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:46:09,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:46:09,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:09,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:46:09,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:46:09,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-01-09 16:46:09,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 355 flow. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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:46:09,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:09,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-01-09 16:46:09,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:09,988 INFO L124 PetriNetUnfolderBase]: 1123/1963 cut-off events. [2025-01-09 16:46:09,988 INFO L125 PetriNetUnfolderBase]: For 2927/2931 co-relation queries the response was YES. [2025-01-09 16:46:09,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6132 conditions, 1963 events. 1123/1963 cut-off events. For 2927/2931 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11197 event pairs, 756 based on Foata normal form. 11/1942 useless extension candidates. Maximal degree in co-relation 6112. Up to 868 conditions per place. [2025-01-09 16:46:09,998 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 40 selfloop transitions, 3 changer transitions 35/93 dead transitions. [2025-01-09 16:46:09,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 93 transitions, 740 flow [2025-01-09 16:46:09,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:46:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:46:09,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2025-01-09 16:46:09,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5257142857142857 [2025-01-09 16:46:09,999 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 355 flow. Second operand 5 states and 92 transitions. [2025-01-09 16:46:09,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 93 transitions, 740 flow [2025-01-09 16:46:10,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 93 transitions, 728 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-01-09 16:46:10,008 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 361 flow [2025-01-09 16:46:10,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=361, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2025-01-09 16:46:10,008 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 22 predicate places. [2025-01-09 16:46:10,009 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 361 flow [2025-01-09 16:46:10,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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:46:10,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:10,009 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] [2025-01-09 16:46:10,016 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:46:10,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:10,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:10,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:10,214 INFO L85 PathProgramCache]: Analyzing trace with hash 287524993, now seen corresponding path program 5 times [2025-01-09 16:46:10,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:10,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008286308] [2025-01-09 16:46:10,214 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:46:10,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:10,221 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:46:10,250 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:46:10,250 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:10,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:11,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:11,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:11,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008286308] [2025-01-09 16:46:11,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008286308] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:11,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679346677] [2025-01-09 16:46:11,254 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:46:11,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:11,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:11,256 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:46:11,258 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:46:11,302 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:46:11,322 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:46:11,323 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:11,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:11,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 16:46:11,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:11,400 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:46:11,794 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-01-09 16:46:11,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 34 [2025-01-09 16:46:11,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:11,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:12,370 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 81 treesize of output 73 [2025-01-09 16:46:12,417 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-01-09 16:46:12,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 140 treesize of output 138 [2025-01-09 16:46:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:13,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679346677] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:46:13,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:46:13,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2025-01-09 16:46:13,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198888159] [2025-01-09 16:46:13,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:46:13,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 16:46:13,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:13,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 16:46:13,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2025-01-09 16:46:13,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-01-09 16:46:13,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 361 flow. Second operand has 29 states, 29 states have (on average 9.482758620689655) internal successors, (275), 29 states have internal predecessors, (275), 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:46:13,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:13,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-01-09 16:46:13,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:15,776 INFO L124 PetriNetUnfolderBase]: 1679/2855 cut-off events. [2025-01-09 16:46:15,776 INFO L125 PetriNetUnfolderBase]: For 4240/4240 co-relation queries the response was YES. [2025-01-09 16:46:15,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8866 conditions, 2855 events. 1679/2855 cut-off events. For 4240/4240 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 16634 event pairs, 602 based on Foata normal form. 1/2849 useless extension candidates. Maximal degree in co-relation 8835. Up to 1070 conditions per place. [2025-01-09 16:46:15,794 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 148 selfloop transitions, 32 changer transitions 17/201 dead transitions. [2025-01-09 16:46:15,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 201 transitions, 1372 flow [2025-01-09 16:46:15,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 16:46:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-09 16:46:15,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 274 transitions. [2025-01-09 16:46:15,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46050420168067224 [2025-01-09 16:46:15,795 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 361 flow. Second operand 17 states and 274 transitions. [2025-01-09 16:46:15,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 201 transitions, 1372 flow [2025-01-09 16:46:15,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 201 transitions, 1354 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-01-09 16:46:15,806 INFO L231 Difference]: Finished difference. Result has 82 places, 87 transitions, 778 flow [2025-01-09 16:46:15,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=778, PETRI_PLACES=82, PETRI_TRANSITIONS=87} [2025-01-09 16:46:15,807 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 44 predicate places. [2025-01-09 16:46:15,807 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 87 transitions, 778 flow [2025-01-09 16:46:15,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.482758620689655) internal successors, (275), 29 states have internal predecessors, (275), 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:46:15,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:15,807 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] [2025-01-09 16:46:15,814 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:46:16,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:16,008 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:16,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:16,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2021380663, now seen corresponding path program 6 times [2025-01-09 16:46:16,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:16,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30650166] [2025-01-09 16:46:16,010 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:46:16,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:16,017 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:46:16,038 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 26 statements. [2025-01-09 16:46:16,039 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:46:16,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:46:16,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:16,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30650166] [2025-01-09 16:46:16,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30650166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:16,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:16,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:46:16,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784367564] [2025-01-09 16:46:16,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:16,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:46:16,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:16,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:46:16,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:46:16,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-01-09 16:46:16,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 87 transitions, 778 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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:46:16,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:16,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-01-09 16:46:16,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:16,663 INFO L124 PetriNetUnfolderBase]: 1798/3079 cut-off events. [2025-01-09 16:46:16,663 INFO L125 PetriNetUnfolderBase]: For 7854/7854 co-relation queries the response was YES. [2025-01-09 16:46:16,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10548 conditions, 3079 events. 1798/3079 cut-off events. For 7854/7854 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18442 event pairs, 395 based on Foata normal form. 2/3072 useless extension candidates. Maximal degree in co-relation 10510. Up to 1248 conditions per place. [2025-01-09 16:46:16,683 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 84 selfloop transitions, 37 changer transitions 19/144 dead transitions. [2025-01-09 16:46:16,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 144 transitions, 1259 flow [2025-01-09 16:46:16,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:46:16,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:46:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2025-01-09 16:46:16,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-01-09 16:46:16,685 INFO L175 Difference]: Start difference. First operand has 82 places, 87 transitions, 778 flow. Second operand 8 states and 152 transitions. [2025-01-09 16:46:16,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 144 transitions, 1259 flow [2025-01-09 16:46:16,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 144 transitions, 1211 flow, removed 22 selfloop flow, removed 4 redundant places. [2025-01-09 16:46:16,705 INFO L231 Difference]: Finished difference. Result has 86 places, 89 transitions, 850 flow [2025-01-09 16:46:16,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=850, PETRI_PLACES=86, PETRI_TRANSITIONS=89} [2025-01-09 16:46:16,706 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 48 predicate places. [2025-01-09 16:46:16,706 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 89 transitions, 850 flow [2025-01-09 16:46:16,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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:46:16,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:16,706 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] [2025-01-09 16:46:16,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:46:16,706 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:16,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:16,707 INFO L85 PathProgramCache]: Analyzing trace with hash 551276761, now seen corresponding path program 7 times [2025-01-09 16:46:16,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:16,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930742649] [2025-01-09 16:46:16,707 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:46:16,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:16,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:46:16,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:46:16,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:16,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:17,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:17,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:17,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930742649] [2025-01-09 16:46:17,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930742649] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:17,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639693186] [2025-01-09 16:46:17,502 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:46:17,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:17,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:17,504 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:46:17,506 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:46:17,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:46:17,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:46:17,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:17,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:17,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 16:46:17,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:17,623 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:46:17,887 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-01-09 16:46:17,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 34 [2025-01-09 16:46:17,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:17,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:18,488 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 81 treesize of output 73 [2025-01-09 16:46:18,532 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-01-09 16:46:18,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 136 treesize of output 134 [2025-01-09 16:46:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:19,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639693186] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:46:19,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:46:19,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-01-09 16:46:19,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065790182] [2025-01-09 16:46:19,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:46:19,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 16:46:19,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:19,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 16:46:19,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2025-01-09 16:46:19,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-01-09 16:46:19,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 89 transitions, 850 flow. Second operand has 30 states, 30 states have (on average 9.4) internal successors, (282), 30 states have internal predecessors, (282), 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:46:19,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:19,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-01-09 16:46:19,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:22,697 INFO L124 PetriNetUnfolderBase]: 2307/4064 cut-off events. [2025-01-09 16:46:22,697 INFO L125 PetriNetUnfolderBase]: For 12418/12433 co-relation queries the response was YES. [2025-01-09 16:46:22,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13786 conditions, 4064 events. 2307/4064 cut-off events. For 12418/12433 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 25689 event pairs, 746 based on Foata normal form. 14/4076 useless extension candidates. Maximal degree in co-relation 13722. Up to 1201 conditions per place. [2025-01-09 16:46:22,729 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 219 selfloop transitions, 52 changer transitions 18/293 dead transitions. [2025-01-09 16:46:22,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 293 transitions, 2216 flow [2025-01-09 16:46:22,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 16:46:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-01-09 16:46:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 423 transitions. [2025-01-09 16:46:22,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46483516483516485 [2025-01-09 16:46:22,733 INFO L175 Difference]: Start difference. First operand has 86 places, 89 transitions, 850 flow. Second operand 26 states and 423 transitions. [2025-01-09 16:46:22,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 293 transitions, 2216 flow [2025-01-09 16:46:22,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 293 transitions, 2118 flow, removed 15 selfloop flow, removed 6 redundant places. [2025-01-09 16:46:22,760 INFO L231 Difference]: Finished difference. Result has 114 places, 115 transitions, 1227 flow [2025-01-09 16:46:22,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1227, PETRI_PLACES=114, PETRI_TRANSITIONS=115} [2025-01-09 16:46:22,762 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 76 predicate places. [2025-01-09 16:46:22,762 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 115 transitions, 1227 flow [2025-01-09 16:46:22,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 9.4) internal successors, (282), 30 states have internal predecessors, (282), 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:46:22,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:22,763 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] [2025-01-09 16:46:22,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:46:22,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:22,964 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:22,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:22,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1618591177, now seen corresponding path program 8 times [2025-01-09 16:46:22,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:22,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030864346] [2025-01-09 16:46:22,965 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:46:22,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:22,972 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:46:22,987 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 26 statements. [2025-01-09 16:46:22,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:46:22,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:46:23,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:23,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030864346] [2025-01-09 16:46:23,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030864346] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:23,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:23,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:46:23,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397449496] [2025-01-09 16:46:23,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:23,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:46:23,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:23,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:46:23,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:46:23,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-01-09 16:46:23,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 115 transitions, 1227 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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:46:23,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:23,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-01-09 16:46:23,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:23,697 INFO L124 PetriNetUnfolderBase]: 2400/4238 cut-off events. [2025-01-09 16:46:23,697 INFO L125 PetriNetUnfolderBase]: For 15756/15782 co-relation queries the response was YES. [2025-01-09 16:46:23,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15263 conditions, 4238 events. 2400/4238 cut-off events. For 15756/15782 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 27209 event pairs, 720 based on Foata normal form. 25/4261 useless extension candidates. Maximal degree in co-relation 15190. Up to 2242 conditions per place. [2025-01-09 16:46:23,736 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 102 selfloop transitions, 40 changer transitions 19/165 dead transitions. [2025-01-09 16:46:23,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 165 transitions, 1752 flow [2025-01-09 16:46:23,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:46:23,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:46:23,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2025-01-09 16:46:23,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5035714285714286 [2025-01-09 16:46:23,737 INFO L175 Difference]: Start difference. First operand has 114 places, 115 transitions, 1227 flow. Second operand 8 states and 141 transitions. [2025-01-09 16:46:23,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 165 transitions, 1752 flow [2025-01-09 16:46:23,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 165 transitions, 1665 flow, removed 40 selfloop flow, removed 5 redundant places. [2025-01-09 16:46:23,795 INFO L231 Difference]: Finished difference. Result has 118 places, 118 transitions, 1276 flow [2025-01-09 16:46:23,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1276, PETRI_PLACES=118, PETRI_TRANSITIONS=118} [2025-01-09 16:46:23,796 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 80 predicate places. [2025-01-09 16:46:23,796 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 118 transitions, 1276 flow [2025-01-09 16:46:23,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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:46:23,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:23,797 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:23,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:46:23,797 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:23,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:23,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1973922657, now seen corresponding path program 9 times [2025-01-09 16:46:23,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:23,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303360267] [2025-01-09 16:46:23,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:46:23,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:23,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-01-09 16:46:23,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 27 statements. [2025-01-09 16:46:23,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:46:23,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:24,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:46:24,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:24,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303360267] [2025-01-09 16:46:24,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303360267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:24,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:24,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:46:24,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043887565] [2025-01-09 16:46:24,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:24,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:46:24,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:24,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:46:24,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:46:24,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-01-09 16:46:24,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 118 transitions, 1276 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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:46:24,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:24,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-01-09 16:46:24,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:24,560 INFO L124 PetriNetUnfolderBase]: 2370/4179 cut-off events. [2025-01-09 16:46:24,560 INFO L125 PetriNetUnfolderBase]: For 17920/17920 co-relation queries the response was YES. [2025-01-09 16:46:24,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15373 conditions, 4179 events. 2370/4179 cut-off events. For 17920/17920 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 26609 event pairs, 670 based on Foata normal form. 1/4171 useless extension candidates. Maximal degree in co-relation 15297. Up to 2266 conditions per place. [2025-01-09 16:46:24,584 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 112 selfloop transitions, 40 changer transitions 17/173 dead transitions. [2025-01-09 16:46:24,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 173 transitions, 1826 flow [2025-01-09 16:46:24,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:46:24,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:46:24,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2025-01-09 16:46:24,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-01-09 16:46:24,586 INFO L175 Difference]: Start difference. First operand has 118 places, 118 transitions, 1276 flow. Second operand 8 states and 147 transitions. [2025-01-09 16:46:24,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 173 transitions, 1826 flow [2025-01-09 16:46:24,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 173 transitions, 1748 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-01-09 16:46:24,628 INFO L231 Difference]: Finished difference. Result has 122 places, 120 transitions, 1334 flow [2025-01-09 16:46:24,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1200, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1334, PETRI_PLACES=122, PETRI_TRANSITIONS=120} [2025-01-09 16:46:24,628 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 84 predicate places. [2025-01-09 16:46:24,628 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 120 transitions, 1334 flow [2025-01-09 16:46:24,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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:46:24,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:24,629 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:24,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:46:24,629 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:24,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:24,629 INFO L85 PathProgramCache]: Analyzing trace with hash 159193233, now seen corresponding path program 10 times [2025-01-09 16:46:24,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:24,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132241742] [2025-01-09 16:46:24,630 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:46:24,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:24,635 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:46:24,655 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:46:24,655 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:46:24,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:25,362 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:46:25,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:25,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132241742] [2025-01-09 16:46:25,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132241742] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:25,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133683229] [2025-01-09 16:46:25,363 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:46:25,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:25,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:25,364 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:46:25,366 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:46:25,409 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:46:25,428 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:46:25,428 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:46:25,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:25,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 16:46:25,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:46:25,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:25,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:46:25,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 24 [2025-01-09 16:46:25,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:46:25,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133683229] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:25,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:46:25,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 9] total 26 [2025-01-09 16:46:25,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774045694] [2025-01-09 16:46:25,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:25,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:46:25,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:25,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:46:25,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2025-01-09 16:46:25,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-01-09 16:46:25,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 120 transitions, 1334 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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:46:25,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:25,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-01-09 16:46:25,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:26,470 INFO L124 PetriNetUnfolderBase]: 2645/4728 cut-off events. [2025-01-09 16:46:26,470 INFO L125 PetriNetUnfolderBase]: For 20753/20791 co-relation queries the response was YES. [2025-01-09 16:46:26,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17125 conditions, 4728 events. 2645/4728 cut-off events. For 20753/20791 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 31081 event pairs, 741 based on Foata normal form. 35/4755 useless extension candidates. Maximal degree in co-relation 17027. Up to 1439 conditions per place. [2025-01-09 16:46:26,499 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 111 selfloop transitions, 65 changer transitions 23/203 dead transitions. [2025-01-09 16:46:26,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 203 transitions, 2056 flow [2025-01-09 16:46:26,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:46:26,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:46:26,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2025-01-09 16:46:26,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-01-09 16:46:26,502 INFO L175 Difference]: Start difference. First operand has 122 places, 120 transitions, 1334 flow. Second operand 10 states and 190 transitions. [2025-01-09 16:46:26,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 203 transitions, 2056 flow [2025-01-09 16:46:26,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 203 transitions, 1964 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-01-09 16:46:26,556 INFO L231 Difference]: Finished difference. Result has 129 places, 123 transitions, 1478 flow [2025-01-09 16:46:26,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1256, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1478, PETRI_PLACES=129, PETRI_TRANSITIONS=123} [2025-01-09 16:46:26,561 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 91 predicate places. [2025-01-09 16:46:26,561 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 123 transitions, 1478 flow [2025-01-09 16:46:26,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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:46:26,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:26,561 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:46:26,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 16:46:26,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 16:46:26,762 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:26,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:26,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1312964449, now seen corresponding path program 1 times [2025-01-09 16:46:26,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:26,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27587858] [2025-01-09 16:46:26,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:46:26,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:26,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:46:26,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:46:26,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:26,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:26,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:46:26,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:26,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27587858] [2025-01-09 16:46:26,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27587858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:26,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:26,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:46:26,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588782051] [2025-01-09 16:46:26,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:26,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:46:26,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:26,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:46:26,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:46:26,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-01-09 16:46:26,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 123 transitions, 1478 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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:46:26,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:26,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-01-09 16:46:26,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:27,356 INFO L124 PetriNetUnfolderBase]: 3416/6014 cut-off events. [2025-01-09 16:46:27,356 INFO L125 PetriNetUnfolderBase]: For 27462/27474 co-relation queries the response was YES. [2025-01-09 16:46:27,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21586 conditions, 6014 events. 3416/6014 cut-off events. For 27462/27474 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 40459 event pairs, 687 based on Foata normal form. 8/5478 useless extension candidates. Maximal degree in co-relation 21489. Up to 3649 conditions per place. [2025-01-09 16:46:27,402 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 141 selfloop transitions, 27 changer transitions 4/208 dead transitions. [2025-01-09 16:46:27,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 208 transitions, 2600 flow [2025-01-09 16:46:27,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:46:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:46:27,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2025-01-09 16:46:27,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2025-01-09 16:46:27,404 INFO L175 Difference]: Start difference. First operand has 129 places, 123 transitions, 1478 flow. Second operand 7 states and 135 transitions. [2025-01-09 16:46:27,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 208 transitions, 2600 flow [2025-01-09 16:46:27,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 208 transitions, 2438 flow, removed 23 selfloop flow, removed 7 redundant places. [2025-01-09 16:46:27,582 INFO L231 Difference]: Finished difference. Result has 129 places, 140 transitions, 1625 flow [2025-01-09 16:46:27,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1625, PETRI_PLACES=129, PETRI_TRANSITIONS=140} [2025-01-09 16:46:27,583 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 91 predicate places. [2025-01-09 16:46:27,583 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 140 transitions, 1625 flow [2025-01-09 16:46:27,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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:46:27,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:27,584 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:46:27,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:46:27,584 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:27,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:27,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1953942861, now seen corresponding path program 2 times [2025-01-09 16:46:27,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:27,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290690064] [2025-01-09 16:46:27,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:46:27,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:27,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:46:27,595 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 29 statements. [2025-01-09 16:46:27,595 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:46:27,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:27,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:46:27,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:27,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290690064] [2025-01-09 16:46:27,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290690064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:27,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:27,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:46:27,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663940800] [2025-01-09 16:46:27,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:27,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:46:27,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:27,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:46:27,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:46:27,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-01-09 16:46:27,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 140 transitions, 1625 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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:46:27,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:27,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-01-09 16:46:27,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:28,228 INFO L124 PetriNetUnfolderBase]: 3417/6029 cut-off events. [2025-01-09 16:46:28,229 INFO L125 PetriNetUnfolderBase]: For 27270/27302 co-relation queries the response was YES. [2025-01-09 16:46:28,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23854 conditions, 6029 events. 3417/6029 cut-off events. For 27270/27302 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 40828 event pairs, 2131 based on Foata normal form. 48/5998 useless extension candidates. Maximal degree in co-relation 22530. Up to 4664 conditions per place. [2025-01-09 16:46:28,269 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 115 selfloop transitions, 25 changer transitions 5/181 dead transitions. [2025-01-09 16:46:28,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 181 transitions, 2251 flow [2025-01-09 16:46:28,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:46:28,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:46:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2025-01-09 16:46:28,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5314285714285715 [2025-01-09 16:46:28,271 INFO L175 Difference]: Start difference. First operand has 129 places, 140 transitions, 1625 flow. Second operand 5 states and 93 transitions. [2025-01-09 16:46:28,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 181 transitions, 2251 flow [2025-01-09 16:46:28,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 181 transitions, 2251 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:46:28,354 INFO L231 Difference]: Finished difference. Result has 136 places, 147 transitions, 1779 flow [2025-01-09 16:46:28,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1625, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1779, PETRI_PLACES=136, PETRI_TRANSITIONS=147} [2025-01-09 16:46:28,356 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 98 predicate places. [2025-01-09 16:46:28,356 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 147 transitions, 1779 flow [2025-01-09 16:46:28,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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:46:28,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:28,357 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:46:28,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:46:28,357 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:28,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:28,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1720244308, now seen corresponding path program 1 times [2025-01-09 16:46:28,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:28,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865683677] [2025-01-09 16:46:28,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:46:28,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:28,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:46:28,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:46:28,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:28,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:28,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:46:28,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:28,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865683677] [2025-01-09 16:46:28,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865683677] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:28,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:28,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:46:28,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586339052] [2025-01-09 16:46:28,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:28,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:46:28,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:28,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:46:28,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:46:28,422 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-01-09 16:46:28,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 147 transitions, 1779 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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:46:28,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:28,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-01-09 16:46:28,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:29,048 INFO L124 PetriNetUnfolderBase]: 2902/5158 cut-off events. [2025-01-09 16:46:29,049 INFO L125 PetriNetUnfolderBase]: For 26764/26808 co-relation queries the response was YES. [2025-01-09 16:46:29,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21643 conditions, 5158 events. 2902/5158 cut-off events. For 26764/26808 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 33819 event pairs, 1483 based on Foata normal form. 104/5187 useless extension candidates. Maximal degree in co-relation 21096. Up to 3321 conditions per place. [2025-01-09 16:46:29,084 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 94 selfloop transitions, 14 changer transitions 35/173 dead transitions. [2025-01-09 16:46:29,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 173 transitions, 2214 flow [2025-01-09 16:46:29,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:46:29,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:46:29,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2025-01-09 16:46:29,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5542857142857143 [2025-01-09 16:46:29,085 INFO L175 Difference]: Start difference. First operand has 136 places, 147 transitions, 1779 flow. Second operand 5 states and 97 transitions. [2025-01-09 16:46:29,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 173 transitions, 2214 flow [2025-01-09 16:46:29,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 173 transitions, 2150 flow, removed 15 selfloop flow, removed 4 redundant places. [2025-01-09 16:46:29,166 INFO L231 Difference]: Finished difference. Result has 136 places, 124 transitions, 1410 flow [2025-01-09 16:46:29,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1587, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1410, PETRI_PLACES=136, PETRI_TRANSITIONS=124} [2025-01-09 16:46:29,167 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 98 predicate places. [2025-01-09 16:46:29,167 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 124 transitions, 1410 flow [2025-01-09 16:46:29,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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:46:29,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:29,167 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:46:29,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:46:29,167 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:29,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:29,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1284641679, now seen corresponding path program 3 times [2025-01-09 16:46:29,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:29,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789721079] [2025-01-09 16:46:29,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:46:29,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:29,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:46:29,189 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:46:29,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:46:29,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:29,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:46:29,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:29,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789721079] [2025-01-09 16:46:29,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789721079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:29,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:29,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:46:29,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118507513] [2025-01-09 16:46:29,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:29,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:46:29,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:29,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:46:29,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:46:29,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-01-09 16:46:29,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 124 transitions, 1410 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:29,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:29,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-01-09 16:46:29,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:29,735 INFO L124 PetriNetUnfolderBase]: 2557/4560 cut-off events. [2025-01-09 16:46:29,735 INFO L125 PetriNetUnfolderBase]: For 23261/23286 co-relation queries the response was YES. [2025-01-09 16:46:29,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18843 conditions, 4560 events. 2557/4560 cut-off events. For 23261/23286 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 29113 event pairs, 1476 based on Foata normal form. 76/4577 useless extension candidates. Maximal degree in co-relation 17940. Up to 3090 conditions per place. [2025-01-09 16:46:29,775 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 98 selfloop transitions, 23 changer transitions 3/152 dead transitions. [2025-01-09 16:46:29,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 152 transitions, 1901 flow [2025-01-09 16:46:29,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:46:29,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:46:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-01-09 16:46:29,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-01-09 16:46:29,778 INFO L175 Difference]: Start difference. First operand has 136 places, 124 transitions, 1410 flow. Second operand 4 states and 80 transitions. [2025-01-09 16:46:29,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 152 transitions, 1901 flow [2025-01-09 16:46:29,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 152 transitions, 1771 flow, removed 32 selfloop flow, removed 9 redundant places. [2025-01-09 16:46:29,851 INFO L231 Difference]: Finished difference. Result has 126 places, 121 transitions, 1317 flow [2025-01-09 16:46:29,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1241, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1317, PETRI_PLACES=126, PETRI_TRANSITIONS=121} [2025-01-09 16:46:29,851 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 88 predicate places. [2025-01-09 16:46:29,852 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 121 transitions, 1317 flow [2025-01-09 16:46:29,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:29,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:29,852 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:46:29,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:46:29,852 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:29,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:29,853 INFO L85 PathProgramCache]: Analyzing trace with hash -502591599, now seen corresponding path program 4 times [2025-01-09 16:46:29,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:29,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348929914] [2025-01-09 16:46:29,853 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:46:29,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:29,859 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:46:29,867 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:46:29,867 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:46:29,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:46:29,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:29,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348929914] [2025-01-09 16:46:29,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348929914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:29,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:29,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:46:29,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371466723] [2025-01-09 16:46:29,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:29,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:46:29,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:29,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:46:29,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:46:29,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-01-09 16:46:29,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 121 transitions, 1317 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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:46:29,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:29,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-01-09 16:46:29,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:30,366 INFO L124 PetriNetUnfolderBase]: 2280/4212 cut-off events. [2025-01-09 16:46:30,366 INFO L125 PetriNetUnfolderBase]: For 21777/21865 co-relation queries the response was YES. [2025-01-09 16:46:30,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17824 conditions, 4212 events. 2280/4212 cut-off events. For 21777/21865 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 27871 event pairs, 1270 based on Foata normal form. 41/4141 useless extension candidates. Maximal degree in co-relation 17037. Up to 2863 conditions per place. [2025-01-09 16:46:30,404 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 89 selfloop transitions, 29 changer transitions 3/153 dead transitions. [2025-01-09 16:46:30,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 153 transitions, 1858 flow [2025-01-09 16:46:30,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:46:30,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:46:30,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2025-01-09 16:46:30,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5257142857142857 [2025-01-09 16:46:30,405 INFO L175 Difference]: Start difference. First operand has 126 places, 121 transitions, 1317 flow. Second operand 5 states and 92 transitions. [2025-01-09 16:46:30,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 153 transitions, 1858 flow [2025-01-09 16:46:30,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 153 transitions, 1832 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-09 16:46:30,449 INFO L231 Difference]: Finished difference. Result has 128 places, 127 transitions, 1486 flow [2025-01-09 16:46:30,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1486, PETRI_PLACES=128, PETRI_TRANSITIONS=127} [2025-01-09 16:46:30,450 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 90 predicate places. [2025-01-09 16:46:30,450 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 127 transitions, 1486 flow [2025-01-09 16:46:30,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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:46:30,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:30,450 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:46:30,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 16:46:30,451 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:30,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:30,452 INFO L85 PathProgramCache]: Analyzing trace with hash -876730081, now seen corresponding path program 5 times [2025-01-09 16:46:30,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:30,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142274719] [2025-01-09 16:46:30,452 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:46:30,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:30,458 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:46:30,462 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:46:30,462 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:30,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:46:30,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:30,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142274719] [2025-01-09 16:46:30,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142274719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:30,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:30,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:46:30,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185935364] [2025-01-09 16:46:30,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:30,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:46:30,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:30,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:46:30,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:46:30,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-01-09 16:46:30,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 127 transitions, 1486 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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:46:30,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:30,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-01-09 16:46:30,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:30,781 INFO L124 PetriNetUnfolderBase]: 1917/3414 cut-off events. [2025-01-09 16:46:30,782 INFO L125 PetriNetUnfolderBase]: For 21279/21305 co-relation queries the response was YES. [2025-01-09 16:46:30,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15581 conditions, 3414 events. 1917/3414 cut-off events. For 21279/21305 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 20260 event pairs, 843 based on Foata normal form. 60/3431 useless extension candidates. Maximal degree in co-relation 15010. Up to 1903 conditions per place. [2025-01-09 16:46:30,803 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 76 selfloop transitions, 18 changer transitions 12/128 dead transitions. [2025-01-09 16:46:30,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 128 transitions, 1621 flow [2025-01-09 16:46:30,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:46:30,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:46:30,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-01-09 16:46:30,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-01-09 16:46:30,806 INFO L175 Difference]: Start difference. First operand has 128 places, 127 transitions, 1486 flow. Second operand 4 states and 75 transitions. [2025-01-09 16:46:30,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 128 transitions, 1621 flow [2025-01-09 16:46:30,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 128 transitions, 1534 flow, removed 10 selfloop flow, removed 10 redundant places. [2025-01-09 16:46:30,844 INFO L231 Difference]: Finished difference. Result has 118 places, 105 transitions, 1158 flow [2025-01-09 16:46:30,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1158, PETRI_PLACES=118, PETRI_TRANSITIONS=105} [2025-01-09 16:46:30,845 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 80 predicate places. [2025-01-09 16:46:30,845 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 105 transitions, 1158 flow [2025-01-09 16:46:30,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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:46:30,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:30,845 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, 1, 1] [2025-01-09 16:46:30,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 16:46:30,845 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:30,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:30,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1628800146, now seen corresponding path program 1 times [2025-01-09 16:46:30,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:30,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632010074] [2025-01-09 16:46:30,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:46:30,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:30,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 16:46:30,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:46:30,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:30,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:31,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:31,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:31,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632010074] [2025-01-09 16:46:31,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632010074] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:31,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406129817] [2025-01-09 16:46:31,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:46:31,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:31,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:31,662 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:46:31,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:46:31,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 16:46:31,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:46:31,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:31,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:31,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 16:46:31,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:31,773 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 15 treesize of output 1 [2025-01-09 16:46:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:32,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:54,249 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 81 treesize of output 73 [2025-01-09 16:46:54,314 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-01-09 16:46:54,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 178 treesize of output 164 [2025-01-09 16:46:57,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:57,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406129817] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:46:57,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:46:57,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2025-01-09 16:46:57,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842736580] [2025-01-09 16:46:57,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:46:57,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-09 16:46:57,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:57,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-09 16:46:57,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1182, Unknown=4, NotChecked=0, Total=1406 [2025-01-09 16:46:57,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-01-09 16:46:57,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 105 transitions, 1158 flow. Second operand has 38 states, 38 states have (on average 9.210526315789474) internal successors, (350), 38 states have internal predecessors, (350), 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:46:57,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:57,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-01-09 16:46:57,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:09,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 16:47:13,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 16:47:19,983 INFO L124 PetriNetUnfolderBase]: 2641/4632 cut-off events. [2025-01-09 16:47:19,983 INFO L125 PetriNetUnfolderBase]: For 24918/25050 co-relation queries the response was YES. [2025-01-09 16:47:19,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20508 conditions, 4632 events. 2641/4632 cut-off events. For 24918/25050 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 28725 event pairs, 895 based on Foata normal form. 12/4576 useless extension candidates. Maximal degree in co-relation 19895. Up to 1312 conditions per place. [2025-01-09 16:47:20,012 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 218 selfloop transitions, 53 changer transitions 44/325 dead transitions. [2025-01-09 16:47:20,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 325 transitions, 3046 flow [2025-01-09 16:47:20,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 16:47:20,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-01-09 16:47:20,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 443 transitions. [2025-01-09 16:47:20,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4520408163265306 [2025-01-09 16:47:20,014 INFO L175 Difference]: Start difference. First operand has 118 places, 105 transitions, 1158 flow. Second operand 28 states and 443 transitions. [2025-01-09 16:47:20,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 325 transitions, 3046 flow [2025-01-09 16:47:20,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 325 transitions, 2970 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-01-09 16:47:20,048 INFO L231 Difference]: Finished difference. Result has 147 places, 132 transitions, 1561 flow [2025-01-09 16:47:20,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1561, PETRI_PLACES=147, PETRI_TRANSITIONS=132} [2025-01-09 16:47:20,049 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 109 predicate places. [2025-01-09 16:47:20,049 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 132 transitions, 1561 flow [2025-01-09 16:47:20,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 9.210526315789474) internal successors, (350), 38 states have internal predecessors, (350), 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:47:20,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:20,050 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, 1, 1] [2025-01-09 16:47:20,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 16:47:20,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:20,251 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:47:20,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:20,251 INFO L85 PathProgramCache]: Analyzing trace with hash 59951212, now seen corresponding path program 2 times [2025-01-09 16:47:20,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:20,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478932778] [2025-01-09 16:47:20,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:47:20,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:20,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-01-09 16:47:20,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:47:20,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:47:20,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:21,204 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:47:21,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:21,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478932778] [2025-01-09 16:47:21,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478932778] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:21,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093779851] [2025-01-09 16:47:21,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:47:21,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:21,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:21,206 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:47:21,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 16:47:21,245 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-01-09 16:47:21,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:47:21,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:47:21,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:21,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 16:47:21,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:21,314 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:47:21,838 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:47:21,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:47:23,744 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 77 treesize of output 69 [2025-01-09 16:47:23,841 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-01-09 16:47:23,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 161 treesize of output 147 [2025-01-09 16:47:25,220 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:47:25,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093779851] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:47:25,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:47:25,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2025-01-09 16:47:25,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140865301] [2025-01-09 16:47:25,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:47:25,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-09 16:47:25,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:25,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-09 16:47:25,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1215, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 16:47:25,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-01-09 16:47:25,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 132 transitions, 1561 flow. Second operand has 38 states, 38 states have (on average 9.210526315789474) internal successors, (350), 38 states have internal predecessors, (350), 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:47:25,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:25,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-01-09 16:47:25,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:29,684 INFO L124 PetriNetUnfolderBase]: 3423/5937 cut-off events. [2025-01-09 16:47:29,684 INFO L125 PetriNetUnfolderBase]: For 40275/40453 co-relation queries the response was YES. [2025-01-09 16:47:29,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28745 conditions, 5937 events. 3423/5937 cut-off events. For 40275/40453 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 38059 event pairs, 929 based on Foata normal form. 20/5886 useless extension candidates. Maximal degree in co-relation 28669. Up to 1312 conditions per place. [2025-01-09 16:47:29,730 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 218 selfloop transitions, 77 changer transitions 39/344 dead transitions. [2025-01-09 16:47:29,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 344 transitions, 3661 flow [2025-01-09 16:47:29,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 16:47:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-01-09 16:47:29,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 407 transitions. [2025-01-09 16:47:29,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46514285714285714 [2025-01-09 16:47:29,731 INFO L175 Difference]: Start difference. First operand has 147 places, 132 transitions, 1561 flow. Second operand 25 states and 407 transitions. [2025-01-09 16:47:29,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 344 transitions, 3661 flow [2025-01-09 16:47:29,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 344 transitions, 3488 flow, removed 61 selfloop flow, removed 12 redundant places. [2025-01-09 16:47:29,805 INFO L231 Difference]: Finished difference. Result has 161 places, 163 transitions, 2099 flow [2025-01-09 16:47:29,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2099, PETRI_PLACES=161, PETRI_TRANSITIONS=163} [2025-01-09 16:47:29,805 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 123 predicate places. [2025-01-09 16:47:29,805 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 163 transitions, 2099 flow [2025-01-09 16:47:29,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 9.210526315789474) internal successors, (350), 38 states have internal predecessors, (350), 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:47:29,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:29,806 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, 1, 1] [2025-01-09 16:47:29,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 16:47:30,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:30,006 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:47:30,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:30,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1914903744, now seen corresponding path program 3 times [2025-01-09 16:47:30,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:30,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28226302] [2025-01-09 16:47:30,007 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:47:30,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:30,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 2 equivalence classes. [2025-01-09 16:47:30,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:47:30,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:47:30,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:30,890 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:47:30,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:30,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28226302] [2025-01-09 16:47:30,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28226302] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:30,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143956362] [2025-01-09 16:47:30,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:47:30,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:30,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:30,893 INFO L229 MonitoredProcess]: Starting monitored process 8 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:47:30,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 16:47:30,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 2 equivalence classes. [2025-01-09 16:47:30,994 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:47:30,994 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:47:30,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:30,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-09 16:47:30,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:31,050 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 15 treesize of output 1 [2025-01-09 16:47:31,639 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:47:31,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:47:32,533 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 78 treesize of output 70 [2025-01-09 16:47:32,609 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-01-09 16:47:32,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 167 treesize of output 138 [2025-01-09 16:47:32,948 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:47:32,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143956362] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:47:32,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:47:32,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2025-01-09 16:47:32,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376724013] [2025-01-09 16:47:32,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:47:32,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 16:47:32,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:32,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 16:47:32,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1006, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 16:47:32,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-01-09 16:47:32,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 163 transitions, 2099 flow. Second operand has 35 states, 35 states have (on average 9.371428571428572) internal successors, (328), 35 states have internal predecessors, (328), 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:47:32,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:32,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-01-09 16:47:32,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand