./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 c00e63dc 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-?-c00e63d-m [2025-02-06 04:40:55,090 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:40:55,148 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:40:55,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:40:55,158 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:40:55,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:40:55,180 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:40:55,180 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:40:55,180 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:40:55,180 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:40:55,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:40:55,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:40:55,181 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:40:55,181 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:40:55,181 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:40:55,181 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:40:55,181 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:40:55,181 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:40:55,181 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:40:55,181 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:40:55,181 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:40:55,181 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:40:55,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:40:55,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:40:55,182 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:40:55,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:40:55,182 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:40:55,182 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:40:55,182 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:40:55,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:40:55,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:40:55,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:40:55,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:40:55,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:40:55,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:40:55,183 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:40:55,183 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:40:55,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:40:55,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:40:55,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:40:55,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:40:55,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:40:55,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:40:55,183 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-02-06 04:40:55,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:40:55,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:40:55,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:40:55,404 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:40:55,405 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:40:55,405 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-02-06 04:40:56,513 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/063c9fc4c/b2119e78d3de43ff8cde04cdceb11014/FLAG9abd43241 [2025-02-06 04:40:56,793 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:40:56,798 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2025-02-06 04:40:56,809 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/063c9fc4c/b2119e78d3de43ff8cde04cdceb11014/FLAG9abd43241 [2025-02-06 04:40:57,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/063c9fc4c/b2119e78d3de43ff8cde04cdceb11014 [2025-02-06 04:40:57,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:40:57,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:40:57,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:40:57,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:40:57,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:40:57,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:40:57" (1/1) ... [2025-02-06 04:40:57,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec176d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:57, skipping insertion in model container [2025-02-06 04:40:57,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:40:57" (1/1) ... [2025-02-06 04:40:57,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:40:57,268 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-02-06 04:40:57,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:40:57,285 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:40:57,304 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-02-06 04:40:57,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:40:57,320 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:40:57,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:57 WrapperNode [2025-02-06 04:40:57,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:40:57,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:40:57,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:40:57,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:40:57,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:57" (1/1) ... [2025-02-06 04:40:57,336 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:57" (1/1) ... [2025-02-06 04:40:57,353 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 162 [2025-02-06 04:40:57,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:40:57,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:40:57,356 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:40:57,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:40:57,361 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:57" (1/1) ... [2025-02-06 04:40:57,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:57" (1/1) ... [2025-02-06 04:40:57,369 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:57" (1/1) ... [2025-02-06 04:40:57,381 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-02-06 04:40:57,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:57" (1/1) ... [2025-02-06 04:40:57,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:57" (1/1) ... [2025-02-06 04:40:57,391 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:57" (1/1) ... [2025-02-06 04:40:57,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:57" (1/1) ... [2025-02-06 04:40:57,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:57" (1/1) ... [2025-02-06 04:40:57,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:57" (1/1) ... [2025-02-06 04:40:57,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:40:57,398 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:40:57,398 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:40:57,398 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:40:57,398 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:57" (1/1) ... [2025-02-06 04:40:57,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:40:57,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:40:57,424 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-02-06 04:40:57,427 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-02-06 04:40:57,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:40:57,442 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:40:57,442 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:40:57,442 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:40:57,442 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:40:57,442 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 04:40:57,442 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 04:40:57,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:40:57,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:40:57,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:40:57,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:40:57,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:40:57,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:40:57,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 04:40:57,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:40:57,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:40:57,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:40:57,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:40:57,444 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:40:57,506 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:40:57,507 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:40:57,706 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:40:57,709 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:40:57,859 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:40:57,859 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:40:57,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:40:57 BoogieIcfgContainer [2025-02-06 04:40:57,860 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:40:57,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:40:57,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:40:57,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:40:57,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:40:57" (1/3) ... [2025-02-06 04:40:57,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c990b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:40:57, skipping insertion in model container [2025-02-06 04:40:57,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:57" (2/3) ... [2025-02-06 04:40:57,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c990b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:40:57, skipping insertion in model container [2025-02-06 04:40:57,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:40:57" (3/3) ... [2025-02-06 04:40:57,868 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-multiply-verify.wvr.c [2025-02-06 04:40:57,877 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:40:57,878 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-02-06 04:40:57,879 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:40:57,914 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 04:40:57,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 91 flow [2025-02-06 04:40:57,954 INFO L124 PetriNetUnfolderBase]: 3/32 cut-off events. [2025-02-06 04:40:57,956 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:40:57,958 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 51 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-02-06 04:40:57,958 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 35 transitions, 91 flow [2025-02-06 04:40:57,960 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 31 transitions, 80 flow [2025-02-06 04:40:57,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:40:57,991 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;@5599d623, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:40:57,992 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 04:40:58,007 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:40:58,008 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2025-02-06 04:40:58,008 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:40:58,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:58,009 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-02-06 04:40:58,009 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-02-06 04:40:58,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:58,015 INFO L85 PathProgramCache]: Analyzing trace with hash -994515794, now seen corresponding path program 1 times [2025-02-06 04:40:58,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:58,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844518942] [2025-02-06 04:40:58,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:58,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:58,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:40:58,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:40:58,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:58,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:58,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:40:58,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:58,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844518942] [2025-02-06 04:40:58,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844518942] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:58,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:58,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:40:58,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928912941] [2025-02-06 04:40:58,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:58,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:40:58,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:58,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:40:58,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:40:58,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 04:40:58,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:58,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:58,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 04:40:58,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:58,484 INFO L124 PetriNetUnfolderBase]: 466/750 cut-off events. [2025-02-06 04:40:58,484 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2025-02-06 04:40:58,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1590 conditions, 750 events. 466/750 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3019 event pairs, 171 based on Foata normal form. 28/772 useless extension candidates. Maximal degree in co-relation 1442. Up to 532 conditions per place. [2025-02-06 04:40:58,492 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 39 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2025-02-06 04:40:58,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 200 flow [2025-02-06 04:40:58,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:40:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:40:58,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-02-06 04:40:58,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6095238095238096 [2025-02-06 04:40:58,501 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 80 flow. Second operand 3 states and 64 transitions. [2025-02-06 04:40:58,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 200 flow [2025-02-06 04:40:58,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 46 transitions, 184 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 04:40:58,506 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 87 flow [2025-02-06 04:40:58,508 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-02-06 04:40:58,510 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2025-02-06 04:40:58,510 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 87 flow [2025-02-06 04:40:58,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:58,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:58,510 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-02-06 04:40:58,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:40:58,511 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-02-06 04:40:58,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:58,512 INFO L85 PathProgramCache]: Analyzing trace with hash 386452688, now seen corresponding path program 2 times [2025-02-06 04:40:58,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:58,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931583045] [2025-02-06 04:40:58,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:40:58,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:58,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:40:58,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:40:58,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:40:58,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:58,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:40:58,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:58,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931583045] [2025-02-06 04:40:58,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931583045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:58,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:58,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:40:58,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096204039] [2025-02-06 04:40:58,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:58,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:40:58,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:58,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:40:58,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:40:58,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 04:40:58,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:58,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:58,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 04:40:58,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:58,889 INFO L124 PetriNetUnfolderBase]: 587/970 cut-off events. [2025-02-06 04:40:58,889 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2025-02-06 04:40:58,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2111 conditions, 970 events. 587/970 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4302 event pairs, 467 based on Foata normal form. 34/991 useless extension candidates. Maximal degree in co-relation 866. Up to 728 conditions per place. [2025-02-06 04:40:58,897 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 28 selfloop transitions, 2 changer transitions 15/49 dead transitions. [2025-02-06 04:40:58,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 49 transitions, 212 flow [2025-02-06 04:40:58,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:40:58,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:40:58,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-02-06 04:40:58,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2025-02-06 04:40:58,900 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 87 flow. Second operand 4 states and 73 transitions. [2025-02-06 04:40:58,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 49 transitions, 212 flow [2025-02-06 04:40:58,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 209 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:40:58,902 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 100 flow [2025-02-06 04:40:58,903 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-02-06 04:40:58,904 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2025-02-06 04:40:58,904 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 100 flow [2025-02-06 04:40:58,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:58,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:58,904 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-02-06 04:40:58,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:40:58,905 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-02-06 04:40:58,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:58,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1575825723, now seen corresponding path program 1 times [2025-02-06 04:40:58,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:58,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627006396] [2025-02-06 04:40:58,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:58,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:58,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:40:58,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:40:58,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:58,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:59,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:40:59,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:59,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627006396] [2025-02-06 04:40:59,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627006396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:59,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:59,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:40:59,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397700047] [2025-02-06 04:40:59,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:59,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:40:59,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:59,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:40:59,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:40:59,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 04:40:59,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:59,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:59,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 04:40:59,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:59,113 INFO L124 PetriNetUnfolderBase]: 304/517 cut-off events. [2025-02-06 04:40:59,113 INFO L125 PetriNetUnfolderBase]: For 118/122 co-relation queries the response was YES. [2025-02-06 04:40:59,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 517 events. 304/517 cut-off events. For 118/122 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1996 event pairs, 99 based on Foata normal form. 39/550 useless extension candidates. Maximal degree in co-relation 1148. Up to 197 conditions per place. [2025-02-06 04:40:59,119 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 44 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2025-02-06 04:40:59,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 240 flow [2025-02-06 04:40:59,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:40:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:40:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-02-06 04:40:59,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-02-06 04:40:59,121 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 100 flow. Second operand 4 states and 77 transitions. [2025-02-06 04:40:59,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 240 flow [2025-02-06 04:40:59,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 232 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-06 04:40:59,123 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 108 flow [2025-02-06 04:40:59,124 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-02-06 04:40:59,125 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2025-02-06 04:40:59,125 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 108 flow [2025-02-06 04:40:59,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:59,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:59,125 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-02-06 04:40:59,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:40:59,125 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-02-06 04:40:59,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:59,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1011553143, now seen corresponding path program 2 times [2025-02-06 04:40:59,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:59,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078248483] [2025-02-06 04:40:59,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:40:59,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:59,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-06 04:40:59,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 25 statements. [2025-02-06 04:40:59,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:40:59,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:59,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:40:59,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:59,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078248483] [2025-02-06 04:40:59,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078248483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:59,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:59,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:40:59,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593526024] [2025-02-06 04:40:59,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:59,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:40:59,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:59,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:40:59,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:40:59,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 04:40:59,752 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-02-06 04:40:59,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:59,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 04:40:59,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:00,094 INFO L124 PetriNetUnfolderBase]: 548/921 cut-off events. [2025-02-06 04:41:00,094 INFO L125 PetriNetUnfolderBase]: For 427/427 co-relation queries the response was YES. [2025-02-06 04:41:00,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2175 conditions, 921 events. 548/921 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4138 event pairs, 123 based on Foata normal form. 1/919 useless extension candidates. Maximal degree in co-relation 2156. Up to 341 conditions per place. [2025-02-06 04:41:00,099 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 62 selfloop transitions, 14 changer transitions 17/97 dead transitions. [2025-02-06 04:41:00,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 97 transitions, 467 flow [2025-02-06 04:41:00,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:41:00,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:41:00,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2025-02-06 04:41:00,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2025-02-06 04:41:00,103 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 108 flow. Second operand 8 states and 149 transitions. [2025-02-06 04:41:00,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 97 transitions, 467 flow [2025-02-06 04:41:00,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 97 transitions, 447 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-02-06 04:41:00,106 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 207 flow [2025-02-06 04:41:00,106 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-02-06 04:41:00,107 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2025-02-06 04:41:00,108 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 207 flow [2025-02-06 04:41:00,108 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-02-06 04:41:00,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:00,108 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-02-06 04:41:00,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:41:00,108 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-02-06 04:41:00,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:00,109 INFO L85 PathProgramCache]: Analyzing trace with hash -810646377, now seen corresponding path program 3 times [2025-02-06 04:41:00,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:00,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16646979] [2025-02-06 04:41:00,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:41:00,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:00,118 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-02-06 04:41:00,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 25 statements. [2025-02-06 04:41:00,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:41:00,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:00,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:41:00,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:00,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16646979] [2025-02-06 04:41:00,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16646979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:00,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:00,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:41:00,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295962738] [2025-02-06 04:41:00,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:00,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:41:00,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:00,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:41:00,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:41:00,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 04:41:00,548 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-02-06 04:41:00,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:00,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 04:41:00,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:00,831 INFO L124 PetriNetUnfolderBase]: 742/1250 cut-off events. [2025-02-06 04:41:00,831 INFO L125 PetriNetUnfolderBase]: For 1221/1226 co-relation queries the response was YES. [2025-02-06 04:41:00,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3594 conditions, 1250 events. 742/1250 cut-off events. For 1221/1226 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6072 event pairs, 185 based on Foata normal form. 6/1254 useless extension candidates. Maximal degree in co-relation 3578. Up to 405 conditions per place. [2025-02-06 04:41:00,839 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 64 selfloop transitions, 21 changer transitions 17/106 dead transitions. [2025-02-06 04:41:00,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 106 transitions, 627 flow [2025-02-06 04:41:00,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:41:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:41:00,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2025-02-06 04:41:00,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2025-02-06 04:41:00,840 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 207 flow. Second operand 8 states and 148 transitions. [2025-02-06 04:41:00,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 106 transitions, 627 flow [2025-02-06 04:41:00,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 106 transitions, 599 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-02-06 04:41:00,845 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 355 flow [2025-02-06 04:41:00,845 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-02-06 04:41:00,846 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2025-02-06 04:41:00,846 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 355 flow [2025-02-06 04:41:00,846 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-02-06 04:41:00,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:00,846 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-02-06 04:41:00,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:41:00,846 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-02-06 04:41:00,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:00,847 INFO L85 PathProgramCache]: Analyzing trace with hash 239200147, now seen corresponding path program 4 times [2025-02-06 04:41:00,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:00,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109005291] [2025-02-06 04:41:00,847 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:41:00,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:00,853 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-02-06 04:41:00,858 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:41:00,859 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:41:00,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:00,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:00,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:00,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109005291] [2025-02-06 04:41:00,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109005291] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:41:00,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828591664] [2025-02-06 04:41:00,954 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:41:00,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:41:00,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:41:00,956 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-02-06 04:41:00,958 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-02-06 04:41:01,006 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-02-06 04:41:01,025 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:41:01,025 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:41:01,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:01,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:41:01,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:41:01,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:01,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:41:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:01,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828591664] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:41:01,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:41:01,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-02-06 04:41:01,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448853866] [2025-02-06 04:41:01,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:41:01,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:41:01,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:01,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:41:01,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:41:01,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 04:41:01,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 355 flow. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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-02-06 04:41:01,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:01,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 04:41:01,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:01,316 INFO L124 PetriNetUnfolderBase]: 1343/2239 cut-off events. [2025-02-06 04:41:01,316 INFO L125 PetriNetUnfolderBase]: For 4167/4167 co-relation queries the response was YES. [2025-02-06 04:41:01,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7330 conditions, 2239 events. 1343/2239 cut-off events. For 4167/4167 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 12468 event pairs, 846 based on Foata normal form. 11/2243 useless extension candidates. Maximal degree in co-relation 7310. Up to 1070 conditions per place. [2025-02-06 04:41:01,326 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 51 selfloop transitions, 3 changer transitions 46/104 dead transitions. [2025-02-06 04:41:01,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 104 transitions, 873 flow [2025-02-06 04:41:01,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:41:01,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:41:01,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2025-02-06 04:41:01,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49142857142857144 [2025-02-06 04:41:01,327 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 355 flow. Second operand 5 states and 86 transitions. [2025-02-06 04:41:01,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 104 transitions, 873 flow [2025-02-06 04:41:01,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 104 transitions, 853 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-02-06 04:41:01,337 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 361 flow [2025-02-06 04:41:01,338 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-02-06 04:41:01,338 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 22 predicate places. [2025-02-06 04:41:01,338 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 361 flow [2025-02-06 04:41:01,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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-02-06 04:41:01,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:01,338 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-02-06 04:41:01,345 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-02-06 04:41:01,543 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-02-06 04:41:01,543 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-02-06 04:41:01,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:01,544 INFO L85 PathProgramCache]: Analyzing trace with hash -581322612, now seen corresponding path program 5 times [2025-02-06 04:41:01,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:01,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62823847] [2025-02-06 04:41:01,544 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:41:01,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:01,551 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-06 04:41:01,584 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:41:01,584 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:41:01,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:02,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:02,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:02,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62823847] [2025-02-06 04:41:02,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62823847] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:41:02,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208112992] [2025-02-06 04:41:02,819 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:41:02,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:41:02,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:41:02,822 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-02-06 04:41:02,823 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-02-06 04:41:02,866 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-06 04:41:02,888 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:41:02,888 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:41:02,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:02,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 04:41:02,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:41:02,955 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-02-06 04:41:03,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:03,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:41:03,793 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 82 treesize of output 74 [2025-02-06 04:41:03,829 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-02-06 04:41:03,830 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 145 treesize of output 129 [2025-02-06 04:41:04,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:04,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208112992] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:41:04,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:41:04,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2025-02-06 04:41:04,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731826657] [2025-02-06 04:41:04,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:41:04,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-06 04:41:04,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:04,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 04:41:04,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2025-02-06 04:41:04,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 04:41:04,130 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-02-06 04:41:04,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:04,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 04:41:04,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:07,189 INFO L124 PetriNetUnfolderBase]: 2750/4624 cut-off events. [2025-02-06 04:41:07,189 INFO L125 PetriNetUnfolderBase]: For 7559/7559 co-relation queries the response was YES. [2025-02-06 04:41:07,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14799 conditions, 4624 events. 2750/4624 cut-off events. For 7559/7559 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 29020 event pairs, 785 based on Foata normal form. 2/4619 useless extension candidates. Maximal degree in co-relation 14768. Up to 1276 conditions per place. [2025-02-06 04:41:07,209 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 221 selfloop transitions, 73 changer transitions 34/332 dead transitions. [2025-02-06 04:41:07,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 332 transitions, 2329 flow [2025-02-06 04:41:07,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 04:41:07,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-02-06 04:41:07,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 449 transitions. [2025-02-06 04:41:07,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47513227513227513 [2025-02-06 04:41:07,211 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 361 flow. Second operand 27 states and 449 transitions. [2025-02-06 04:41:07,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 332 transitions, 2329 flow [2025-02-06 04:41:07,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 332 transitions, 2309 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-02-06 04:41:07,233 INFO L231 Difference]: Finished difference. Result has 92 places, 129 transitions, 1233 flow [2025-02-06 04:41:07,233 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=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1233, PETRI_PLACES=92, PETRI_TRANSITIONS=129} [2025-02-06 04:41:07,234 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 54 predicate places. [2025-02-06 04:41:07,234 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 129 transitions, 1233 flow [2025-02-06 04:41:07,234 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-02-06 04:41:07,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:07,234 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-02-06 04:41:07,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 04:41:07,439 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-02-06 04:41:07,439 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-02-06 04:41:07,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:07,440 INFO L85 PathProgramCache]: Analyzing trace with hash -8273144, now seen corresponding path program 6 times [2025-02-06 04:41:07,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:07,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055825286] [2025-02-06 04:41:07,440 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:41:07,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:07,445 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-02-06 04:41:07,459 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 26 statements. [2025-02-06 04:41:07,459 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:41:07,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:07,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:41:07,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:07,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055825286] [2025-02-06 04:41:07,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055825286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:07,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:07,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:41:07,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838812899] [2025-02-06 04:41:07,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:07,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:41:07,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:07,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:41:07,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:41:07,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 04:41:07,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 129 transitions, 1233 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-02-06 04:41:07,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:07,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 04:41:07,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:08,086 INFO L124 PetriNetUnfolderBase]: 2815/4756 cut-off events. [2025-02-06 04:41:08,087 INFO L125 PetriNetUnfolderBase]: For 13143/13143 co-relation queries the response was YES. [2025-02-06 04:41:08,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16791 conditions, 4756 events. 2815/4756 cut-off events. For 13143/13143 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 30331 event pairs, 703 based on Foata normal form. 2/4746 useless extension candidates. Maximal degree in co-relation 16745. Up to 1538 conditions per place. [2025-02-06 04:41:08,116 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 95 selfloop transitions, 68 changer transitions 18/185 dead transitions. [2025-02-06 04:41:08,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 185 transitions, 1791 flow [2025-02-06 04:41:08,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:41:08,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:41:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2025-02-06 04:41:08,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-02-06 04:41:08,118 INFO L175 Difference]: Start difference. First operand has 92 places, 129 transitions, 1233 flow. Second operand 8 states and 152 transitions. [2025-02-06 04:41:08,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 185 transitions, 1791 flow [2025-02-06 04:41:08,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 185 transitions, 1685 flow, removed 49 selfloop flow, removed 8 redundant places. [2025-02-06 04:41:08,168 INFO L231 Difference]: Finished difference. Result has 90 places, 131 transitions, 1317 flow [2025-02-06 04:41:08,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1317, PETRI_PLACES=90, PETRI_TRANSITIONS=131} [2025-02-06 04:41:08,169 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 52 predicate places. [2025-02-06 04:41:08,169 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 131 transitions, 1317 flow [2025-02-06 04:41:08,170 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-02-06 04:41:08,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:08,170 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-02-06 04:41:08,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:41:08,170 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-02-06 04:41:08,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:08,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1709147508, now seen corresponding path program 7 times [2025-02-06 04:41:08,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:08,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630937135] [2025-02-06 04:41:08,170 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:41:08,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:08,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 04:41:08,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:41:08,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:41:08,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:09,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:09,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630937135] [2025-02-06 04:41:09,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630937135] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:41:09,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363119965] [2025-02-06 04:41:09,499 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:41:09,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:41:09,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:41:09,501 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-02-06 04:41:09,505 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-02-06 04:41:09,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 04:41:09,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:41:09,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:41:09,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:09,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 04:41:09,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:41:09,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 15 treesize of output 1 [2025-02-06 04:41:09,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:09,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:41:10,539 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 82 treesize of output 74 [2025-02-06 04:41:10,575 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-02-06 04:41:10,575 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 145 treesize of output 129 [2025-02-06 04:41:10,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:10,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363119965] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:41:10,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:41:10,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-02-06 04:41:10,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454163718] [2025-02-06 04:41:10,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:41:10,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 04:41:10,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:10,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 04:41:10,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2025-02-06 04:41:10,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 04:41:10,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 131 transitions, 1317 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-02-06 04:41:10,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:10,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 04:41:10,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:14,991 INFO L124 PetriNetUnfolderBase]: 3414/5893 cut-off events. [2025-02-06 04:41:14,991 INFO L125 PetriNetUnfolderBase]: For 20684/20718 co-relation queries the response was YES. [2025-02-06 04:41:15,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20817 conditions, 5893 events. 3414/5893 cut-off events. For 20684/20718 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 39920 event pairs, 911 based on Foata normal form. 36/5926 useless extension candidates. Maximal degree in co-relation 20765. Up to 1946 conditions per place. [2025-02-06 04:41:15,055 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 235 selfloop transitions, 98 changer transitions 34/371 dead transitions. [2025-02-06 04:41:15,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 371 transitions, 3027 flow [2025-02-06 04:41:15,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-06 04:41:15,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-02-06 04:41:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 518 transitions. [2025-02-06 04:41:15,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4625 [2025-02-06 04:41:15,062 INFO L175 Difference]: Start difference. First operand has 90 places, 131 transitions, 1317 flow. Second operand 32 states and 518 transitions. [2025-02-06 04:41:15,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 371 transitions, 3027 flow [2025-02-06 04:41:15,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 371 transitions, 2877 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-02-06 04:41:15,119 INFO L231 Difference]: Finished difference. Result has 123 places, 170 transitions, 1833 flow [2025-02-06 04:41:15,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1196, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1833, PETRI_PLACES=123, PETRI_TRANSITIONS=170} [2025-02-06 04:41:15,120 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 85 predicate places. [2025-02-06 04:41:15,120 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 170 transitions, 1833 flow [2025-02-06 04:41:15,120 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-02-06 04:41:15,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:15,120 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-02-06 04:41:15,129 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-02-06 04:41:15,321 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-02-06 04:41:15,321 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-02-06 04:41:15,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:15,321 INFO L85 PathProgramCache]: Analyzing trace with hash -272771400, now seen corresponding path program 8 times [2025-02-06 04:41:15,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:15,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758432810] [2025-02-06 04:41:15,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:41:15,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:15,328 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-06 04:41:15,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 26 statements. [2025-02-06 04:41:15,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:41:15,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:41:15,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:15,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758432810] [2025-02-06 04:41:15,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758432810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:15,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:15,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:41:15,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359105176] [2025-02-06 04:41:15,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:15,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:41:15,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:15,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:41:15,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:41:15,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 04:41:15,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 170 transitions, 1833 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-02-06 04:41:15,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:15,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 04:41:15,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:16,112 INFO L124 PetriNetUnfolderBase]: 3454/5970 cut-off events. [2025-02-06 04:41:16,113 INFO L125 PetriNetUnfolderBase]: For 26186/26215 co-relation queries the response was YES. [2025-02-06 04:41:16,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22504 conditions, 5970 events. 3454/5970 cut-off events. For 26186/26215 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 40217 event pairs, 1026 based on Foata normal form. 31/5998 useless extension candidates. Maximal degree in co-relation 22437. Up to 2549 conditions per place. [2025-02-06 04:41:16,138 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 125 selfloop transitions, 73 changer transitions 19/221 dead transitions. [2025-02-06 04:41:16,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 221 transitions, 2495 flow [2025-02-06 04:41:16,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:41:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:41:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2025-02-06 04:41:16,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5035714285714286 [2025-02-06 04:41:16,139 INFO L175 Difference]: Start difference. First operand has 123 places, 170 transitions, 1833 flow. Second operand 8 states and 141 transitions. [2025-02-06 04:41:16,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 221 transitions, 2495 flow [2025-02-06 04:41:16,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 221 transitions, 2394 flow, removed 44 selfloop flow, removed 9 redundant places. [2025-02-06 04:41:16,221 INFO L231 Difference]: Finished difference. Result has 121 places, 173 transitions, 1945 flow [2025-02-06 04:41:16,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1736, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1945, PETRI_PLACES=121, PETRI_TRANSITIONS=173} [2025-02-06 04:41:16,222 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 83 predicate places. [2025-02-06 04:41:16,222 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 173 transitions, 1945 flow [2025-02-06 04:41:16,222 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-02-06 04:41:16,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:16,222 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-02-06 04:41:16,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:41:16,223 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-02-06 04:41:16,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:16,223 INFO L85 PathProgramCache]: Analyzing trace with hash -2141977109, now seen corresponding path program 1 times [2025-02-06 04:41:16,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:16,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259358607] [2025-02-06 04:41:16,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:41:16,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:16,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 04:41:16,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:41:16,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:41:16,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:41:16,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:16,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259358607] [2025-02-06 04:41:16,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259358607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:16,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:16,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:41:16,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127358590] [2025-02-06 04:41:16,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:16,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:41:16,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:16,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:41:16,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:41:16,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2025-02-06 04:41:16,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 173 transitions, 1945 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-02-06 04:41:16,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:16,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2025-02-06 04:41:16,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:16,986 INFO L124 PetriNetUnfolderBase]: 5763/9234 cut-off events. [2025-02-06 04:41:16,987 INFO L125 PetriNetUnfolderBase]: For 43213/43213 co-relation queries the response was YES. [2025-02-06 04:41:17,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34742 conditions, 9234 events. 5763/9234 cut-off events. For 43213/43213 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 59790 event pairs, 825 based on Foata normal form. 0/8303 useless extension candidates. Maximal degree in co-relation 34681. Up to 4969 conditions per place. [2025-02-06 04:41:17,031 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 286 selfloop transitions, 43 changer transitions 7/338 dead transitions. [2025-02-06 04:41:17,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 338 transitions, 4480 flow [2025-02-06 04:41:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:41:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:41:17,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2025-02-06 04:41:17,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5469387755102041 [2025-02-06 04:41:17,033 INFO L175 Difference]: Start difference. First operand has 121 places, 173 transitions, 1945 flow. Second operand 7 states and 134 transitions. [2025-02-06 04:41:17,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 338 transitions, 4480 flow [2025-02-06 04:41:17,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 338 transitions, 4179 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-02-06 04:41:17,282 INFO L231 Difference]: Finished difference. Result has 124 places, 198 transitions, 2245 flow [2025-02-06 04:41:17,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1782, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2245, PETRI_PLACES=124, PETRI_TRANSITIONS=198} [2025-02-06 04:41:17,283 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 86 predicate places. [2025-02-06 04:41:17,283 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 198 transitions, 2245 flow [2025-02-06 04:41:17,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-02-06 04:41:17,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:17,283 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-02-06 04:41:17,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:41:17,283 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-02-06 04:41:17,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:17,284 INFO L85 PathProgramCache]: Analyzing trace with hash -718200215, now seen corresponding path program 2 times [2025-02-06 04:41:17,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:17,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675053879] [2025-02-06 04:41:17,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:41:17,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:17,295 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-06 04:41:17,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 29 statements. [2025-02-06 04:41:17,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:41:17,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:17,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:41:17,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:17,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675053879] [2025-02-06 04:41:17,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675053879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:17,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:17,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:41:17,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42422740] [2025-02-06 04:41:17,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:17,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:41:17,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:17,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:41:17,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:41:17,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2025-02-06 04:41:17,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 198 transitions, 2245 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:17,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:17,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2025-02-06 04:41:17,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:18,390 INFO L124 PetriNetUnfolderBase]: 5937/9541 cut-off events. [2025-02-06 04:41:18,390 INFO L125 PetriNetUnfolderBase]: For 44617/44617 co-relation queries the response was YES. [2025-02-06 04:41:18,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40924 conditions, 9541 events. 5937/9541 cut-off events. For 44617/44617 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 62043 event pairs, 2945 based on Foata normal form. 40/9580 useless extension candidates. Maximal degree in co-relation 40042. Up to 7040 conditions per place. [2025-02-06 04:41:18,481 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 228 selfloop transitions, 41 changer transitions 8/279 dead transitions. [2025-02-06 04:41:18,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 279 transitions, 3637 flow [2025-02-06 04:41:18,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:41:18,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:41:18,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2025-02-06 04:41:18,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2025-02-06 04:41:18,482 INFO L175 Difference]: Start difference. First operand has 124 places, 198 transitions, 2245 flow. Second operand 5 states and 90 transitions. [2025-02-06 04:41:18,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 279 transitions, 3637 flow [2025-02-06 04:41:18,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 279 transitions, 3637 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:41:18,851 INFO L231 Difference]: Finished difference. Result has 131 places, 207 transitions, 2484 flow [2025-02-06 04:41:18,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2245, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2484, PETRI_PLACES=131, PETRI_TRANSITIONS=207} [2025-02-06 04:41:18,852 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 93 predicate places. [2025-02-06 04:41:18,852 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 207 transitions, 2484 flow [2025-02-06 04:41:18,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:18,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:18,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-02-06 04:41:18,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:41:18,853 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-02-06 04:41:18,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:18,853 INFO L85 PathProgramCache]: Analyzing trace with hash -847355128, now seen corresponding path program 1 times [2025-02-06 04:41:18,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:18,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254638250] [2025-02-06 04:41:18,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:41:18,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:18,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 04:41:18,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:41:18,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:41:18,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:18,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:41:18,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:18,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254638250] [2025-02-06 04:41:18,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254638250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:18,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:18,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:41:18,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510377359] [2025-02-06 04:41:18,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:18,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:41:18,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:18,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:41:18,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:41:18,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2025-02-06 04:41:18,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 207 transitions, 2484 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:18,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:18,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2025-02-06 04:41:18,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:19,509 INFO L124 PetriNetUnfolderBase]: 5119/8250 cut-off events. [2025-02-06 04:41:19,510 INFO L125 PetriNetUnfolderBase]: For 45746/45746 co-relation queries the response was YES. [2025-02-06 04:41:19,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37975 conditions, 8250 events. 5119/8250 cut-off events. For 45746/45746 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 52655 event pairs, 1930 based on Foata normal form. 165/8414 useless extension candidates. Maximal degree in co-relation 37536. Up to 4689 conditions per place. [2025-02-06 04:41:19,651 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 193 selfloop transitions, 27 changer transitions 31/253 dead transitions. [2025-02-06 04:41:19,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 253 transitions, 3420 flow [2025-02-06 04:41:19,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:41:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:41:19,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-02-06 04:41:19,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5485714285714286 [2025-02-06 04:41:19,652 INFO L175 Difference]: Start difference. First operand has 131 places, 207 transitions, 2484 flow. Second operand 5 states and 96 transitions. [2025-02-06 04:41:19,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 253 transitions, 3420 flow [2025-02-06 04:41:19,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 253 transitions, 3326 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-02-06 04:41:19,837 INFO L231 Difference]: Finished difference. Result has 130 places, 177 transitions, 2076 flow [2025-02-06 04:41:19,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2285, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2076, PETRI_PLACES=130, PETRI_TRANSITIONS=177} [2025-02-06 04:41:19,838 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 92 predicate places. [2025-02-06 04:41:19,839 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 177 transitions, 2076 flow [2025-02-06 04:41:19,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:19,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:19,839 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-02-06 04:41:19,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 04:41:19,839 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-02-06 04:41:19,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:19,840 INFO L85 PathProgramCache]: Analyzing trace with hash 882399051, now seen corresponding path program 3 times [2025-02-06 04:41:19,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:19,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19539580] [2025-02-06 04:41:19,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:41:19,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:19,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-02-06 04:41:19,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:41:19,858 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:41:19,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:19,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:41:19,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:19,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19539580] [2025-02-06 04:41:19,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19539580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:19,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:19,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:41:19,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192044593] [2025-02-06 04:41:19,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:19,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:41:19,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:19,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:41:19,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:41:19,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2025-02-06 04:41:19,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 177 transitions, 2076 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:19,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:19,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2025-02-06 04:41:19,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:20,532 INFO L124 PetriNetUnfolderBase]: 4809/7715 cut-off events. [2025-02-06 04:41:20,532 INFO L125 PetriNetUnfolderBase]: For 43531/43531 co-relation queries the response was YES. [2025-02-06 04:41:20,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35307 conditions, 7715 events. 4809/7715 cut-off events. For 43531/43531 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 47631 event pairs, 2119 based on Foata normal form. 146/7860 useless extension candidates. Maximal degree in co-relation 34851. Up to 4874 conditions per place. [2025-02-06 04:41:20,569 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 189 selfloop transitions, 35 changer transitions 5/231 dead transitions. [2025-02-06 04:41:20,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 231 transitions, 3087 flow [2025-02-06 04:41:20,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:41:20,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:41:20,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-02-06 04:41:20,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-02-06 04:41:20,570 INFO L175 Difference]: Start difference. First operand has 130 places, 177 transitions, 2076 flow. Second operand 4 states and 77 transitions. [2025-02-06 04:41:20,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 231 transitions, 3087 flow [2025-02-06 04:41:20,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 231 transitions, 2912 flow, removed 24 selfloop flow, removed 6 redundant places. [2025-02-06 04:41:20,719 INFO L231 Difference]: Finished difference. Result has 126 places, 171 transitions, 1936 flow [2025-02-06 04:41:20,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1864, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1936, PETRI_PLACES=126, PETRI_TRANSITIONS=171} [2025-02-06 04:41:20,720 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 88 predicate places. [2025-02-06 04:41:20,720 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 171 transitions, 1936 flow [2025-02-06 04:41:20,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:20,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:20,720 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-02-06 04:41:20,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 04:41:20,720 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-02-06 04:41:20,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:20,721 INFO L85 PathProgramCache]: Analyzing trace with hash -336980145, now seen corresponding path program 4 times [2025-02-06 04:41:20,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:20,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134466417] [2025-02-06 04:41:20,721 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:41:20,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:20,726 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-02-06 04:41:20,730 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:41:20,730 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:41:20,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:20,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:41:20,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:20,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134466417] [2025-02-06 04:41:20,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134466417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:20,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:20,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:41:20,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735554476] [2025-02-06 04:41:20,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:20,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:41:20,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:20,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:41:20,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:41:20,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2025-02-06 04:41:20,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 171 transitions, 1936 flow. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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-02-06 04:41:20,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:20,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2025-02-06 04:41:20,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:21,545 INFO L124 PetriNetUnfolderBase]: 5037/8050 cut-off events. [2025-02-06 04:41:21,546 INFO L125 PetriNetUnfolderBase]: For 43002/43002 co-relation queries the response was YES. [2025-02-06 04:41:21,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38097 conditions, 8050 events. 5037/8050 cut-off events. For 43002/43002 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 50044 event pairs, 1198 based on Foata normal form. 40/8089 useless extension candidates. Maximal degree in co-relation 37701. Up to 2978 conditions per place. [2025-02-06 04:41:21,601 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 218 selfloop transitions, 68 changer transitions 3/291 dead transitions. [2025-02-06 04:41:21,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 291 transitions, 3745 flow [2025-02-06 04:41:21,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:41:21,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:41:21,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2025-02-06 04:41:21,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2025-02-06 04:41:21,603 INFO L175 Difference]: Start difference. First operand has 126 places, 171 transitions, 1936 flow. Second operand 8 states and 128 transitions. [2025-02-06 04:41:21,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 291 transitions, 3745 flow [2025-02-06 04:41:21,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 291 transitions, 3662 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-02-06 04:41:21,778 INFO L231 Difference]: Finished difference. Result has 130 places, 199 transitions, 2419 flow [2025-02-06 04:41:21,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1877, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2419, PETRI_PLACES=130, PETRI_TRANSITIONS=199} [2025-02-06 04:41:21,779 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 92 predicate places. [2025-02-06 04:41:21,779 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 199 transitions, 2419 flow [2025-02-06 04:41:21,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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-02-06 04:41:21,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:21,784 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-02-06 04:41:21,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 04:41:21,784 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-02-06 04:41:21,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:21,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1026019527, now seen corresponding path program 5 times [2025-02-06 04:41:21,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:21,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835211121] [2025-02-06 04:41:21,784 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:41:21,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:21,794 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-06 04:41:21,803 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:41:21,803 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:41:21,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:21,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:41:21,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:21,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835211121] [2025-02-06 04:41:21,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835211121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:21,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:21,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:41:21,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598944092] [2025-02-06 04:41:21,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:21,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:41:21,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:21,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:41:21,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:41:21,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2025-02-06 04:41:21,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 199 transitions, 2419 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:21,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:21,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2025-02-06 04:41:21,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:22,658 INFO L124 PetriNetUnfolderBase]: 4449/7124 cut-off events. [2025-02-06 04:41:22,658 INFO L125 PetriNetUnfolderBase]: For 41451/41451 co-relation queries the response was YES. [2025-02-06 04:41:22,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35355 conditions, 7124 events. 4449/7124 cut-off events. For 41451/41451 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 42350 event pairs, 1587 based on Foata normal form. 64/7187 useless extension candidates. Maximal degree in co-relation 34873. Up to 3609 conditions per place. [2025-02-06 04:41:22,715 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 166 selfloop transitions, 40 changer transitions 12/220 dead transitions. [2025-02-06 04:41:22,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 220 transitions, 2955 flow [2025-02-06 04:41:22,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:41:22,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:41:22,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-02-06 04:41:22,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-02-06 04:41:22,716 INFO L175 Difference]: Start difference. First operand has 130 places, 199 transitions, 2419 flow. Second operand 4 states and 80 transitions. [2025-02-06 04:41:22,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 220 transitions, 2955 flow [2025-02-06 04:41:22,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 220 transitions, 2897 flow, removed 21 selfloop flow, removed 3 redundant places. [2025-02-06 04:41:22,904 INFO L231 Difference]: Finished difference. Result has 131 places, 178 transitions, 2156 flow [2025-02-06 04:41:22,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2268, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2156, PETRI_PLACES=131, PETRI_TRANSITIONS=178} [2025-02-06 04:41:22,905 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 93 predicate places. [2025-02-06 04:41:22,905 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 178 transitions, 2156 flow [2025-02-06 04:41:22,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:22,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:22,905 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 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-02-06 04:41:22,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 04:41:22,905 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-02-06 04:41:22,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:22,906 INFO L85 PathProgramCache]: Analyzing trace with hash -357089526, now seen corresponding path program 9 times [2025-02-06 04:41:22,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:22,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954502785] [2025-02-06 04:41:22,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:41:22,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:22,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-02-06 04:41:22,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-06 04:41:22,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:41:22,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 04:41:23,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:23,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954502785] [2025-02-06 04:41:23,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954502785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:23,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:23,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:41:23,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006579116] [2025-02-06 04:41:23,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:23,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:41:23,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:23,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:41:23,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:41:23,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 04:41:23,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 178 transitions, 2156 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-02-06 04:41:23,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:23,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 04:41:23,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:23,929 INFO L124 PetriNetUnfolderBase]: 3377/5827 cut-off events. [2025-02-06 04:41:23,929 INFO L125 PetriNetUnfolderBase]: For 35822/35983 co-relation queries the response was YES. [2025-02-06 04:41:23,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28548 conditions, 5827 events. 3377/5827 cut-off events. For 35822/35983 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 38418 event pairs, 1078 based on Foata normal form. 5/5737 useless extension candidates. Maximal degree in co-relation 28232. Up to 2379 conditions per place. [2025-02-06 04:41:23,974 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 134 selfloop transitions, 51 changer transitions 31/232 dead transitions. [2025-02-06 04:41:23,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 232 transitions, 2872 flow [2025-02-06 04:41:23,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:41:23,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:41:23,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2025-02-06 04:41:23,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2025-02-06 04:41:23,975 INFO L175 Difference]: Start difference. First operand has 131 places, 178 transitions, 2156 flow. Second operand 8 states and 142 transitions. [2025-02-06 04:41:23,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 232 transitions, 2872 flow [2025-02-06 04:41:24,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 232 transitions, 2751 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-06 04:41:24,064 INFO L231 Difference]: Finished difference. Result has 131 places, 174 transitions, 2104 flow [2025-02-06 04:41:24,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2048, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2104, PETRI_PLACES=131, PETRI_TRANSITIONS=174} [2025-02-06 04:41:24,065 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 93 predicate places. [2025-02-06 04:41:24,065 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 174 transitions, 2104 flow [2025-02-06 04:41:24,066 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-02-06 04:41:24,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:24,066 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 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-02-06 04:41:24,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 04:41:24,066 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-02-06 04:41:24,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:24,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1784183806, now seen corresponding path program 10 times [2025-02-06 04:41:24,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:24,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476492036] [2025-02-06 04:41:24,068 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:41:24,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:24,074 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-06 04:41:24,124 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:41:24,124 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:41:24,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:28,216 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:28,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:28,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476492036] [2025-02-06 04:41:28,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476492036] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:41:28,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633230459] [2025-02-06 04:41:28,217 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:41:28,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:41:28,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:41:28,219 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-02-06 04:41:28,220 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-02-06 04:41:28,266 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-06 04:41:28,285 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:41:28,286 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:41:28,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:28,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 04:41:28,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:41:28,610 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:41:28,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:41:28,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:41:28,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 60 [2025-02-06 04:41:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 04:41:28,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633230459] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:41:28,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:41:28,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15, 12] total 31 [2025-02-06 04:41:28,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629788787] [2025-02-06 04:41:28,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:28,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:41:28,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:28,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:41:28,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2025-02-06 04:41:28,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 04:41:28,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 174 transitions, 2104 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-02-06 04:41:28,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:28,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 04:41:28,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:29,452 INFO L124 PetriNetUnfolderBase]: 3296/5680 cut-off events. [2025-02-06 04:41:29,452 INFO L125 PetriNetUnfolderBase]: For 34575/34726 co-relation queries the response was YES. [2025-02-06 04:41:29,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27825 conditions, 5680 events. 3296/5680 cut-off events. For 34575/34726 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 37172 event pairs, 1015 based on Foata normal form. 29/5643 useless extension candidates. Maximal degree in co-relation 27776. Up to 2342 conditions per place. [2025-02-06 04:41:29,492 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 112 selfloop transitions, 68 changer transitions 28/224 dead transitions. [2025-02-06 04:41:29,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 224 transitions, 2784 flow [2025-02-06 04:41:29,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:41:29,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:41:29,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2025-02-06 04:41:29,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-06 04:41:29,494 INFO L175 Difference]: Start difference. First operand has 131 places, 174 transitions, 2104 flow. Second operand 8 states and 140 transitions. [2025-02-06 04:41:29,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 224 transitions, 2784 flow [2025-02-06 04:41:29,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 224 transitions, 2668 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-02-06 04:41:29,568 INFO L231 Difference]: Finished difference. Result has 127 places, 166 transitions, 2036 flow [2025-02-06 04:41:29,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1992, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2036, PETRI_PLACES=127, PETRI_TRANSITIONS=166} [2025-02-06 04:41:29,568 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 89 predicate places. [2025-02-06 04:41:29,568 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 166 transitions, 2036 flow [2025-02-06 04:41:29,568 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-02-06 04:41:29,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:29,569 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-02-06 04:41:29,575 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-02-06 04:41:29,769 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,SelfDestructingSolverStorable17 [2025-02-06 04:41:29,770 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-02-06 04:41:29,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:29,770 INFO L85 PathProgramCache]: Analyzing trace with hash 144310257, now seen corresponding path program 1 times [2025-02-06 04:41:29,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:29,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490892710] [2025-02-06 04:41:29,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:41:29,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:29,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 04:41:29,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:41:29,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:41:29,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:30,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:30,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:30,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490892710] [2025-02-06 04:41:30,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490892710] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:41:30,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798777952] [2025-02-06 04:41:30,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:41:30,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:41:30,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:41:30,896 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-02-06 04:41:30,900 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-02-06 04:41:30,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 04:41:30,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:41:30,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:41:30,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:30,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 04:41:30,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:41:31,035 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-02-06 04:41:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:31,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:41:32,289 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 80 treesize of output 72 [2025-02-06 04:41:32,318 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-02-06 04:41:32,318 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 173 treesize of output 144 [2025-02-06 04:41:32,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:32,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798777952] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:41:32,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:41:32,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2025-02-06 04:41:32,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24011816] [2025-02-06 04:41:32,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:41:32,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-06 04:41:32,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:32,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-06 04:41:32,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1199, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 04:41:32,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 04:41:32,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 166 transitions, 2036 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-02-06 04:41:32,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:32,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 04:41:32,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:37,872 INFO L124 PetriNetUnfolderBase]: 4404/7546 cut-off events. [2025-02-06 04:41:37,872 INFO L125 PetriNetUnfolderBase]: For 45726/45990 co-relation queries the response was YES. [2025-02-06 04:41:37,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36313 conditions, 7546 events. 4404/7546 cut-off events. For 45726/45990 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 51308 event pairs, 1185 based on Foata normal form. 32/7471 useless extension candidates. Maximal degree in co-relation 36262. Up to 1348 conditions per place. [2025-02-06 04:41:37,925 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 360 selfloop transitions, 106 changer transitions 54/536 dead transitions. [2025-02-06 04:41:37,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 536 transitions, 5512 flow [2025-02-06 04:41:37,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-06 04:41:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-02-06 04:41:37,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 652 transitions. [2025-02-06 04:41:37,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4543554006968641 [2025-02-06 04:41:37,927 INFO L175 Difference]: Start difference. First operand has 127 places, 166 transitions, 2036 flow. Second operand 41 states and 652 transitions. [2025-02-06 04:41:37,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 536 transitions, 5512 flow [2025-02-06 04:41:38,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 536 transitions, 5332 flow, removed 14 selfloop flow, removed 9 redundant places. [2025-02-06 04:41:38,020 INFO L231 Difference]: Finished difference. Result has 167 places, 214 transitions, 2676 flow [2025-02-06 04:41:38,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=2676, PETRI_PLACES=167, PETRI_TRANSITIONS=214} [2025-02-06 04:41:38,021 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 129 predicate places. [2025-02-06 04:41:38,021 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 214 transitions, 2676 flow [2025-02-06 04:41:38,021 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-02-06 04:41:38,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:38,022 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-02-06 04:41:38,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 04:41:38,226 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-02-06 04:41:38,226 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-02-06 04:41:38,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:38,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1958595935, now seen corresponding path program 2 times [2025-02-06 04:41:38,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:38,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061577969] [2025-02-06 04:41:38,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:41:38,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:38,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-02-06 04:41:38,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:41:38,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:41:38,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:38,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:38,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061577969] [2025-02-06 04:41:38,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061577969] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:41:38,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532969045] [2025-02-06 04:41:38,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:41:38,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:41:38,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:41:38,873 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-02-06 04:41:38,873 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-02-06 04:41:38,914 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-02-06 04:41:38,943 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:41:38,944 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:41:38,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:38,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 04:41:38,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:41:38,976 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-02-06 04:41:39,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:39,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:41:39,978 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-02-06 04:41:40,005 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-02-06 04:41:40,005 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 163 treesize of output 134 [2025-02-06 04:41:40,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:40,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532969045] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:41:40,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:41:40,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2025-02-06 04:41:40,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113651294] [2025-02-06 04:41:40,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:41:40,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 04:41:40,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:40,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 04:41:40,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1006, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 04:41:40,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 04:41:40,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 214 transitions, 2676 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-02-06 04:41:40,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:40,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 04:41:40,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:46,612 INFO L124 PetriNetUnfolderBase]: 6208/10522 cut-off events. [2025-02-06 04:41:46,612 INFO L125 PetriNetUnfolderBase]: For 79678/80070 co-relation queries the response was YES. [2025-02-06 04:41:46,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54550 conditions, 10522 events. 6208/10522 cut-off events. For 79678/80070 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 74179 event pairs, 1383 based on Foata normal form. 41/10395 useless extension candidates. Maximal degree in co-relation 54480. Up to 2015 conditions per place. [2025-02-06 04:41:46,688 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 442 selfloop transitions, 159 changer transitions 51/668 dead transitions. [2025-02-06 04:41:46,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 668 transitions, 7381 flow [2025-02-06 04:41:46,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-02-06 04:41:46,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-02-06 04:41:46,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 768 transitions. [2025-02-06 04:41:46,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4668693009118541 [2025-02-06 04:41:46,690 INFO L175 Difference]: Start difference. First operand has 167 places, 214 transitions, 2676 flow. Second operand 47 states and 768 transitions. [2025-02-06 04:41:46,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 668 transitions, 7381 flow [2025-02-06 04:41:46,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 668 transitions, 7019 flow, removed 129 selfloop flow, removed 21 redundant places. [2025-02-06 04:41:46,894 INFO L231 Difference]: Finished difference. Result has 203 places, 281 transitions, 3898 flow [2025-02-06 04:41:46,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2426, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=3898, PETRI_PLACES=203, PETRI_TRANSITIONS=281} [2025-02-06 04:41:46,894 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 165 predicate places. [2025-02-06 04:41:46,894 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 281 transitions, 3898 flow [2025-02-06 04:41:46,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-02-06 04:41:46,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:46,895 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-02-06 04:41:46,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 04:41:47,098 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-02-06 04:41:47,098 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-02-06 04:41:47,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:47,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1836147287, now seen corresponding path program 3 times [2025-02-06 04:41:47,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:47,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100280566] [2025-02-06 04:41:47,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:41:47,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:47,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 2 equivalence classes. [2025-02-06 04:41:47,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:41:47,114 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:41:47,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:48,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:48,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:48,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100280566] [2025-02-06 04:41:48,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100280566] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:41:48,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931406440] [2025-02-06 04:41:48,022 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:41:48,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:41:48,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:41:48,025 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-02-06 04:41:48,026 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-02-06 04:41:48,070 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 2 equivalence classes. [2025-02-06 04:41:48,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:41:48,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:41:48,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:48,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 04:41:48,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:41:48,161 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-02-06 04:41:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:48,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:41:49,532 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-02-06 04:41:49,573 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-02-06 04:41:49,574 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-02-06 04:41:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:50,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931406440] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:41:50,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:41:50,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2025-02-06 04:41:50,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024703791] [2025-02-06 04:41:50,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:41:50,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-06 04:41:50,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:50,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-06 04:41:50,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1211, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 04:41:50,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 04:41:50,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 281 transitions, 3898 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-02-06 04:41:50,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:50,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 04:41:50,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:53,601 INFO L124 PetriNetUnfolderBase]: 6487/11040 cut-off events. [2025-02-06 04:41:53,602 INFO L125 PetriNetUnfolderBase]: For 90845/91291 co-relation queries the response was YES. [2025-02-06 04:41:53,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58625 conditions, 11040 events. 6487/11040 cut-off events. For 90845/91291 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 79233 event pairs, 2583 based on Foata normal form. 66/10939 useless extension candidates. Maximal degree in co-relation 58528. Up to 5069 conditions per place. [2025-02-06 04:41:53,677 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 339 selfloop transitions, 57 changer transitions 17/429 dead transitions. [2025-02-06 04:41:53,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 429 transitions, 5592 flow [2025-02-06 04:41:53,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 04:41:53,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-06 04:41:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 295 transitions. [2025-02-06 04:41:53,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2025-02-06 04:41:53,678 INFO L175 Difference]: Start difference. First operand has 203 places, 281 transitions, 3898 flow. Second operand 18 states and 295 transitions. [2025-02-06 04:41:53,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 429 transitions, 5592 flow [2025-02-06 04:41:53,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 429 transitions, 5075 flow, removed 207 selfloop flow, removed 20 redundant places. [2025-02-06 04:41:53,995 INFO L231 Difference]: Finished difference. Result has 199 places, 289 transitions, 3667 flow [2025-02-06 04:41:53,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3431, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3667, PETRI_PLACES=199, PETRI_TRANSITIONS=289} [2025-02-06 04:41:53,995 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 161 predicate places. [2025-02-06 04:41:53,996 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 289 transitions, 3667 flow [2025-02-06 04:41:53,996 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-02-06 04:41:53,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:53,996 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-02-06 04:41:54,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 04:41:54,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:41:54,200 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:54,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:54,200 INFO L85 PathProgramCache]: Analyzing trace with hash 2068442959, now seen corresponding path program 4 times [2025-02-06 04:41:54,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:54,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846804341] [2025-02-06 04:41:54,200 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:41:54,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:54,205 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-02-06 04:41:54,214 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:41:54,214 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:41:54,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:55,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:55,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:55,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846804341] [2025-02-06 04:41:55,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846804341] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:41:55,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201259347] [2025-02-06 04:41:55,265 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:41:55,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:41:55,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:41:55,268 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:41:55,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 04:41:55,312 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-02-06 04:41:55,340 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:41:55,340 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:41:55,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:55,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 04:41:55,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:41:55,393 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-02-06 04:41:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:55,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:41:56,342 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-02-06 04:41:56,370 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-02-06 04:41:56,371 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-02-06 04:41:56,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:56,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201259347] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:41:56,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:41:56,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2025-02-06 04:41:56,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949345827] [2025-02-06 04:41:56,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:41:56,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-06 04:41:56,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:56,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-06 04:41:56,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1143, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 04:41:56,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 04:41:56,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 289 transitions, 3667 flow. Second operand has 37 states, 37 states have (on average 9.27027027027027) internal successors, (343), 37 states have internal predecessors, (343), 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-02-06 04:41:56,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:56,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 04:41:56,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:00,049 INFO L124 PetriNetUnfolderBase]: 7273/12485 cut-off events. [2025-02-06 04:42:00,049 INFO L125 PetriNetUnfolderBase]: For 75316/75790 co-relation queries the response was YES. [2025-02-06 04:42:00,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60860 conditions, 12485 events. 7273/12485 cut-off events. For 75316/75790 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 90117 event pairs, 1660 based on Foata normal form. 49/12350 useless extension candidates. Maximal degree in co-relation 60766. Up to 2230 conditions per place. [2025-02-06 04:42:00,142 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 436 selfloop transitions, 172 changer transitions 66/690 dead transitions. [2025-02-06 04:42:00,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 690 transitions, 7580 flow [2025-02-06 04:42:00,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-06 04:42:00,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-02-06 04:42:00,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 744 transitions. [2025-02-06 04:42:00,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.462111801242236 [2025-02-06 04:42:00,147 INFO L175 Difference]: Start difference. First operand has 199 places, 289 transitions, 3667 flow. Second operand 46 states and 744 transitions. [2025-02-06 04:42:00,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 690 transitions, 7580 flow [2025-02-06 04:42:00,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 690 transitions, 7487 flow, removed 7 selfloop flow, removed 10 redundant places. [2025-02-06 04:42:00,429 INFO L231 Difference]: Finished difference. Result has 245 places, 314 transitions, 4297 flow [2025-02-06 04:42:00,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3592, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=4297, PETRI_PLACES=245, PETRI_TRANSITIONS=314} [2025-02-06 04:42:00,430 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 207 predicate places. [2025-02-06 04:42:00,430 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 314 transitions, 4297 flow [2025-02-06 04:42:00,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 9.27027027027027) internal successors, (343), 37 states have internal predecessors, (343), 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-02-06 04:42:00,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:00,430 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-02-06 04:42:00,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 04:42:00,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:42:00,634 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:42:00,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:00,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1065766943, now seen corresponding path program 5 times [2025-02-06 04:42:00,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:00,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074517058] [2025-02-06 04:42:00,634 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:42:00,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:00,638 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-02-06 04:42:00,747 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:42:00,747 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:42:00,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:02,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:02,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074517058] [2025-02-06 04:42:02,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074517058] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:42:02,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121036760] [2025-02-06 04:42:02,050 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:42:02,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:42:02,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:42:02,053 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:42:02,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 04:42:02,099 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-02-06 04:42:02,122 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:42:02,122 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:42:02,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:02,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 04:42:02,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:42:02,178 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-02-06 04:42:02,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:02,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:42:03,279 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-02-06 04:42:03,309 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-02-06 04:42:03,309 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-02-06 04:42:03,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:03,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121036760] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:42:03,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:42:03,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2025-02-06 04:42:03,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270289497] [2025-02-06 04:42:03,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:42:03,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-06 04:42:03,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:03,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-06 04:42:03,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 04:42:03,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 04:42:03,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 314 transitions, 4297 flow. Second operand has 36 states, 36 states have (on average 9.333333333333334) internal successors, (336), 36 states have internal predecessors, (336), 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-02-06 04:42:03,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:03,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 04:42:03,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:11,779 INFO L124 PetriNetUnfolderBase]: 7410/12739 cut-off events. [2025-02-06 04:42:11,780 INFO L125 PetriNetUnfolderBase]: For 89138/89630 co-relation queries the response was YES. [2025-02-06 04:42:11,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64698 conditions, 12739 events. 7410/12739 cut-off events. For 89138/89630 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 93228 event pairs, 1710 based on Foata normal form. 73/12626 useless extension candidates. Maximal degree in co-relation 64573. Up to 2252 conditions per place. [2025-02-06 04:42:11,879 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 390 selfloop transitions, 166 changer transitions 34/606 dead transitions. [2025-02-06 04:42:11,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 606 transitions, 7345 flow [2025-02-06 04:42:11,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-06 04:42:11,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-02-06 04:42:11,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 562 transitions. [2025-02-06 04:42:11,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4722689075630252 [2025-02-06 04:42:11,881 INFO L175 Difference]: Start difference. First operand has 245 places, 314 transitions, 4297 flow. Second operand 34 states and 562 transitions. [2025-02-06 04:42:11,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 606 transitions, 7345 flow [2025-02-06 04:42:12,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 606 transitions, 7046 flow, removed 51 selfloop flow, removed 32 redundant places. [2025-02-06 04:42:12,243 INFO L231 Difference]: Finished difference. Result has 246 places, 324 transitions, 4586 flow [2025-02-06 04:42:12,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4052, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=4586, PETRI_PLACES=246, PETRI_TRANSITIONS=324} [2025-02-06 04:42:12,244 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 208 predicate places. [2025-02-06 04:42:12,244 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 324 transitions, 4586 flow [2025-02-06 04:42:12,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 9.333333333333334) internal successors, (336), 36 states have internal predecessors, (336), 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-02-06 04:42:12,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:12,248 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-02-06 04:42:12,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 04:42:12,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:42:12,448 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:42:12,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:12,449 INFO L85 PathProgramCache]: Analyzing trace with hash -645207037, now seen corresponding path program 6 times [2025-02-06 04:42:12,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:12,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138776449] [2025-02-06 04:42:12,449 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:42:12,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:12,453 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 2 equivalence classes. [2025-02-06 04:42:12,464 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:42:12,467 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-02-06 04:42:12,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:13,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:13,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138776449] [2025-02-06 04:42:13,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138776449] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:42:13,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537291620] [2025-02-06 04:42:13,143 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:42:13,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:42:13,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:42:13,145 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:42:13,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 04:42:13,203 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 2 equivalence classes. [2025-02-06 04:42:13,221 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:42:13,221 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-02-06 04:42:13,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:13,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 04:42:13,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:42:13,279 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-02-06 04:42:13,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:13,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:42:14,168 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-02-06 04:42:14,194 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-02-06 04:42:14,194 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 171 treesize of output 142 [2025-02-06 04:42:14,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:14,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537291620] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:42:14,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:42:14,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2025-02-06 04:42:14,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927318335] [2025-02-06 04:42:14,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:42:14,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 04:42:14,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:14,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 04:42:14,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 04:42:14,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 04:42:14,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 324 transitions, 4586 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-02-06 04:42:14,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:14,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 04:42:14,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:19,283 INFO L124 PetriNetUnfolderBase]: 7703/13273 cut-off events. [2025-02-06 04:42:19,284 INFO L125 PetriNetUnfolderBase]: For 98109/98618 co-relation queries the response was YES. [2025-02-06 04:42:19,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67562 conditions, 13273 events. 7703/13273 cut-off events. For 98109/98618 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 97576 event pairs, 2411 based on Foata normal form. 43/13113 useless extension candidates. Maximal degree in co-relation 67446. Up to 2339 conditions per place. [2025-02-06 04:42:19,392 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 441 selfloop transitions, 160 changer transitions 51/668 dead transitions. [2025-02-06 04:42:19,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 668 transitions, 7961 flow [2025-02-06 04:42:19,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-02-06 04:42:19,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-02-06 04:42:19,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 696 transitions. [2025-02-06 04:42:19,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45194805194805193 [2025-02-06 04:42:19,394 INFO L175 Difference]: Start difference. First operand has 246 places, 324 transitions, 4586 flow. Second operand 44 states and 696 transitions. [2025-02-06 04:42:19,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 668 transitions, 7961 flow [2025-02-06 04:42:19,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 668 transitions, 7743 flow, removed 23 selfloop flow, removed 21 redundant places. [2025-02-06 04:42:19,859 INFO L231 Difference]: Finished difference. Result has 271 places, 335 transitions, 4859 flow [2025-02-06 04:42:19,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4400, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=4859, PETRI_PLACES=271, PETRI_TRANSITIONS=335} [2025-02-06 04:42:19,859 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 233 predicate places. [2025-02-06 04:42:19,859 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 335 transitions, 4859 flow [2025-02-06 04:42:19,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-02-06 04:42:19,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:19,860 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-02-06 04:42:19,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 04:42:20,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-06 04:42:20,060 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:42:20,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:20,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2017783473, now seen corresponding path program 7 times [2025-02-06 04:42:20,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:20,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449806614] [2025-02-06 04:42:20,061 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:42:20,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:20,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 04:42:20,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:42:20,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:42:20,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:21,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:21,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:21,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449806614] [2025-02-06 04:42:21,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449806614] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:42:21,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208413647] [2025-02-06 04:42:21,072 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:42:21,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:42:21,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:42:21,075 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:42:21,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 04:42:21,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 04:42:21,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:42:21,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:42:21,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:21,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 04:42:21,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:42:21,225 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-02-06 04:42:21,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:21,595 INFO L312 TraceCheckSpWp]: Computing backward predicates...