./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-send-receive.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-send-receive.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 4eda2bf92bccdcc8638b67653fb7fdefc015ff9c815b317ad1009deb61d04585 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:43:05,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:43:05,417 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:43:05,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:43:05,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:43:05,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:43:05,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:43:05,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:43:05,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:43:05,447 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:43:05,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:43:05,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:43:05,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:43:05,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:43:05,448 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:43:05,448 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:43:05,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:43:05,448 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:43:05,448 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:43:05,448 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:43:05,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:43:05,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:43:05,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:43:05,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:43:05,448 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:43:05,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:43:05,449 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:43:05,449 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:43:05,449 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:43:05,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:43:05,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:43:05,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:43:05,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:43:05,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:43:05,449 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:43:05,449 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:43:05,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:43:05,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:43:05,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:43:05,450 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:43:05,450 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:43:05,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:43:05,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:43:05,451 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 -> 4eda2bf92bccdcc8638b67653fb7fdefc015ff9c815b317ad1009deb61d04585 [2025-02-06 04:43:05,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:43:05,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:43:05,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:43:05,747 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:43:05,747 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:43:05,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2025-02-06 04:43:07,128 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07e89b592/58127704c20e4cb9a08cd89122e05b36/FLAG85273dfc6 [2025-02-06 04:43:07,450 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:43:07,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2025-02-06 04:43:07,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07e89b592/58127704c20e4cb9a08cd89122e05b36/FLAG85273dfc6 [2025-02-06 04:43:07,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07e89b592/58127704c20e4cb9a08cd89122e05b36 [2025-02-06 04:43:07,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:43:07,704 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:43:07,706 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:43:07,706 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:43:07,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:43:07,711 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:43:07" (1/1) ... [2025-02-06 04:43:07,711 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@522b042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:07, skipping insertion in model container [2025-02-06 04:43:07,712 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:43:07" (1/1) ... [2025-02-06 04:43:07,728 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:43:07,897 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-send-receive.wvr.c[3146,3159] [2025-02-06 04:43:07,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:43:07,921 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:43:07,939 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-send-receive.wvr.c[3146,3159] [2025-02-06 04:43:07,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:43:07,956 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:43:07,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:07 WrapperNode [2025-02-06 04:43:07,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:43:07,959 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:43:07,959 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:43:07,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:43:07,966 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:43:07" (1/1) ... [2025-02-06 04:43:07,974 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:43:07" (1/1) ... [2025-02-06 04:43:07,997 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 139 [2025-02-06 04:43:07,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:43:07,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:43:07,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:43:07,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:43:08,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:07" (1/1) ... [2025-02-06 04:43:08,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:07" (1/1) ... [2025-02-06 04:43:08,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:07" (1/1) ... [2025-02-06 04:43:08,034 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-06 04:43:08,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:07" (1/1) ... [2025-02-06 04:43:08,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:07" (1/1) ... [2025-02-06 04:43:08,040 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:07" (1/1) ... [2025-02-06 04:43:08,041 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:07" (1/1) ... [2025-02-06 04:43:08,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:07" (1/1) ... [2025-02-06 04:43:08,042 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:07" (1/1) ... [2025-02-06 04:43:08,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:43:08,045 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:43:08,045 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:43:08,045 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:43:08,046 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:07" (1/1) ... [2025-02-06 04:43:08,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:43:08,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:43:08,079 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:43:08,086 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:43:08,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:43:08,106 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:43:08,106 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:43:08,106 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:43:08,106 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:43:08,106 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 04:43:08,106 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 04:43:08,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:43:08,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:43:08,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:43:08,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:43:08,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:43:08,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:43:08,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 04:43:08,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:43:08,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:43:08,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:43:08,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:43:08,109 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:43:08,226 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:43:08,228 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:43:08,522 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:43:08,523 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:43:08,729 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:43:08,730 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:43:08,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:43:08 BoogieIcfgContainer [2025-02-06 04:43:08,730 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:43:08,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:43:08,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:43:08,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:43:08,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:43:07" (1/3) ... [2025-02-06 04:43:08,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678891f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:43:08, skipping insertion in model container [2025-02-06 04:43:08,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:07" (2/3) ... [2025-02-06 04:43:08,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678891f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:43:08, skipping insertion in model container [2025-02-06 04:43:08,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:43:08" (3/3) ... [2025-02-06 04:43:08,743 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2025-02-06 04:43:08,756 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:43:08,758 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-send-receive.wvr.c that has 4 procedures, 33 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-06 04:43:08,759 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:43:08,818 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 04:43:08,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 93 flow [2025-02-06 04:43:08,888 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2025-02-06 04:43:08,890 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:43:08,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 33 events. 4/33 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 28. Up to 2 conditions per place. [2025-02-06 04:43:08,898 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 36 transitions, 93 flow [2025-02-06 04:43:08,902 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 32 transitions, 82 flow [2025-02-06 04:43:08,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:43:08,924 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;@371f5481, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:43:08,926 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 04:43:08,939 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:43:08,939 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2025-02-06 04:43:08,939 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:43:08,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:08,940 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] [2025-02-06 04:43:08,941 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:43:08,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:08,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2109680172, now seen corresponding path program 1 times [2025-02-06 04:43:08,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:08,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547700694] [2025-02-06 04:43:08,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:08,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:09,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 04:43:09,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 04:43:09,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:09,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:09,691 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:43:09,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:09,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547700694] [2025-02-06 04:43:09,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547700694] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:09,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:09,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:43:09,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85265244] [2025-02-06 04:43:09,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:09,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:43:09,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:09,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:43:09,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:43:09,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-02-06 04:43:09,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:09,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:09,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-02-06 04:43:09,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:10,171 INFO L124 PetriNetUnfolderBase]: 627/1033 cut-off events. [2025-02-06 04:43:10,172 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-02-06 04:43:10,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2027 conditions, 1033 events. 627/1033 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4645 event pairs, 66 based on Foata normal form. 100/1073 useless extension candidates. Maximal degree in co-relation 1956. Up to 350 conditions per place. [2025-02-06 04:43:10,182 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 56 selfloop transitions, 4 changer transitions 5/72 dead transitions. [2025-02-06 04:43:10,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 72 transitions, 304 flow [2025-02-06 04:43:10,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:43:10,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:43:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2025-02-06 04:43:10,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-02-06 04:43:10,200 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 82 flow. Second operand 5 states and 117 transitions. [2025-02-06 04:43:10,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 72 transitions, 304 flow [2025-02-06 04:43:10,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 72 transitions, 284 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 04:43:10,211 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 90 flow [2025-02-06 04:43:10,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-02-06 04:43:10,217 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2025-02-06 04:43:10,218 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 90 flow [2025-02-06 04:43:10,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:10,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:10,219 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:43:10,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:43:10,220 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:43:10,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:10,221 INFO L85 PathProgramCache]: Analyzing trace with hash 797378811, now seen corresponding path program 1 times [2025-02-06 04:43:10,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:10,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807575592] [2025-02-06 04:43:10,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:10,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:10,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:43:10,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:43:10,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:10,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:10,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:43:10,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:10,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807575592] [2025-02-06 04:43:10,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807575592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:10,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:10,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:43:10,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011967329] [2025-02-06 04:43:10,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:10,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:43:10,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:10,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:43:10,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:43:10,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-02-06 04:43:10,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:43:10,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:10,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-02-06 04:43:10,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:10,470 INFO L124 PetriNetUnfolderBase]: 329/567 cut-off events. [2025-02-06 04:43:10,470 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-02-06 04:43:10,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 567 events. 329/567 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2082 event pairs, 140 based on Foata normal form. 21/527 useless extension candidates. Maximal degree in co-relation 480. Up to 407 conditions per place. [2025-02-06 04:43:10,475 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 30 selfloop transitions, 3 changer transitions 1/41 dead transitions. [2025-02-06 04:43:10,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 178 flow [2025-02-06 04:43:10,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:43:10,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:43:10,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-02-06 04:43:10,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2025-02-06 04:43:10,479 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 90 flow. Second operand 3 states and 64 transitions. [2025-02-06 04:43:10,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 178 flow [2025-02-06 04:43:10,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 173 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:43:10,481 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 105 flow [2025-02-06 04:43:10,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2025-02-06 04:43:10,483 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2025-02-06 04:43:10,483 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 105 flow [2025-02-06 04:43:10,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:43:10,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:10,483 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:43:10,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:43:10,484 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:43:10,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:10,485 INFO L85 PathProgramCache]: Analyzing trace with hash -443279971, now seen corresponding path program 1 times [2025-02-06 04:43:10,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:10,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469005364] [2025-02-06 04:43:10,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:10,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:10,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 04:43:10,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:43:10,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:10,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:10,633 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:43:10,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:10,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469005364] [2025-02-06 04:43:10,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469005364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:10,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:10,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:43:10,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659327382] [2025-02-06 04:43:10,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:10,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:43:10,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:10,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:43:10,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:43:10,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-02-06 04:43:10,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:43:10,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:10,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-02-06 04:43:10,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:10,818 INFO L124 PetriNetUnfolderBase]: 364/634 cut-off events. [2025-02-06 04:43:10,819 INFO L125 PetriNetUnfolderBase]: For 283/283 co-relation queries the response was YES. [2025-02-06 04:43:10,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1528 conditions, 634 events. 364/634 cut-off events. For 283/283 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2428 event pairs, 263 based on Foata normal form. 0/572 useless extension candidates. Maximal degree in co-relation 705. Up to 499 conditions per place. [2025-02-06 04:43:10,825 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 27 selfloop transitions, 2 changer transitions 11/47 dead transitions. [2025-02-06 04:43:10,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 214 flow [2025-02-06 04:43:10,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:43:10,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:43:10,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-02-06 04:43:10,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-02-06 04:43:10,828 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 105 flow. Second operand 4 states and 78 transitions. [2025-02-06 04:43:10,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 214 flow [2025-02-06 04:43:10,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:43:10,830 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 116 flow [2025-02-06 04:43:10,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2025-02-06 04:43:10,830 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2025-02-06 04:43:10,832 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 116 flow [2025-02-06 04:43:10,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:43:10,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:10,833 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:43:10,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:43:10,834 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:43:10,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:10,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1515313704, now seen corresponding path program 1 times [2025-02-06 04:43:10,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:10,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426429087] [2025-02-06 04:43:10,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:10,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:10,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:43:10,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:43:10,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:10,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:11,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:43:11,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:11,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426429087] [2025-02-06 04:43:11,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426429087] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:11,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:11,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:43:11,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010462452] [2025-02-06 04:43:11,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:11,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:43:11,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:11,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:43:11,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:43:11,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-02-06 04:43:11,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:43:11,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:11,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-02-06 04:43:11,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:11,183 INFO L124 PetriNetUnfolderBase]: 287/492 cut-off events. [2025-02-06 04:43:11,184 INFO L125 PetriNetUnfolderBase]: For 252/252 co-relation queries the response was YES. [2025-02-06 04:43:11,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214 conditions, 492 events. 287/492 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1681 event pairs, 54 based on Foata normal form. 24/499 useless extension candidates. Maximal degree in co-relation 1198. Up to 200 conditions per place. [2025-02-06 04:43:11,188 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 37 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2025-02-06 04:43:11,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 47 transitions, 229 flow [2025-02-06 04:43:11,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:43:11,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:43:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-02-06 04:43:11,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2025-02-06 04:43:11,191 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 116 flow. Second operand 4 states and 77 transitions. [2025-02-06 04:43:11,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 47 transitions, 229 flow [2025-02-06 04:43:11,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 221 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-06 04:43:11,194 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 120 flow [2025-02-06 04:43:11,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2025-02-06 04:43:11,196 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2025-02-06 04:43:11,196 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 120 flow [2025-02-06 04:43:11,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:43:11,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:11,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:43:11,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:43:11,197 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:43:11,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:11,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1332999088, now seen corresponding path program 2 times [2025-02-06 04:43:11,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:11,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055729766] [2025-02-06 04:43:11,199 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:43:11,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:11,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-06 04:43:11,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-06 04:43:11,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:43:11,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:11,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:43:11,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:11,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055729766] [2025-02-06 04:43:11,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055729766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:11,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:11,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:43:11,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200815810] [2025-02-06 04:43:11,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:11,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:43:11,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:11,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:43:11,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:43:11,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-02-06 04:43:11,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:43:11,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:11,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-02-06 04:43:11,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:11,513 INFO L124 PetriNetUnfolderBase]: 359/615 cut-off events. [2025-02-06 04:43:11,514 INFO L125 PetriNetUnfolderBase]: For 346/346 co-relation queries the response was YES. [2025-02-06 04:43:11,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1488 conditions, 615 events. 359/615 cut-off events. For 346/346 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2221 event pairs, 22 based on Foata normal form. 16/619 useless extension candidates. Maximal degree in co-relation 1467. Up to 199 conditions per place. [2025-02-06 04:43:11,518 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 54 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2025-02-06 04:43:11,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 65 transitions, 321 flow [2025-02-06 04:43:11,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:43:11,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:43:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-02-06 04:43:11,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5722222222222222 [2025-02-06 04:43:11,519 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 120 flow. Second operand 5 states and 103 transitions. [2025-02-06 04:43:11,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 65 transitions, 321 flow [2025-02-06 04:43:11,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 65 transitions, 313 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 04:43:11,522 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 130 flow [2025-02-06 04:43:11,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2025-02-06 04:43:11,522 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2025-02-06 04:43:11,523 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 130 flow [2025-02-06 04:43:11,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:43:11,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:11,523 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:43:11,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:43:11,523 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:43:11,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:11,523 INFO L85 PathProgramCache]: Analyzing trace with hash 960355754, now seen corresponding path program 3 times [2025-02-06 04:43:11,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:11,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164999028] [2025-02-06 04:43:11,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:43:11,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:11,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-06 04:43:11,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:43:11,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:43:11,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:43:11,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:11,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164999028] [2025-02-06 04:43:11,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164999028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:11,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:11,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:43:11,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131894953] [2025-02-06 04:43:11,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:11,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:43:11,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:11,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:43:11,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:43:11,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2025-02-06 04:43:11,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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:43:11,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:11,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2025-02-06 04:43:11,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:12,168 INFO L124 PetriNetUnfolderBase]: 1346/2136 cut-off events. [2025-02-06 04:43:12,169 INFO L125 PetriNetUnfolderBase]: For 1045/1045 co-relation queries the response was YES. [2025-02-06 04:43:12,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5349 conditions, 2136 events. 1346/2136 cut-off events. For 1045/1045 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9969 event pairs, 217 based on Foata normal form. 30/2107 useless extension candidates. Maximal degree in co-relation 5327. Up to 728 conditions per place. [2025-02-06 04:43:12,183 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 82 selfloop transitions, 12 changer transitions 0/100 dead transitions. [2025-02-06 04:43:12,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 100 transitions, 540 flow [2025-02-06 04:43:12,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:43:12,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:43:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2025-02-06 04:43:12,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6342592592592593 [2025-02-06 04:43:12,186 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 130 flow. Second operand 6 states and 137 transitions. [2025-02-06 04:43:12,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 100 transitions, 540 flow [2025-02-06 04:43:12,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 100 transitions, 528 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 04:43:12,193 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 223 flow [2025-02-06 04:43:12,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2025-02-06 04:43:12,195 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2025-02-06 04:43:12,196 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 223 flow [2025-02-06 04:43:12,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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:43:12,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:12,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:43:12,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:43:12,196 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:43:12,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:12,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1071676766, now seen corresponding path program 4 times [2025-02-06 04:43:12,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:12,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544661707] [2025-02-06 04:43:12,198 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:43:12,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:12,206 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-06 04:43:12,219 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:43:12,221 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:43:12,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:12,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:43:12,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:12,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544661707] [2025-02-06 04:43:12,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544661707] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:43:12,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205667307] [2025-02-06 04:43:12,412 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:43:12,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:43:12,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:43:12,415 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:43:12,418 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:43:12,477 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-06 04:43:12,505 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:43:12,505 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:43:12,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:12,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 04:43:12,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:43:12,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:43:12,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:43:12,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:43:12,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205667307] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:43:12,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:43:12,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2025-02-06 04:43:12,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175553281] [2025-02-06 04:43:12,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:43:12,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:43:12,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:12,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:43:12,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:43:12,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-02-06 04:43:12,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 223 flow. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 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:43:12,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:12,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-02-06 04:43:12,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:13,682 INFO L124 PetriNetUnfolderBase]: 3035/4514 cut-off events. [2025-02-06 04:43:13,683 INFO L125 PetriNetUnfolderBase]: For 4718/4718 co-relation queries the response was YES. [2025-02-06 04:43:13,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13208 conditions, 4514 events. 3035/4514 cut-off events. For 4718/4718 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 21493 event pairs, 76 based on Foata normal form. 206/4527 useless extension candidates. Maximal degree in co-relation 13183. Up to 848 conditions per place. [2025-02-06 04:43:13,710 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 134 selfloop transitions, 40 changer transitions 49/226 dead transitions. [2025-02-06 04:43:13,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 226 transitions, 1359 flow [2025-02-06 04:43:13,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 04:43:13,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-06 04:43:13,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 330 transitions. [2025-02-06 04:43:13,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-02-06 04:43:13,713 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 223 flow. Second operand 22 states and 330 transitions. [2025-02-06 04:43:13,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 226 transitions, 1359 flow [2025-02-06 04:43:13,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 226 transitions, 1359 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:43:13,728 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 554 flow [2025-02-06 04:43:13,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=554, PETRI_PLACES=88, PETRI_TRANSITIONS=76} [2025-02-06 04:43:13,729 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 50 predicate places. [2025-02-06 04:43:13,729 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 554 flow [2025-02-06 04:43:13,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 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:43:13,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:13,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:43:13,738 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:43:13,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:43:13,934 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:43:13,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:13,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2005864276, now seen corresponding path program 5 times [2025-02-06 04:43:13,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:13,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124903079] [2025-02-06 04:43:13,935 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:43:13,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:13,949 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-06 04:43:13,971 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:43:13,976 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:43:13,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:14,943 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:43:14,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:14,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124903079] [2025-02-06 04:43:14,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124903079] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:43:14,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731257535] [2025-02-06 04:43:14,944 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:43:14,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:43:14,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:43:14,946 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:43:14,949 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:43:15,000 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-06 04:43:15,029 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:43:15,029 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:43:15,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:15,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 04:43:15,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:43:15,090 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:43:15,461 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:43:15,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:43:16,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2025-02-06 04:43:16,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:43:16,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 68 [2025-02-06 04:43:16,397 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:43:16,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731257535] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:43:16,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:43:16,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 28 [2025-02-06 04:43:16,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997727787] [2025-02-06 04:43:16,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:43:16,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-06 04:43:16,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:16,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 04:43:16,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2025-02-06 04:43:16,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-02-06 04:43:16,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 76 transitions, 554 flow. Second operand has 29 states, 29 states have (on average 8.413793103448276) internal successors, (244), 29 states have internal predecessors, (244), 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:43:16,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:16,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-02-06 04:43:16,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:20,538 INFO L124 PetriNetUnfolderBase]: 9717/14860 cut-off events. [2025-02-06 04:43:20,539 INFO L125 PetriNetUnfolderBase]: For 74038/74038 co-relation queries the response was YES. [2025-02-06 04:43:20,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60512 conditions, 14860 events. 9717/14860 cut-off events. For 74038/74038 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 89979 event pairs, 1026 based on Foata normal form. 744/15600 useless extension candidates. Maximal degree in co-relation 53980. Up to 2581 conditions per place. [2025-02-06 04:43:20,631 INFO L140 encePairwiseOnDemand]: 22/36 looper letters, 362 selfloop transitions, 129 changer transitions 169/663 dead transitions. [2025-02-06 04:43:20,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 663 transitions, 6017 flow [2025-02-06 04:43:20,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-06 04:43:20,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-02-06 04:43:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 695 transitions. [2025-02-06 04:43:20,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4196859903381642 [2025-02-06 04:43:20,636 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 554 flow. Second operand 46 states and 695 transitions. [2025-02-06 04:43:20,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 663 transitions, 6017 flow [2025-02-06 04:43:20,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 663 transitions, 5925 flow, removed 38 selfloop flow, removed 1 redundant places. [2025-02-06 04:43:20,802 INFO L231 Difference]: Finished difference. Result has 156 places, 195 transitions, 1835 flow [2025-02-06 04:43:20,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=1835, PETRI_PLACES=156, PETRI_TRANSITIONS=195} [2025-02-06 04:43:20,805 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 118 predicate places. [2025-02-06 04:43:20,805 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 195 transitions, 1835 flow [2025-02-06 04:43:20,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.413793103448276) internal successors, (244), 29 states have internal predecessors, (244), 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:43:20,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:20,806 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:43:20,814 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:43:21,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:43:21,007 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:43:21,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:21,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1214832595, now seen corresponding path program 6 times [2025-02-06 04:43:21,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:21,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562463784] [2025-02-06 04:43:21,008 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:43:21,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:21,072 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 3 equivalence classes. [2025-02-06 04:43:21,092 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 33 statements. [2025-02-06 04:43:21,092 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:43:21,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:21,311 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 04:43:21,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:21,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562463784] [2025-02-06 04:43:21,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562463784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:21,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:21,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:43:21,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119909110] [2025-02-06 04:43:21,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:21,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:43:21,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:21,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:43:21,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:43:21,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-02-06 04:43:21,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 195 transitions, 1835 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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:43:21,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:21,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-02-06 04:43:21,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:22,495 INFO L124 PetriNetUnfolderBase]: 4949/8529 cut-off events. [2025-02-06 04:43:22,495 INFO L125 PetriNetUnfolderBase]: For 115455/115619 co-relation queries the response was YES. [2025-02-06 04:43:22,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44965 conditions, 8529 events. 4949/8529 cut-off events. For 115455/115619 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 57501 event pairs, 750 based on Foata normal form. 240/8497 useless extension candidates. Maximal degree in co-relation 39951. Up to 2578 conditions per place. [2025-02-06 04:43:22,596 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 158 selfloop transitions, 57 changer transitions 49/297 dead transitions. [2025-02-06 04:43:22,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 297 transitions, 3323 flow [2025-02-06 04:43:22,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:43:22,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:43:22,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2025-02-06 04:43:22,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5486111111111112 [2025-02-06 04:43:22,598 INFO L175 Difference]: Start difference. First operand has 156 places, 195 transitions, 1835 flow. Second operand 8 states and 158 transitions. [2025-02-06 04:43:22,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 297 transitions, 3323 flow [2025-02-06 04:43:22,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 297 transitions, 3026 flow, removed 82 selfloop flow, removed 9 redundant places. [2025-02-06 04:43:22,849 INFO L231 Difference]: Finished difference. Result has 156 places, 202 transitions, 1830 flow [2025-02-06 04:43:22,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1602, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1830, PETRI_PLACES=156, PETRI_TRANSITIONS=202} [2025-02-06 04:43:22,851 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 118 predicate places. [2025-02-06 04:43:22,851 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 202 transitions, 1830 flow [2025-02-06 04:43:22,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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:43:22,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:22,851 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:43:22,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:43:22,851 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:43:22,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:22,852 INFO L85 PathProgramCache]: Analyzing trace with hash 96506626, now seen corresponding path program 7 times [2025-02-06 04:43:22,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:22,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791939045] [2025-02-06 04:43:22,852 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:43:22,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:22,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 04:43:22,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 04:43:22,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:22,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:22,958 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:43:22,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:22,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791939045] [2025-02-06 04:43:22,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791939045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:22,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:22,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:43:22,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032996705] [2025-02-06 04:43:22,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:22,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:43:22,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:22,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:43:22,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:43:22,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-02-06 04:43:22,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 202 transitions, 1830 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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:43:22,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:22,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-02-06 04:43:22,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:24,667 INFO L124 PetriNetUnfolderBase]: 8181/14394 cut-off events. [2025-02-06 04:43:24,668 INFO L125 PetriNetUnfolderBase]: For 158735/159087 co-relation queries the response was YES. [2025-02-06 04:43:24,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75186 conditions, 14394 events. 8181/14394 cut-off events. For 158735/159087 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 105226 event pairs, 2336 based on Foata normal form. 368/14387 useless extension candidates. Maximal degree in co-relation 64841. Up to 6094 conditions per place. [2025-02-06 04:43:24,857 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 248 selfloop transitions, 47 changer transitions 1/329 dead transitions. [2025-02-06 04:43:24,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 329 transitions, 3650 flow [2025-02-06 04:43:24,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:43:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:43:24,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-02-06 04:43:24,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-02-06 04:43:24,859 INFO L175 Difference]: Start difference. First operand has 156 places, 202 transitions, 1830 flow. Second operand 4 states and 99 transitions. [2025-02-06 04:43:24,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 329 transitions, 3650 flow [2025-02-06 04:43:25,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 329 transitions, 3565 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-02-06 04:43:25,180 INFO L231 Difference]: Finished difference. Result has 158 places, 237 transitions, 2273 flow [2025-02-06 04:43:25,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1740, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2273, PETRI_PLACES=158, PETRI_TRANSITIONS=237} [2025-02-06 04:43:25,181 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 120 predicate places. [2025-02-06 04:43:25,181 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 237 transitions, 2273 flow [2025-02-06 04:43:25,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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:43:25,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:25,181 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:43:25,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:43:25,181 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:43:25,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:25,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1781294334, now seen corresponding path program 8 times [2025-02-06 04:43:25,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:25,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811922320] [2025-02-06 04:43:25,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:43:25,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:25,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-06 04:43:25,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 04:43:25,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:43:25,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:43:25,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:25,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811922320] [2025-02-06 04:43:25,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811922320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:25,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:25,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:43:25,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545975712] [2025-02-06 04:43:25,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:25,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:43:25,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:25,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:43:25,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:43:25,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-02-06 04:43:25,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 237 transitions, 2273 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 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:43:25,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:25,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-02-06 04:43:25,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:27,696 INFO L124 PetriNetUnfolderBase]: 11624/19275 cut-off events. [2025-02-06 04:43:27,696 INFO L125 PetriNetUnfolderBase]: For 216454/216538 co-relation queries the response was YES. [2025-02-06 04:43:27,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105496 conditions, 19275 events. 11624/19275 cut-off events. For 216454/216538 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 130831 event pairs, 3076 based on Foata normal form. 1200/20312 useless extension candidates. Maximal degree in co-relation 92442. Up to 9635 conditions per place. [2025-02-06 04:43:28,018 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 219 selfloop transitions, 14 changer transitions 3/242 dead transitions. [2025-02-06 04:43:28,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 242 transitions, 2861 flow [2025-02-06 04:43:28,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:43:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:43:28,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-02-06 04:43:28,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-02-06 04:43:28,020 INFO L175 Difference]: Start difference. First operand has 158 places, 237 transitions, 2273 flow. Second operand 4 states and 78 transitions. [2025-02-06 04:43:28,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 242 transitions, 2861 flow [2025-02-06 04:43:28,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 242 transitions, 2799 flow, removed 29 selfloop flow, removed 6 redundant places. [2025-02-06 04:43:28,306 INFO L231 Difference]: Finished difference. Result has 149 places, 185 transitions, 1834 flow [2025-02-06 04:43:28,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1771, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1834, PETRI_PLACES=149, PETRI_TRANSITIONS=185} [2025-02-06 04:43:28,306 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 111 predicate places. [2025-02-06 04:43:28,306 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 185 transitions, 1834 flow [2025-02-06 04:43:28,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 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:43:28,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:28,307 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:43:28,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:43:28,307 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:43:28,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:28,307 INFO L85 PathProgramCache]: Analyzing trace with hash 308169016, now seen corresponding path program 1 times [2025-02-06 04:43:28,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:28,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453024268] [2025-02-06 04:43:28,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:28,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:28,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 04:43:28,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 04:43:28,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:28,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:29,982 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:43:29,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:29,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453024268] [2025-02-06 04:43:29,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453024268] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:43:29,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934659279] [2025-02-06 04:43:29,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:29,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:43:29,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:43:29,985 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:43:29,987 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:43:30,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 04:43:30,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 04:43:30,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:30,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:30,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 04:43:30,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:43:30,689 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2025-02-06 04:43:30,689 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 47 treesize of output 20 [2025-02-06 04:43:30,766 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:43:30,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:43:31,183 INFO L349 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2025-02-06 04:43:31,183 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 74 treesize of output 52 [2025-02-06 04:43:31,752 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:43:31,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934659279] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:43:31,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:43:31,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2025-02-06 04:43:31,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277924678] [2025-02-06 04:43:31,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:43:31,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-06 04:43:31,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:31,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-06 04:43:31,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1174, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 04:43:31,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-02-06 04:43:31,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 185 transitions, 1834 flow. Second operand has 37 states, 37 states have (on average 9.64864864864865) internal successors, (357), 37 states have internal predecessors, (357), 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:43:31,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:31,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-02-06 04:43:31,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:58,496 INFO L124 PetriNetUnfolderBase]: 72279/118192 cut-off events. [2025-02-06 04:43:58,497 INFO L125 PetriNetUnfolderBase]: For 1325375/1325915 co-relation queries the response was YES. [2025-02-06 04:43:59,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612979 conditions, 118192 events. 72279/118192 cut-off events. For 1325375/1325915 co-relation queries the response was YES. Maximal size of possible extension queue 2179. Compared 987190 event pairs, 7069 based on Foata normal form. 6278/123693 useless extension candidates. Maximal degree in co-relation 587909. Up to 17796 conditions per place. [2025-02-06 04:43:59,817 INFO L140 encePairwiseOnDemand]: 20/36 looper letters, 1723 selfloop transitions, 843 changer transitions 744/3316 dead transitions. [2025-02-06 04:43:59,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 3316 transitions, 36655 flow [2025-02-06 04:43:59,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2025-02-06 04:43:59,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2025-02-06 04:43:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 2944 transitions. [2025-02-06 04:43:59,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46464646464646464 [2025-02-06 04:43:59,826 INFO L175 Difference]: Start difference. First operand has 149 places, 185 transitions, 1834 flow. Second operand 176 states and 2944 transitions. [2025-02-06 04:43:59,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 3316 transitions, 36655 flow [2025-02-06 04:44:01,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 3316 transitions, 36245 flow, removed 202 selfloop flow, removed 1 redundant places. [2025-02-06 04:44:01,879 INFO L231 Difference]: Finished difference. Result has 387 places, 1057 transitions, 13271 flow [2025-02-06 04:44:01,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=176, PETRI_FLOW=13271, PETRI_PLACES=387, PETRI_TRANSITIONS=1057} [2025-02-06 04:44:01,880 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 349 predicate places. [2025-02-06 04:44:01,881 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 1057 transitions, 13271 flow [2025-02-06 04:44:01,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 9.64864864864865) internal successors, (357), 37 states have internal predecessors, (357), 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:44:01,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:44:01,881 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:44:01,889 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:44:02,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:44:02,082 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:44:02,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:44:02,082 INFO L85 PathProgramCache]: Analyzing trace with hash 584951108, now seen corresponding path program 2 times [2025-02-06 04:44:02,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:44:02,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263563288] [2025-02-06 04:44:02,083 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:44:02,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:44:02,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-06 04:44:02,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 04:44:02,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:44:02,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:44:03,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:44:03,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263563288] [2025-02-06 04:44:03,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263563288] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:44:03,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596558473] [2025-02-06 04:44:03,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:44:03,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:44:03,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:44:03,020 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:44:03,022 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:44:03,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-06 04:44:03,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 04:44:03,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:44:03,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:03,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-06 04:44:03,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:44:03,186 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:44:03,621 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-02-06 04:44:03,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 17 [2025-02-06 04:44:03,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:44:03,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:44:04,955 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 116 treesize of output 104 [2025-02-06 04:44:04,989 INFO L349 Elim1Store]: treesize reduction 13, result has 71.1 percent of original size [2025-02-06 04:44:04,989 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 232 treesize of output 199 [2025-02-06 04:44:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:44:06,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596558473] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:44:06,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:44:06,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 37 [2025-02-06 04:44:06,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438943337] [2025-02-06 04:44:06,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:44:06,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-06 04:44:06,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:06,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-06 04:44:06,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1211, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 04:44:06,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-02-06 04:44:06,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 1057 transitions, 13271 flow. Second operand has 38 states, 38 states have (on average 8.578947368421053) internal successors, (326), 38 states have internal predecessors, (326), 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:44:06,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:06,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-02-06 04:44:06,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand