./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/parallel-min-max-1.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 bf26be9bd61f36f1b6136fc4e500a91a95d08528025fd00027577283116c4a35 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:14:48,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:14:48,735 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:14:48,739 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:14:48,739 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:14:48,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:14:48,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:14:48,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:14:48,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:14:48,760 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:14:48,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:14:48,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:14:48,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:14:48,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:14:48,761 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:14:48,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:14:48,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:14:48,761 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:14:48,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:14:48,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:14:48,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:14:48,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:14:48,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:14:48,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:14:48,762 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:14:48,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:14:48,762 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:14:48,762 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:14:48,762 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:14:48,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:14:48,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:14:48,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:14:48,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:14:48,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:14:48,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:14:48,763 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:14:48,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:14:48,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:14:48,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:14:48,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:14:48,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:14:48,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:14:48,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:14:48,764 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 -> bf26be9bd61f36f1b6136fc4e500a91a95d08528025fd00027577283116c4a35 [2025-02-08 01:14:49,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:14:49,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:14:49,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:14:49,015 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:14:49,015 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:14:49,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c [2025-02-08 01:14:50,117 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/947a81aca/e0bd3ad8b3ab441c9467863bd9c76d86/FLAGebadd9f94 [2025-02-08 01:14:50,330 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:14:50,331 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c [2025-02-08 01:14:50,337 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/947a81aca/e0bd3ad8b3ab441c9467863bd9c76d86/FLAGebadd9f94 [2025-02-08 01:14:50,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/947a81aca/e0bd3ad8b3ab441c9467863bd9c76d86 [2025-02-08 01:14:50,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:14:50,685 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:14:50,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:14:50,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:14:50,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:14:50,689 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:14:50" (1/1) ... [2025-02-08 01:14:50,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@178c604e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:50, skipping insertion in model container [2025-02-08 01:14:50,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:14:50" (1/1) ... [2025-02-08 01:14:50,705 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:14:50,837 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/parallel-min-max-1.wvr.c[2642,2655] [2025-02-08 01:14:50,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:14:50,856 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:14:50,879 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/parallel-min-max-1.wvr.c[2642,2655] [2025-02-08 01:14:50,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:14:50,897 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:14:50,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:50 WrapperNode [2025-02-08 01:14:50,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:14:50,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:14:50,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:14:50,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:14:50,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:50" (1/1) ... [2025-02-08 01:14:50,910 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:50" (1/1) ... [2025-02-08 01:14:50,928 INFO L138 Inliner]: procedures = 22, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2025-02-08 01:14:50,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:14:50,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:14:50,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:14:50,931 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:14:50,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:50" (1/1) ... [2025-02-08 01:14:50,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:50" (1/1) ... [2025-02-08 01:14:50,939 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:50" (1/1) ... [2025-02-08 01:14:50,958 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 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-08 01:14:50,958 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:50" (1/1) ... [2025-02-08 01:14:50,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:50" (1/1) ... [2025-02-08 01:14:50,966 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:50" (1/1) ... [2025-02-08 01:14:50,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:50" (1/1) ... [2025-02-08 01:14:50,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:50" (1/1) ... [2025-02-08 01:14:50,972 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:50" (1/1) ... [2025-02-08 01:14:50,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:14:50,975 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:14:50,978 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:14:50,979 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:14:50,979 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:50" (1/1) ... [2025-02-08 01:14:50,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:14:50,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:14:51,005 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-08 01:14:51,010 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-08 01:14:51,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:14:51,027 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:14:51,027 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:14:51,027 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:14:51,027 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:14:51,027 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 01:14:51,027 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 01:14:51,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:14:51,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:14:51,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:14:51,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:14:51,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:14:51,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:14:51,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:14:51,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:14:51,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:14:51,029 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:14:51,103 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:14:51,105 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:14:51,357 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:14:51,358 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:14:51,498 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:14:51,498 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:14:51,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:14:51 BoogieIcfgContainer [2025-02-08 01:14:51,498 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:14:51,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:14:51,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:14:51,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:14:51,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:14:50" (1/3) ... [2025-02-08 01:14:51,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6565fea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:14:51, skipping insertion in model container [2025-02-08 01:14:51,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:50" (2/3) ... [2025-02-08 01:14:51,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6565fea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:14:51, skipping insertion in model container [2025-02-08 01:14:51,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:14:51" (3/3) ... [2025-02-08 01:14:51,507 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2025-02-08 01:14:51,516 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:14:51,517 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-min-max-1.wvr.c that has 4 procedures, 51 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-08 01:14:51,517 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:14:51,568 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 01:14:51,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 55 transitions, 131 flow [2025-02-08 01:14:51,624 INFO L124 PetriNetUnfolderBase]: 5/52 cut-off events. [2025-02-08 01:14:51,628 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:14:51,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 52 events. 5/52 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 74 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-02-08 01:14:51,631 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 55 transitions, 131 flow [2025-02-08 01:14:51,633 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 51 transitions, 120 flow [2025-02-08 01:14:51,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:14:51,650 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;@5048dee2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:14:51,650 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 01:14:51,671 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:14:51,671 INFO L124 PetriNetUnfolderBase]: 5/50 cut-off events. [2025-02-08 01:14:51,671 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:14:51,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:51,672 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:51,673 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:14:51,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:51,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1755231169, now seen corresponding path program 1 times [2025-02-08 01:14:51,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:51,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039160934] [2025-02-08 01:14:51,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:14:51,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:51,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 01:14:51,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 01:14:51,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:14:51,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:52,015 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-08 01:14:52,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:52,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039160934] [2025-02-08 01:14:52,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039160934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:52,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:52,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:14:52,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991936687] [2025-02-08 01:14:52,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:52,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:14:52,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:52,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:14:52,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:14:52,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-02-08 01:14:52,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:52,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:52,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-02-08 01:14:52,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:52,453 INFO L124 PetriNetUnfolderBase]: 2431/3483 cut-off events. [2025-02-08 01:14:52,453 INFO L125 PetriNetUnfolderBase]: For 217/217 co-relation queries the response was YES. [2025-02-08 01:14:52,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7223 conditions, 3483 events. 2431/3483 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 16001 event pairs, 1290 based on Foata normal form. 0/2908 useless extension candidates. Maximal degree in co-relation 6906. Up to 2363 conditions per place. [2025-02-08 01:14:52,482 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 63 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2025-02-08 01:14:52,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 71 transitions, 298 flow [2025-02-08 01:14:52,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:14:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:14:52,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-02-08 01:14:52,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-02-08 01:14:52,494 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 120 flow. Second operand 4 states and 99 transitions. [2025-02-08 01:14:52,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 71 transitions, 298 flow [2025-02-08 01:14:52,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 282 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 01:14:52,503 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 122 flow [2025-02-08 01:14:52,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2025-02-08 01:14:52,509 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2025-02-08 01:14:52,509 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 122 flow [2025-02-08 01:14:52,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:52,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:52,510 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:52,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:14:52,510 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-08 01:14:52,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:52,511 INFO L85 PathProgramCache]: Analyzing trace with hash -502169735, now seen corresponding path program 1 times [2025-02-08 01:14:52,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:52,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926047474] [2025-02-08 01:14:52,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:14:52,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:52,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 01:14:52,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 01:14:52,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:14:52,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:52,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:14:52,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:52,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926047474] [2025-02-08 01:14:52,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926047474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:52,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:52,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:14:52,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681871004] [2025-02-08 01:14:52,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:52,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:14:52,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:52,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:14:52,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:14:52,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-02-08 01:14:52,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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-08 01:14:52,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:52,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-02-08 01:14:52,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:52,973 INFO L124 PetriNetUnfolderBase]: 3152/4521 cut-off events. [2025-02-08 01:14:52,974 INFO L125 PetriNetUnfolderBase]: For 192/285 co-relation queries the response was YES. [2025-02-08 01:14:52,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9613 conditions, 4521 events. 3152/4521 cut-off events. For 192/285 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 21309 event pairs, 1744 based on Foata normal form. 93/4075 useless extension candidates. Maximal degree in co-relation 2816. Up to 3097 conditions per place. [2025-02-08 01:14:52,992 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 66 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2025-02-08 01:14:52,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 313 flow [2025-02-08 01:14:52,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:14:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:14:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-02-08 01:14:52,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-02-08 01:14:52,995 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 122 flow. Second operand 4 states and 100 transitions. [2025-02-08 01:14:52,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 313 flow [2025-02-08 01:14:52,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:14:52,997 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 132 flow [2025-02-08 01:14:52,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2025-02-08 01:14:52,997 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places. [2025-02-08 01:14:52,997 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 132 flow [2025-02-08 01:14:52,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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-08 01:14:52,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:52,998 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:52,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:14:52,998 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-08 01:14:52,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:52,999 INFO L85 PathProgramCache]: Analyzing trace with hash 597111448, now seen corresponding path program 1 times [2025-02-08 01:14:52,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:52,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391678848] [2025-02-08 01:14:52,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:14:52,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:53,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 01:14:53,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 01:14:53,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:14:53,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:14:53,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:53,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391678848] [2025-02-08 01:14:53,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391678848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:53,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:53,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:14:53,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108832836] [2025-02-08 01:14:53,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:53,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:14:53,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:53,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:14:53,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:14:53,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 55 [2025-02-08 01:14:53,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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-08 01:14:53,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:53,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 55 [2025-02-08 01:14:53,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:53,383 INFO L124 PetriNetUnfolderBase]: 2930/4214 cut-off events. [2025-02-08 01:14:53,384 INFO L125 PetriNetUnfolderBase]: For 203/380 co-relation queries the response was YES. [2025-02-08 01:14:53,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9241 conditions, 4214 events. 2930/4214 cut-off events. For 203/380 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19379 event pairs, 2338 based on Foata normal form. 177/3957 useless extension candidates. Maximal degree in co-relation 2769. Up to 4155 conditions per place. [2025-02-08 01:14:53,402 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 45 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2025-02-08 01:14:53,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 54 transitions, 230 flow [2025-02-08 01:14:53,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:14:53,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:14:53,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-02-08 01:14:53,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37727272727272726 [2025-02-08 01:14:53,406 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 132 flow. Second operand 4 states and 83 transitions. [2025-02-08 01:14:53,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 54 transitions, 230 flow [2025-02-08 01:14:53,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 54 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:14:53,408 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 142 flow [2025-02-08 01:14:53,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2025-02-08 01:14:53,409 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2025-02-08 01:14:53,409 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 142 flow [2025-02-08 01:14:53,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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-08 01:14:53,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:53,409 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:53,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:14:53,410 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-08 01:14:53,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:53,410 INFO L85 PathProgramCache]: Analyzing trace with hash -761456580, now seen corresponding path program 1 times [2025-02-08 01:14:53,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:53,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119990509] [2025-02-08 01:14:53,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:14:53,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:53,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 01:14:53,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 01:14:53,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:14:53,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:53,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:14:53,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:53,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119990509] [2025-02-08 01:14:53,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119990509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:53,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:53,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:14:53,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660209881] [2025-02-08 01:14:53,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:53,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:14:53,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:53,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:14:53,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:14:53,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 55 [2025-02-08 01:14:53,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 142 flow. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:53,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:53,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 55 [2025-02-08 01:14:53,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:54,645 INFO L124 PetriNetUnfolderBase]: 8081/11550 cut-off events. [2025-02-08 01:14:54,645 INFO L125 PetriNetUnfolderBase]: For 1281/1602 co-relation queries the response was YES. [2025-02-08 01:14:54,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25494 conditions, 11550 events. 8081/11550 cut-off events. For 1281/1602 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 60260 event pairs, 1170 based on Foata normal form. 324/10822 useless extension candidates. Maximal degree in co-relation 25456. Up to 2512 conditions per place. [2025-02-08 01:14:54,679 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 129 selfloop transitions, 18 changer transitions 116/267 dead transitions. [2025-02-08 01:14:54,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 267 transitions, 1214 flow [2025-02-08 01:14:54,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 01:14:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-02-08 01:14:54,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 359 transitions. [2025-02-08 01:14:54,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40795454545454546 [2025-02-08 01:14:54,682 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 142 flow. Second operand 16 states and 359 transitions. [2025-02-08 01:14:54,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 267 transitions, 1214 flow [2025-02-08 01:14:54,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 267 transitions, 1208 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 01:14:54,685 INFO L231 Difference]: Finished difference. Result has 79 places, 67 transitions, 247 flow [2025-02-08 01:14:54,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=247, PETRI_PLACES=79, PETRI_TRANSITIONS=67} [2025-02-08 01:14:54,686 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 23 predicate places. [2025-02-08 01:14:54,686 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 67 transitions, 247 flow [2025-02-08 01:14:54,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:54,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:54,686 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:54,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:14:54,687 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-08 01:14:54,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:54,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1056434322, now seen corresponding path program 1 times [2025-02-08 01:14:54,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:54,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871366984] [2025-02-08 01:14:54,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:14:54,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:54,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 01:14:54,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 01:14:54,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:14:54,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:54,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:14:54,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:54,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871366984] [2025-02-08 01:14:54,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871366984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:54,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:54,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:14:54,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198543108] [2025-02-08 01:14:54,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:54,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:14:54,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:54,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:14:54,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:14:54,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 55 [2025-02-08 01:14:54,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 67 transitions, 247 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 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-08 01:14:54,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:54,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 55 [2025-02-08 01:14:54,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:56,378 INFO L124 PetriNetUnfolderBase]: 7953/11468 cut-off events. [2025-02-08 01:14:56,379 INFO L125 PetriNetUnfolderBase]: For 11019/11181 co-relation queries the response was YES. [2025-02-08 01:14:56,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31398 conditions, 11468 events. 7953/11468 cut-off events. For 11019/11181 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 58739 event pairs, 1141 based on Foata normal form. 159/10549 useless extension candidates. Maximal degree in co-relation 31366. Up to 3685 conditions per place. [2025-02-08 01:14:56,418 INFO L140 encePairwiseOnDemand]: 41/55 looper letters, 202 selfloop transitions, 40 changer transitions 104/349 dead transitions. [2025-02-08 01:14:56,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 349 transitions, 1842 flow [2025-02-08 01:14:56,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 01:14:56,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-02-08 01:14:56,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 471 transitions. [2025-02-08 01:14:56,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3568181818181818 [2025-02-08 01:14:56,421 INFO L175 Difference]: Start difference. First operand has 79 places, 67 transitions, 247 flow. Second operand 24 states and 471 transitions. [2025-02-08 01:14:56,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 349 transitions, 1842 flow [2025-02-08 01:14:56,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 349 transitions, 1796 flow, removed 22 selfloop flow, removed 5 redundant places. [2025-02-08 01:14:56,495 INFO L231 Difference]: Finished difference. Result has 103 places, 92 transitions, 492 flow [2025-02-08 01:14:56,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=492, PETRI_PLACES=103, PETRI_TRANSITIONS=92} [2025-02-08 01:14:56,495 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 47 predicate places. [2025-02-08 01:14:56,495 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 92 transitions, 492 flow [2025-02-08 01:14:56,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 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-08 01:14:56,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:56,496 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:56,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:14:56,496 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-08 01:14:56,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:56,496 INFO L85 PathProgramCache]: Analyzing trace with hash -339030809, now seen corresponding path program 1 times [2025-02-08 01:14:56,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:56,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140907680] [2025-02-08 01:14:56,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:14:56,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:56,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 01:14:56,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 01:14:56,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:14:56,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:56,697 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-08 01:14:56,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:56,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140907680] [2025-02-08 01:14:56,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140907680] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:56,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:56,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:14:56,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514654472] [2025-02-08 01:14:56,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:56,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:14:56,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:56,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:14:56,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:14:56,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 55 [2025-02-08 01:14:56,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 92 transitions, 492 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 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-08 01:14:56,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:56,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 55 [2025-02-08 01:14:56,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:58,046 INFO L124 PetriNetUnfolderBase]: 8342/12050 cut-off events. [2025-02-08 01:14:58,046 INFO L125 PetriNetUnfolderBase]: For 29206/29386 co-relation queries the response was YES. [2025-02-08 01:14:58,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39355 conditions, 12050 events. 8342/12050 cut-off events. For 29206/29386 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 62057 event pairs, 1142 based on Foata normal form. 175/11636 useless extension candidates. Maximal degree in co-relation 39313. Up to 4487 conditions per place. [2025-02-08 01:14:58,114 INFO L140 encePairwiseOnDemand]: 41/55 looper letters, 207 selfloop transitions, 46 changer transitions 103/359 dead transitions. [2025-02-08 01:14:58,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 359 transitions, 2231 flow [2025-02-08 01:14:58,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 01:14:58,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-02-08 01:14:58,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 463 transitions. [2025-02-08 01:14:58,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35075757575757577 [2025-02-08 01:14:58,117 INFO L175 Difference]: Start difference. First operand has 103 places, 92 transitions, 492 flow. Second operand 24 states and 463 transitions. [2025-02-08 01:14:58,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 359 transitions, 2231 flow [2025-02-08 01:14:58,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 359 transitions, 2148 flow, removed 20 selfloop flow, removed 10 redundant places. [2025-02-08 01:14:58,317 INFO L231 Difference]: Finished difference. Result has 122 places, 116 transitions, 708 flow [2025-02-08 01:14:58,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=708, PETRI_PLACES=122, PETRI_TRANSITIONS=116} [2025-02-08 01:14:58,320 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 66 predicate places. [2025-02-08 01:14:58,320 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 116 transitions, 708 flow [2025-02-08 01:14:58,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 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-08 01:14:58,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:58,320 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:58,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:14:58,320 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-08 01:14:58,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:58,321 INFO L85 PathProgramCache]: Analyzing trace with hash -566961735, now seen corresponding path program 1 times [2025-02-08 01:14:58,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:58,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569639185] [2025-02-08 01:14:58,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:14:58,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:58,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 01:14:58,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 01:14:58,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:14:58,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:58,601 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-08 01:14:58,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:58,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569639185] [2025-02-08 01:14:58,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569639185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:58,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:58,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 01:14:58,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606900535] [2025-02-08 01:14:58,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:58,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 01:14:58,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:58,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 01:14:58,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:14:58,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 55 [2025-02-08 01:14:58,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 116 transitions, 708 flow. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-08 01:14:58,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:58,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 55 [2025-02-08 01:14:58,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:00,603 INFO L124 PetriNetUnfolderBase]: 10101/14666 cut-off events. [2025-02-08 01:15:00,603 INFO L125 PetriNetUnfolderBase]: For 62120/62134 co-relation queries the response was YES. [2025-02-08 01:15:00,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55386 conditions, 14666 events. 10101/14666 cut-off events. For 62120/62134 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 77921 event pairs, 1325 based on Foata normal form. 10/14676 useless extension candidates. Maximal degree in co-relation 55323. Up to 4434 conditions per place. [2025-02-08 01:15:00,677 INFO L140 encePairwiseOnDemand]: 37/55 looper letters, 298 selfloop transitions, 84 changer transitions 86/470 dead transitions. [2025-02-08 01:15:00,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 470 transitions, 3339 flow [2025-02-08 01:15:00,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-08 01:15:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-02-08 01:15:00,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 553 transitions. [2025-02-08 01:15:00,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33515151515151514 [2025-02-08 01:15:00,680 INFO L175 Difference]: Start difference. First operand has 122 places, 116 transitions, 708 flow. Second operand 30 states and 553 transitions. [2025-02-08 01:15:00,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 470 transitions, 3339 flow [2025-02-08 01:15:00,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 470 transitions, 3208 flow, removed 41 selfloop flow, removed 11 redundant places. [2025-02-08 01:15:00,927 INFO L231 Difference]: Finished difference. Result has 150 places, 159 transitions, 1230 flow [2025-02-08 01:15:00,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1230, PETRI_PLACES=150, PETRI_TRANSITIONS=159} [2025-02-08 01:15:00,928 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 94 predicate places. [2025-02-08 01:15:00,928 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 159 transitions, 1230 flow [2025-02-08 01:15:00,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-08 01:15:00,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:00,928 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:00,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:15:00,928 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-08 01:15:00,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:00,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1423674959, now seen corresponding path program 2 times [2025-02-08 01:15:00,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:00,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828672329] [2025-02-08 01:15:00,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:15:00,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:00,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-02-08 01:15:00,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 01:15:00,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:15:00,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:01,271 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-08 01:15:01,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:01,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828672329] [2025-02-08 01:15:01,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828672329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:01,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:01,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 01:15:01,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618461543] [2025-02-08 01:15:01,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:01,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 01:15:01,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:01,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 01:15:01,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:15:01,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 55 [2025-02-08 01:15:01,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 159 transitions, 1230 flow. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-08 01:15:01,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:01,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 55 [2025-02-08 01:15:01,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:03,474 INFO L124 PetriNetUnfolderBase]: 11896/17256 cut-off events. [2025-02-08 01:15:03,475 INFO L125 PetriNetUnfolderBase]: For 149553/149567 co-relation queries the response was YES. [2025-02-08 01:15:03,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81468 conditions, 17256 events. 11896/17256 cut-off events. For 149553/149567 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 94316 event pairs, 2146 based on Foata normal form. 10/17266 useless extension candidates. Maximal degree in co-relation 81380. Up to 7744 conditions per place. [2025-02-08 01:15:03,589 INFO L140 encePairwiseOnDemand]: 38/55 looper letters, 331 selfloop transitions, 90 changer transitions 85/508 dead transitions. [2025-02-08 01:15:03,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 508 transitions, 4452 flow [2025-02-08 01:15:03,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-08 01:15:03,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-02-08 01:15:03,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 570 transitions. [2025-02-08 01:15:03,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32386363636363635 [2025-02-08 01:15:03,591 INFO L175 Difference]: Start difference. First operand has 150 places, 159 transitions, 1230 flow. Second operand 32 states and 570 transitions. [2025-02-08 01:15:03,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 508 transitions, 4452 flow [2025-02-08 01:15:04,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 508 transitions, 4068 flow, removed 150 selfloop flow, removed 16 redundant places. [2025-02-08 01:15:04,414 INFO L231 Difference]: Finished difference. Result has 174 places, 191 transitions, 1663 flow [2025-02-08 01:15:04,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1663, PETRI_PLACES=174, PETRI_TRANSITIONS=191} [2025-02-08 01:15:04,415 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 118 predicate places. [2025-02-08 01:15:04,415 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 191 transitions, 1663 flow [2025-02-08 01:15:04,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-08 01:15:04,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:04,415 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:04,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:15:04,416 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-08 01:15:04,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:04,416 INFO L85 PathProgramCache]: Analyzing trace with hash 38186011, now seen corresponding path program 3 times [2025-02-08 01:15:04,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:04,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949763939] [2025-02-08 01:15:04,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:15:04,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:04,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 2 equivalence classes. [2025-02-08 01:15:04,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 48 of 49 statements. [2025-02-08 01:15:04,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:15:04,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:04,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:15:04,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:04,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949763939] [2025-02-08 01:15:04,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949763939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:04,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:04,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 01:15:04,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542393759] [2025-02-08 01:15:04,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:04,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 01:15:04,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:04,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 01:15:04,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:15:04,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 55 [2025-02-08 01:15:04,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 191 transitions, 1663 flow. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-08 01:15:04,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:04,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 55 [2025-02-08 01:15:04,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:08,097 INFO L124 PetriNetUnfolderBase]: 15250/22089 cut-off events. [2025-02-08 01:15:08,097 INFO L125 PetriNetUnfolderBase]: For 259213/259227 co-relation queries the response was YES. [2025-02-08 01:15:08,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115658 conditions, 22089 events. 15250/22089 cut-off events. For 259213/259227 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 125672 event pairs, 1653 based on Foata normal form. 16/21933 useless extension candidates. Maximal degree in co-relation 115572. Up to 7642 conditions per place. [2025-02-08 01:15:08,241 INFO L140 encePairwiseOnDemand]: 37/55 looper letters, 322 selfloop transitions, 173 changer transitions 218/715 dead transitions. [2025-02-08 01:15:08,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 715 transitions, 7004 flow [2025-02-08 01:15:08,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-02-08 01:15:08,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-02-08 01:15:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 715 transitions. [2025-02-08 01:15:08,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29545454545454547 [2025-02-08 01:15:08,243 INFO L175 Difference]: Start difference. First operand has 174 places, 191 transitions, 1663 flow. Second operand 44 states and 715 transitions. [2025-02-08 01:15:08,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 715 transitions, 7004 flow [2025-02-08 01:15:09,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 715 transitions, 6346 flow, removed 237 selfloop flow, removed 22 redundant places. [2025-02-08 01:15:09,397 INFO L231 Difference]: Finished difference. Result has 209 places, 272 transitions, 2885 flow [2025-02-08 01:15:09,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=2885, PETRI_PLACES=209, PETRI_TRANSITIONS=272} [2025-02-08 01:15:09,398 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 153 predicate places. [2025-02-08 01:15:09,398 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 272 transitions, 2885 flow [2025-02-08 01:15:09,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-08 01:15:09,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:09,398 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:09,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:15:09,399 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-08 01:15:09,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:09,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1086090381, now seen corresponding path program 4 times [2025-02-08 01:15:09,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:09,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841027989] [2025-02-08 01:15:09,399 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:15:09,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:09,407 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-02-08 01:15:09,413 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 01:15:09,413 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:15:09,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:09,708 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-08 01:15:09,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:09,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841027989] [2025-02-08 01:15:09,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841027989] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:15:09,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643385110] [2025-02-08 01:15:09,708 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:15:09,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:09,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:15:09,712 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-08 01:15:09,713 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-08 01:15:09,761 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-02-08 01:15:09,784 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 01:15:09,785 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:15:09,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:09,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 01:15:09,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:15:09,906 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 15 treesize of output 7 [2025-02-08 01:15:09,935 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-08 01:15:09,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:15:10,052 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 01:15:10,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 9 [2025-02-08 01:15:10,070 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-08 01:15:10,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643385110] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:15:10,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:15:10,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 22 [2025-02-08 01:15:10,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88437195] [2025-02-08 01:15:10,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:15:10,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 01:15:10,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:10,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 01:15:10,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-02-08 01:15:10,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 55 [2025-02-08 01:15:10,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 272 transitions, 2885 flow. Second operand has 22 states, 22 states have (on average 9.0) internal successors, (198), 22 states have internal predecessors, (198), 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-08 01:15:10,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:10,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 55 [2025-02-08 01:15:10,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:14,585 INFO L124 PetriNetUnfolderBase]: 16572/24207 cut-off events. [2025-02-08 01:15:14,586 INFO L125 PetriNetUnfolderBase]: For 449829/449843 co-relation queries the response was YES. [2025-02-08 01:15:14,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134902 conditions, 24207 events. 16572/24207 cut-off events. For 449829/449843 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 144840 event pairs, 1125 based on Foata normal form. 172/24230 useless extension candidates. Maximal degree in co-relation 134804. Up to 8756 conditions per place. [2025-02-08 01:15:14,843 INFO L140 encePairwiseOnDemand]: 33/55 looper letters, 544 selfloop transitions, 265 changer transitions 154/965 dead transitions. [2025-02-08 01:15:14,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 965 transitions, 11007 flow [2025-02-08 01:15:14,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-02-08 01:15:14,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2025-02-08 01:15:14,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 857 transitions. [2025-02-08 01:15:14,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27824675324675324 [2025-02-08 01:15:14,846 INFO L175 Difference]: Start difference. First operand has 209 places, 272 transitions, 2885 flow. Second operand 56 states and 857 transitions. [2025-02-08 01:15:14,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 965 transitions, 11007 flow [2025-02-08 01:15:17,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 965 transitions, 9764 flow, removed 481 selfloop flow, removed 25 redundant places. [2025-02-08 01:15:17,956 INFO L231 Difference]: Finished difference. Result has 264 places, 449 transitions, 5354 flow [2025-02-08 01:15:17,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=2401, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=5354, PETRI_PLACES=264, PETRI_TRANSITIONS=449} [2025-02-08 01:15:17,957 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 208 predicate places. [2025-02-08 01:15:17,957 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 449 transitions, 5354 flow [2025-02-08 01:15:17,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.0) internal successors, (198), 22 states have internal predecessors, (198), 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-08 01:15:17,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:17,958 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:17,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 01:15:18,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 01:15:18,162 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-08 01:15:18,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:18,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1376919647, now seen corresponding path program 5 times [2025-02-08 01:15:18,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:18,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640730718] [2025-02-08 01:15:18,163 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:15:18,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:18,171 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-02-08 01:15:18,177 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 01:15:18,177 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:15:18,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:15:18,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:18,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640730718] [2025-02-08 01:15:18,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640730718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:18,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:18,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 01:15:18,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602725197] [2025-02-08 01:15:18,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:18,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 01:15:18,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:18,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 01:15:18,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-08 01:15:18,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 55 [2025-02-08 01:15:18,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 449 transitions, 5354 flow. Second operand has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 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-08 01:15:18,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:18,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 55 [2025-02-08 01:15:18,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:22,418 INFO L124 PetriNetUnfolderBase]: 15480/22814 cut-off events. [2025-02-08 01:15:22,418 INFO L125 PetriNetUnfolderBase]: For 548885/548899 co-relation queries the response was YES. [2025-02-08 01:15:22,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146245 conditions, 22814 events. 15480/22814 cut-off events. For 548885/548899 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 138220 event pairs, 1777 based on Foata normal form. 10/22704 useless extension candidates. Maximal degree in co-relation 146130. Up to 7871 conditions per place. [2025-02-08 01:15:22,666 INFO L140 encePairwiseOnDemand]: 37/55 looper letters, 416 selfloop transitions, 347 changer transitions 81/846 dead transitions. [2025-02-08 01:15:22,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 846 transitions, 10621 flow [2025-02-08 01:15:22,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-02-08 01:15:22,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-02-08 01:15:22,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 621 transitions. [2025-02-08 01:15:22,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2822727272727273 [2025-02-08 01:15:22,668 INFO L175 Difference]: Start difference. First operand has 264 places, 449 transitions, 5354 flow. Second operand 40 states and 621 transitions. [2025-02-08 01:15:22,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 846 transitions, 10621 flow [2025-02-08 01:15:26,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 846 transitions, 10117 flow, removed 216 selfloop flow, removed 15 redundant places. [2025-02-08 01:15:26,101 INFO L231 Difference]: Finished difference. Result has 290 places, 529 transitions, 7333 flow [2025-02-08 01:15:26,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=5089, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=283, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=7333, PETRI_PLACES=290, PETRI_TRANSITIONS=529} [2025-02-08 01:15:26,102 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 234 predicate places. [2025-02-08 01:15:26,102 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 529 transitions, 7333 flow [2025-02-08 01:15:26,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 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-08 01:15:26,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:26,102 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:26,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 01:15:26,102 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-08 01:15:26,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:26,103 INFO L85 PathProgramCache]: Analyzing trace with hash 742864005, now seen corresponding path program 6 times [2025-02-08 01:15:26,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:26,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213782799] [2025-02-08 01:15:26,103 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:15:26,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:26,110 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 49 statements into 2 equivalence classes. [2025-02-08 01:15:26,124 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 01:15:26,124 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-02-08 01:15:26,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:26,383 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-08 01:15:26,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:26,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213782799] [2025-02-08 01:15:26,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213782799] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:15:26,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670258714] [2025-02-08 01:15:26,384 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:15:26,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:26,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:15:26,386 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-08 01:15:26,389 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-08 01:15:26,433 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 49 statements into 2 equivalence classes. [2025-02-08 01:15:26,456 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 01:15:26,456 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-02-08 01:15:26,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:26,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 01:15:26,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:15:26,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:15:26,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2025-02-08 01:15:26,704 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-08 01:15:26,704 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:15:26,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670258714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:26,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:15:26,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 21 [2025-02-08 01:15:26,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139673234] [2025-02-08 01:15:26,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:26,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 01:15:26,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:26,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 01:15:26,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-02-08 01:15:26,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 55 [2025-02-08 01:15:26,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 529 transitions, 7333 flow. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-08 01:15:26,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:26,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 55 [2025-02-08 01:15:26,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:32,525 INFO L124 PetriNetUnfolderBase]: 21578/31764 cut-off events. [2025-02-08 01:15:32,525 INFO L125 PetriNetUnfolderBase]: For 745603/745617 co-relation queries the response was YES. [2025-02-08 01:15:32,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203960 conditions, 31764 events. 21578/31764 cut-off events. For 745603/745617 co-relation queries the response was YES. Maximal size of possible extension queue 1124. Compared 199599 event pairs, 2984 based on Foata normal form. 12/31676 useless extension candidates. Maximal degree in co-relation 203836. Up to 17494 conditions per place. [2025-02-08 01:15:32,816 INFO L140 encePairwiseOnDemand]: 37/55 looper letters, 615 selfloop transitions, 239 changer transitions 137/993 dead transitions. [2025-02-08 01:15:32,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 993 transitions, 14368 flow [2025-02-08 01:15:32,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-08 01:15:32,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-02-08 01:15:32,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 516 transitions. [2025-02-08 01:15:32,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32351097178683386 [2025-02-08 01:15:32,818 INFO L175 Difference]: Start difference. First operand has 290 places, 529 transitions, 7333 flow. Second operand 29 states and 516 transitions. [2025-02-08 01:15:32,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 993 transitions, 14368 flow [2025-02-08 01:15:38,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 993 transitions, 13136 flow, removed 427 selfloop flow, removed 30 redundant places. [2025-02-08 01:15:38,557 INFO L231 Difference]: Finished difference. Result has 306 places, 630 transitions, 8801 flow [2025-02-08 01:15:38,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=6552, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=8801, PETRI_PLACES=306, PETRI_TRANSITIONS=630} [2025-02-08 01:15:38,558 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 250 predicate places. [2025-02-08 01:15:38,558 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 630 transitions, 8801 flow [2025-02-08 01:15:38,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-08 01:15:38,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:38,558 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:38,564 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-08 01:15:38,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:38,759 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-08 01:15:38,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:38,759 INFO L85 PathProgramCache]: Analyzing trace with hash 253223773, now seen corresponding path program 7 times [2025-02-08 01:15:38,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:38,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799597567] [2025-02-08 01:15:38,760 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:15:38,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:38,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 01:15:38,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 01:15:38,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:15:38,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:38,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:15:38,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:38,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799597567] [2025-02-08 01:15:38,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799597567] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:15:38,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322471135] [2025-02-08 01:15:38,938 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:15:38,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:38,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:15:38,940 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-08 01:15:38,942 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-08 01:15:38,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 01:15:39,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 01:15:39,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:15:39,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:39,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 01:15:39,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:15:39,048 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 15 treesize of output 7 [2025-02-08 01:15:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:15:39,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:15:39,147 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 01:15:39,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2025-02-08 01:15:39,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:15:39,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322471135] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:15:39,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:15:39,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 17 [2025-02-08 01:15:39,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787381324] [2025-02-08 01:15:39,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:15:39,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 01:15:39,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:39,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 01:15:39,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-02-08 01:15:39,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 55 [2025-02-08 01:15:39,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 630 transitions, 8801 flow. Second operand has 17 states, 17 states have (on average 9.764705882352942) internal successors, (166), 17 states have internal predecessors, (166), 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-08 01:15:39,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:39,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 55 [2025-02-08 01:15:39,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:46,690 INFO L124 PetriNetUnfolderBase]: 22224/32907 cut-off events. [2025-02-08 01:15:46,690 INFO L125 PetriNetUnfolderBase]: For 819580/819594 co-relation queries the response was YES. [2025-02-08 01:15:47,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214047 conditions, 32907 events. 22224/32907 cut-off events. For 819580/819594 co-relation queries the response was YES. Maximal size of possible extension queue 1104. Compared 209336 event pairs, 1715 based on Foata normal form. 67/32890 useless extension candidates. Maximal degree in co-relation 213908. Up to 10314 conditions per place. [2025-02-08 01:15:47,212 INFO L140 encePairwiseOnDemand]: 35/55 looper letters, 689 selfloop transitions, 733 changer transitions 154/1578 dead transitions. [2025-02-08 01:15:47,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 1578 transitions, 22403 flow [2025-02-08 01:15:47,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2025-02-08 01:15:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2025-02-08 01:15:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 1163 transitions. [2025-02-08 01:15:47,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2402892561983471 [2025-02-08 01:15:47,214 INFO L175 Difference]: Start difference. First operand has 306 places, 630 transitions, 8801 flow. Second operand 88 states and 1163 transitions. [2025-02-08 01:15:47,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 1578 transitions, 22403 flow [2025-02-08 01:15:52,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 1578 transitions, 21800 flow, removed 285 selfloop flow, removed 14 redundant places. [2025-02-08 01:15:52,501 INFO L231 Difference]: Finished difference. Result has 392 places, 983 transitions, 15584 flow [2025-02-08 01:15:52,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=8362, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=379, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=88, PETRI_FLOW=15584, PETRI_PLACES=392, PETRI_TRANSITIONS=983} [2025-02-08 01:15:52,502 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 336 predicate places. [2025-02-08 01:15:52,502 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 983 transitions, 15584 flow [2025-02-08 01:15:52,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.764705882352942) internal successors, (166), 17 states have internal predecessors, (166), 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-08 01:15:52,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:52,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:52,508 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-08 01:15:52,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:52,703 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:15:52,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:52,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1510500281, now seen corresponding path program 2 times [2025-02-08 01:15:52,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:52,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248268471] [2025-02-08 01:15:52,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:15:52,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:52,710 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-02-08 01:15:52,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 01:15:52,738 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:15:52,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:52,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:15:52,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:52,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248268471] [2025-02-08 01:15:52,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248268471] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:15:52,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089638667] [2025-02-08 01:15:52,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:15:52,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:52,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:15:52,847 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-08 01:15:52,848 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-08 01:15:52,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-02-08 01:15:52,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 01:15:52,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:15:52,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:52,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 01:15:52,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:15:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:15:52,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:15:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:15:52,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089638667] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:15:52,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:15:52,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-08 01:15:52,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466397278] [2025-02-08 01:15:52,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:15:52,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:15:52,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:52,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:15:52,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:15:52,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 55 [2025-02-08 01:15:52,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 983 transitions, 15584 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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-08 01:15:52,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:52,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 55 [2025-02-08 01:15:52,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:02,136 INFO L124 PetriNetUnfolderBase]: 28782/42989 cut-off events. [2025-02-08 01:16:02,136 INFO L125 PetriNetUnfolderBase]: For 1246448/1246484 co-relation queries the response was YES. [2025-02-08 01:16:02,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309294 conditions, 42989 events. 28782/42989 cut-off events. For 1246448/1246484 co-relation queries the response was YES. Maximal size of possible extension queue 1534. Compared 292695 event pairs, 1077 based on Foata normal form. 363/43313 useless extension candidates. Maximal degree in co-relation 309151. Up to 10709 conditions per place. [2025-02-08 01:16:02,863 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 1313 selfloop transitions, 213 changer transitions 212/1779 dead transitions. [2025-02-08 01:16:02,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 1779 transitions, 31587 flow [2025-02-08 01:16:02,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 01:16:02,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-08 01:16:02,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 315 transitions. [2025-02-08 01:16:02,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2025-02-08 01:16:02,865 INFO L175 Difference]: Start difference. First operand has 392 places, 983 transitions, 15584 flow. Second operand 15 states and 315 transitions. [2025-02-08 01:16:02,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 1779 transitions, 31587 flow