./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 573af40880ce1d61666f10a2729c7d6ecdb02e81781df2543efcfdd5788ab6d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:48:53,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:48:53,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:48:53,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:48:53,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:48:53,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:48:53,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:48:53,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:48:53,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:48:53,851 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:48:53,851 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:48:53,851 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:48:53,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:48:53,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:48:53,852 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:48:53,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:48:53,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:48:53,852 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:48:53,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:48:53,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:48:53,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:48:53,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:48:53,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:48:53,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:48:53,853 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:48:53,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:48:53,853 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:48:53,853 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:48:53,853 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:48:53,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:48:53,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:48:53,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:48:53,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:48:53,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:48:53,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:48:53,854 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:48:53,854 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:48:53,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:48:53,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:48:53,855 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:48:53,855 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:48:53,855 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:48:53,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:48:53,855 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/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 -> 573af40880ce1d61666f10a2729c7d6ecdb02e81781df2543efcfdd5788ab6d6 [2025-03-13 21:48:54,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:48:54,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:48:54,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:48:54,082 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:48:54,083 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:48:54,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c [2025-03-13 21:48:55,234 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f7be082/bd424fd72de24298b1f31b89cc8a80cc/FLAG454f3d320 [2025-03-13 21:48:55,478 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:48:55,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c [2025-03-13 21:48:55,485 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f7be082/bd424fd72de24298b1f31b89cc8a80cc/FLAG454f3d320 [2025-03-13 21:48:55,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f7be082/bd424fd72de24298b1f31b89cc8a80cc [2025-03-13 21:48:55,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:48:55,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:48:55,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:48:55,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:48:55,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:48:55,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:48:55" (1/1) ... [2025-03-13 21:48:55,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e94e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:55, skipping insertion in model container [2025-03-13 21:48:55,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:48:55" (1/1) ... [2025-03-13 21:48:55,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:48:55,919 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c[2592,2605] [2025-03-13 21:48:55,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:48:55,934 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:48:55,957 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c[2592,2605] [2025-03-13 21:48:55,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:48:55,970 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:48:55,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:55 WrapperNode [2025-03-13 21:48:55,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:48:55,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:48:55,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:48:55,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:48:55,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:55" (1/1) ... [2025-03-13 21:48:55,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:55" (1/1) ... [2025-03-13 21:48:55,991 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 83 [2025-03-13 21:48:55,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:48:55,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:48:55,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:48:55,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:48:55,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:55" (1/1) ... [2025-03-13 21:48:55,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:55" (1/1) ... [2025-03-13 21:48:55,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:55" (1/1) ... [2025-03-13 21:48:56,008 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 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-03-13 21:48:56,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:55" (1/1) ... [2025-03-13 21:48:56,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:55" (1/1) ... [2025-03-13 21:48:56,012 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:55" (1/1) ... [2025-03-13 21:48:56,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:55" (1/1) ... [2025-03-13 21:48:56,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:55" (1/1) ... [2025-03-13 21:48:56,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:55" (1/1) ... [2025-03-13 21:48:56,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:48:56,015 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:48:56,015 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:48:56,015 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:48:56,016 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:55" (1/1) ... [2025-03-13 21:48:56,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:48:56,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:48:56,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:48:56,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:48:56,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:48:56,055 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:48:56,055 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:48:56,055 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:48:56,055 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:48:56,055 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:48:56,055 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:48:56,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:48:56,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:48:56,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:48:56,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:48:56,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:48:56,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:48:56,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:48:56,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:48:56,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:48:56,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:48:56,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:48:56,057 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:48:56,130 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:48:56,131 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:48:56,334 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:48:56,335 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:48:56,335 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:48:56,506 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:48:56,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:48:56 BoogieIcfgContainer [2025-03-13 21:48:56,507 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:48:56,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:48:56,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:48:56,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:48:56,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:48:55" (1/3) ... [2025-03-13 21:48:56,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed49a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:48:56, skipping insertion in model container [2025-03-13 21:48:56,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:55" (2/3) ... [2025-03-13 21:48:56,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed49a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:48:56, skipping insertion in model container [2025-03-13 21:48:56,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:48:56" (3/3) ... [2025-03-13 21:48:56,513 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2025-03-13 21:48:56,522 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:48:56,523 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-max-array.wvr.c that has 4 procedures, 30 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-13 21:48:56,523 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:48:56,566 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 21:48:56,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 87 flow [2025-03-13 21:48:56,620 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-03-13 21:48:56,621 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:48:56,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 4/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-03-13 21:48:56,628 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 87 flow [2025-03-13 21:48:56,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 76 flow [2025-03-13 21:48:56,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:48:56,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;@1aee8a73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:48:56,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-13 21:48:56,676 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:48:56,676 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-03-13 21:48:56,676 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:48:56,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:56,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:56,677 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-03-13 21:48:56,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:56,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1132871695, now seen corresponding path program 1 times [2025-03-13 21:48:56,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:56,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539708094] [2025-03-13 21:48:56,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:56,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:56,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:48:56,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:48:56,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:56,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:56,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:48:56,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:56,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539708094] [2025-03-13 21:48:56,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539708094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:56,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:56,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:48:56,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610823259] [2025-03-13 21:48:56,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:56,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:48:56,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:56,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:48:56,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:48:56,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-13 21:48:56,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-03-13 21:48:56,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:56,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-13 21:48:56,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:57,110 INFO L124 PetriNetUnfolderBase]: 617/954 cut-off events. [2025-03-13 21:48:57,111 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-13 21:48:57,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1949 conditions, 954 events. 617/954 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3774 event pairs, 126 based on Foata normal form. 1/950 useless extension candidates. Maximal degree in co-relation 1715. Up to 677 conditions per place. [2025-03-13 21:48:57,118 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 37 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2025-03-13 21:48:57,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 209 flow [2025-03-13 21:48:57,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:48:57,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:48:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-03-13 21:48:57,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2025-03-13 21:48:57,127 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 76 flow. Second operand 3 states and 64 transitions. [2025-03-13 21:48:57,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 209 flow [2025-03-13 21:48:57,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 187 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 21:48:57,134 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 90 flow [2025-03-13 21:48:57,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=32, PETRI_TRANSITIONS=32} [2025-03-13 21:48:57,138 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2025-03-13 21:48:57,138 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 90 flow [2025-03-13 21:48:57,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-03-13 21:48:57,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:57,140 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] [2025-03-13 21:48:57,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:48:57,141 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-03-13 21:48:57,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:57,141 INFO L85 PathProgramCache]: Analyzing trace with hash -110190373, now seen corresponding path program 1 times [2025-03-13 21:48:57,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:57,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918987026] [2025-03-13 21:48:57,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:57,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:57,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:48:57,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:48:57,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:57,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:57,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:48:57,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:57,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918987026] [2025-03-13 21:48:57,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918987026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:57,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:57,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:48:57,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896253821] [2025-03-13 21:48:57,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:57,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:48:57,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:57,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:48:57,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:48:57,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-13 21:48:57,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-03-13 21:48:57,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:57,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-13 21:48:57,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:57,418 INFO L124 PetriNetUnfolderBase]: 617/965 cut-off events. [2025-03-13 21:48:57,418 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2025-03-13 21:48:57,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2170 conditions, 965 events. 617/965 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4078 event pairs, 407 based on Foata normal form. 0/957 useless extension candidates. Maximal degree in co-relation 802. Up to 895 conditions per place. [2025-03-13 21:48:57,428 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 27 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2025-03-13 21:48:57,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 150 flow [2025-03-13 21:48:57,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:48:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:48:57,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-03-13 21:48:57,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-03-13 21:48:57,431 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 90 flow. Second operand 3 states and 48 transitions. [2025-03-13 21:48:57,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 150 flow [2025-03-13 21:48:57,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:48:57,433 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 98 flow [2025-03-13 21:48:57,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=34, PETRI_TRANSITIONS=33} [2025-03-13 21:48:57,434 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2025-03-13 21:48:57,434 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 98 flow [2025-03-13 21:48:57,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-03-13 21:48:57,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:57,434 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:57,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:48:57,435 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-03-13 21:48:57,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:57,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1070716047, now seen corresponding path program 1 times [2025-03-13 21:48:57,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:57,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139079249] [2025-03-13 21:48:57,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:57,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:57,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:48:57,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:48:57,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:57,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:57,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:48:57,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:57,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139079249] [2025-03-13 21:48:57,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139079249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:57,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:57,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:48:57,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410920128] [2025-03-13 21:48:57,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:57,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:48:57,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:57,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:48:57,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:48:57,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-13 21:48:57,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:57,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:57,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-13 21:48:57,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:57,681 INFO L124 PetriNetUnfolderBase]: 790/1161 cut-off events. [2025-03-13 21:48:57,681 INFO L125 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2025-03-13 21:48:57,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2575 conditions, 1161 events. 790/1161 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4572 event pairs, 246 based on Foata normal form. 0/1118 useless extension candidates. Maximal degree in co-relation 2562. Up to 576 conditions per place. [2025-03-13 21:48:57,687 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 40 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2025-03-13 21:48:57,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 224 flow [2025-03-13 21:48:57,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:48:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:48:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-03-13 21:48:57,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2025-03-13 21:48:57,689 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 98 flow. Second operand 4 states and 63 transitions. [2025-03-13 21:48:57,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 224 flow [2025-03-13 21:48:57,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 218 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 21:48:57,692 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 113 flow [2025-03-13 21:48:57,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2025-03-13 21:48:57,693 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-03-13 21:48:57,694 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 113 flow [2025-03-13 21:48:57,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:57,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:57,694 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:57,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:48:57,694 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-03-13 21:48:57,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:57,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1334506777, now seen corresponding path program 1 times [2025-03-13 21:48:57,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:57,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832464399] [2025-03-13 21:48:57,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:57,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:57,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:48:57,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:48:57,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:57,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:48:57,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:57,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832464399] [2025-03-13 21:48:57,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832464399] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:48:57,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736738244] [2025-03-13 21:48:57,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:57,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:48:57,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:48:57,807 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:48:57,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:48:57,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:48:57,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:48:57,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:57,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:57,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 21:48:57,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:48:57,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:48:57,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:48:57,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:48:57,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736738244] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:48:57,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:48:57,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-13 21:48:57,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298904565] [2025-03-13 21:48:57,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:57,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:48:57,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:57,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:48:57,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:48:57,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-13 21:48:57,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:57,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:57,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-13 21:48:57,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:58,093 INFO L124 PetriNetUnfolderBase]: 855/1295 cut-off events. [2025-03-13 21:48:58,093 INFO L125 PetriNetUnfolderBase]: For 505/505 co-relation queries the response was YES. [2025-03-13 21:48:58,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3247 conditions, 1295 events. 855/1295 cut-off events. For 505/505 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5382 event pairs, 256 based on Foata normal form. 0/1230 useless extension candidates. Maximal degree in co-relation 3227. Up to 670 conditions per place. [2025-03-13 21:48:58,101 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 41 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2025-03-13 21:48:58,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 257 flow [2025-03-13 21:48:58,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:48:58,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:48:58,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-03-13 21:48:58,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-03-13 21:48:58,104 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 113 flow. Second operand 5 states and 72 transitions. [2025-03-13 21:48:58,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 257 flow [2025-03-13 21:48:58,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:48:58,108 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 132 flow [2025-03-13 21:48:58,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-03-13 21:48:58,109 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-03-13 21:48:58,109 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 132 flow [2025-03-13 21:48:58,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:58,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:58,109 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] [2025-03-13 21:48:58,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 21:48:58,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:48:58,314 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-03-13 21:48:58,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:58,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1434408397, now seen corresponding path program 1 times [2025-03-13 21:48:58,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:58,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479743459] [2025-03-13 21:48:58,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:58,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:58,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:48:58,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:48:58,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:58,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:58,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:48:58,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:58,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479743459] [2025-03-13 21:48:58,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479743459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:48:58,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844639500] [2025-03-13 21:48:58,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:58,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:48:58,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:48:58,817 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:48:58,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:48:58,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:48:58,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:48:58,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:58,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:58,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-13 21:48:58,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:48:58,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-13 21:48:59,126 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 55 treesize of output 31 [2025-03-13 21:48:59,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:48:59,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:48:59,983 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 117 treesize of output 105 [2025-03-13 21:49:00,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:49:00,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 149 [2025-03-13 21:49:00,701 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 93 treesize of output 85 [2025-03-13 21:49:00,726 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-03-13 21:49:00,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 103 [2025-03-13 21:49:01,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:01,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844639500] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:01,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:01,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2025-03-13 21:49:01,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765833695] [2025-03-13 21:49:01,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:01,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-13 21:49:01,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:01,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-13 21:49:01,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2025-03-13 21:49:01,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-13 21:49:01,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 132 flow. Second operand has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 states have internal predecessors, (208), 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-03-13 21:49:01,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:01,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-13 21:49:01,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:02,681 INFO L124 PetriNetUnfolderBase]: 1841/2761 cut-off events. [2025-03-13 21:49:02,681 INFO L125 PetriNetUnfolderBase]: For 1721/1721 co-relation queries the response was YES. [2025-03-13 21:49:02,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7669 conditions, 2761 events. 1841/2761 cut-off events. For 1721/1721 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12695 event pairs, 106 based on Foata normal form. 1/2761 useless extension candidates. Maximal degree in co-relation 5614. Up to 1375 conditions per place. [2025-03-13 21:49:02,692 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 137 selfloop transitions, 57 changer transitions 1/199 dead transitions. [2025-03-13 21:49:02,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 199 transitions, 1067 flow [2025-03-13 21:49:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 21:49:02,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 21:49:02,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 321 transitions. [2025-03-13 21:49:02,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46320346320346323 [2025-03-13 21:49:02,694 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 132 flow. Second operand 21 states and 321 transitions. [2025-03-13 21:49:02,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 199 transitions, 1067 flow [2025-03-13 21:49:02,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 199 transitions, 1050 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:49:02,700 INFO L231 Difference]: Finished difference. Result has 64 places, 91 transitions, 543 flow [2025-03-13 21:49:02,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=543, PETRI_PLACES=64, PETRI_TRANSITIONS=91} [2025-03-13 21:49:02,702 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2025-03-13 21:49:02,702 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 91 transitions, 543 flow [2025-03-13 21:49:02,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 states have internal predecessors, (208), 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-03-13 21:49:02,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:02,702 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] [2025-03-13 21:49:02,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-13 21:49:02,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:02,903 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-03-13 21:49:02,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:02,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1109207333, now seen corresponding path program 2 times [2025-03-13 21:49:02,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:02,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418677967] [2025-03-13 21:49:02,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:02,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:02,910 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:49:02,923 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:49:02,923 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:02,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:03,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:03,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:03,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418677967] [2025-03-13 21:49:03,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418677967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:03,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847079828] [2025-03-13 21:49:03,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:03,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:03,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:03,484 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:03,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 21:49:03,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:49:03,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:49:03,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:03,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:03,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-13 21:49:03,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:03,753 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 55 treesize of output 31 [2025-03-13 21:49:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:03,794 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:03,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:49:03,891 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 89 treesize of output 49 [2025-03-13 21:49:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:04,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847079828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:04,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:04,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2025-03-13 21:49:04,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929566904] [2025-03-13 21:49:04,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:04,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-13 21:49:04,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:04,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-13 21:49:04,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2025-03-13 21:49:04,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-13 21:49:04,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 91 transitions, 543 flow. Second operand has 23 states, 23 states have (on average 9.608695652173912) internal successors, (221), 23 states have internal predecessors, (221), 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-03-13 21:49:04,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:04,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-13 21:49:04,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:04,961 INFO L124 PetriNetUnfolderBase]: 1618/2632 cut-off events. [2025-03-13 21:49:04,962 INFO L125 PetriNetUnfolderBase]: For 3611/3611 co-relation queries the response was YES. [2025-03-13 21:49:04,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8571 conditions, 2632 events. 1618/2632 cut-off events. For 3611/3611 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 13728 event pairs, 80 based on Foata normal form. 2/2632 useless extension candidates. Maximal degree in co-relation 8009. Up to 1663 conditions per place. [2025-03-13 21:49:04,979 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 139 selfloop transitions, 89 changer transitions 1/235 dead transitions. [2025-03-13 21:49:04,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 235 transitions, 1631 flow [2025-03-13 21:49:04,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 21:49:04,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 21:49:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 316 transitions. [2025-03-13 21:49:04,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.455988455988456 [2025-03-13 21:49:04,982 INFO L175 Difference]: Start difference. First operand has 64 places, 91 transitions, 543 flow. Second operand 21 states and 316 transitions. [2025-03-13 21:49:04,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 235 transitions, 1631 flow [2025-03-13 21:49:04,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 235 transitions, 1469 flow, removed 54 selfloop flow, removed 3 redundant places. [2025-03-13 21:49:05,019 INFO L231 Difference]: Finished difference. Result has 91 places, 150 transitions, 1050 flow [2025-03-13 21:49:05,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1050, PETRI_PLACES=91, PETRI_TRANSITIONS=150} [2025-03-13 21:49:05,020 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 56 predicate places. [2025-03-13 21:49:05,020 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 150 transitions, 1050 flow [2025-03-13 21:49:05,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.608695652173912) internal successors, (221), 23 states have internal predecessors, (221), 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-03-13 21:49:05,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:05,021 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] [2025-03-13 21:49:05,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-13 21:49:05,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:05,222 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-03-13 21:49:05,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:05,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1523048077, now seen corresponding path program 3 times [2025-03-13 21:49:05,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:05,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525487633] [2025-03-13 21:49:05,222 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:49:05,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:05,229 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:49:05,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:49:05,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:49:05,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:05,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:05,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:05,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525487633] [2025-03-13 21:49:05,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525487633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:05,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633779991] [2025-03-13 21:49:05,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:49:05,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:05,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:05,687 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:05,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 21:49:05,724 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:49:05,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:49:05,740 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:49:05,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:05,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-13 21:49:05,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:05,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-13 21:49:05,914 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 55 treesize of output 31 [2025-03-13 21:49:05,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:05,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:06,510 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 53 treesize of output 47 [2025-03-13 21:49:06,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:49:06,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2025-03-13 21:49:06,594 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 69 treesize of output 61 [2025-03-13 21:49:06,604 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 21:49:06,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 75 [2025-03-13 21:49:06,681 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 66 treesize of output 58 [2025-03-13 21:49:06,688 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:49:06,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 1 [2025-03-13 21:49:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:06,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633779991] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:06,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:06,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 22 [2025-03-13 21:49:06,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155360167] [2025-03-13 21:49:06,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:06,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-13 21:49:06,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:06,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-13 21:49:06,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2025-03-13 21:49:06,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-13 21:49:06,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 150 transitions, 1050 flow. Second operand has 23 states, 23 states have (on average 9.565217391304348) internal successors, (220), 23 states have internal predecessors, (220), 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-03-13 21:49:06,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:06,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-13 21:49:06,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:08,657 INFO L124 PetriNetUnfolderBase]: 3419/5502 cut-off events. [2025-03-13 21:49:08,657 INFO L125 PetriNetUnfolderBase]: For 13345/13374 co-relation queries the response was YES. [2025-03-13 21:49:08,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20684 conditions, 5502 events. 3419/5502 cut-off events. For 13345/13374 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 32644 event pairs, 201 based on Foata normal form. 29/5529 useless extension candidates. Maximal degree in co-relation 19553. Up to 2464 conditions per place. [2025-03-13 21:49:08,699 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 232 selfloop transitions, 193 changer transitions 2/433 dead transitions. [2025-03-13 21:49:08,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 433 transitions, 3434 flow [2025-03-13 21:49:08,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-13 21:49:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-13 21:49:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 542 transitions. [2025-03-13 21:49:08,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4692640692640693 [2025-03-13 21:49:08,701 INFO L175 Difference]: Start difference. First operand has 91 places, 150 transitions, 1050 flow. Second operand 35 states and 542 transitions. [2025-03-13 21:49:08,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 433 transitions, 3434 flow [2025-03-13 21:49:08,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 433 transitions, 3421 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-13 21:49:08,728 INFO L231 Difference]: Finished difference. Result has 134 places, 272 transitions, 2513 flow [2025-03-13 21:49:08,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=2513, PETRI_PLACES=134, PETRI_TRANSITIONS=272} [2025-03-13 21:49:08,729 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 99 predicate places. [2025-03-13 21:49:08,729 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 272 transitions, 2513 flow [2025-03-13 21:49:08,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.565217391304348) internal successors, (220), 23 states have internal predecessors, (220), 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-03-13 21:49:08,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:08,729 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] [2025-03-13 21:49:08,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-13 21:49:08,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:08,933 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-03-13 21:49:08,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:08,933 INFO L85 PathProgramCache]: Analyzing trace with hash 601212965, now seen corresponding path program 4 times [2025-03-13 21:49:08,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:08,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430762903] [2025-03-13 21:49:08,934 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:49:08,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:08,939 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:49:08,954 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:49:08,954 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:49:08,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:09,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:09,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430762903] [2025-03-13 21:49:09,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430762903] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:09,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996195444] [2025-03-13 21:49:09,268 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:49:09,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:09,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:09,275 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:09,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 21:49:09,319 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:49:09,336 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:49:09,336 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:49:09,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:09,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-13 21:49:09,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:09,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-13 21:49:09,519 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 55 treesize of output 31 [2025-03-13 21:49:09,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:09,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:10,044 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 69 treesize of output 61 [2025-03-13 21:49:10,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:49:10,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 79 [2025-03-13 21:49:10,172 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 66 treesize of output 58 [2025-03-13 21:49:10,177 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:49:10,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 1 [2025-03-13 21:49:10,179 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 53 treesize of output 47 [2025-03-13 21:49:10,184 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:49:10,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 1 [2025-03-13 21:49:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:10,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996195444] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:10,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:10,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2025-03-13 21:49:10,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264967122] [2025-03-13 21:49:10,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:10,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-13 21:49:10,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:10,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-13 21:49:10,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2025-03-13 21:49:10,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-13 21:49:10,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 272 transitions, 2513 flow. Second operand has 24 states, 24 states have (on average 8.625) internal successors, (207), 24 states have internal predecessors, (207), 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-03-13 21:49:10,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:10,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-13 21:49:10,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:12,019 INFO L124 PetriNetUnfolderBase]: 5174/8254 cut-off events. [2025-03-13 21:49:12,020 INFO L125 PetriNetUnfolderBase]: For 31484/31556 co-relation queries the response was YES. [2025-03-13 21:49:12,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35286 conditions, 8254 events. 5174/8254 cut-off events. For 31484/31556 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 52596 event pairs, 891 based on Foata normal form. 19/8264 useless extension candidates. Maximal degree in co-relation 34164. Up to 5882 conditions per place. [2025-03-13 21:49:12,067 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 299 selfloop transitions, 156 changer transitions 2/462 dead transitions. [2025-03-13 21:49:12,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 462 transitions, 4598 flow [2025-03-13 21:49:12,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-13 21:49:12,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-13 21:49:12,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 435 transitions. [2025-03-13 21:49:12,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39944903581267216 [2025-03-13 21:49:12,070 INFO L175 Difference]: Start difference. First operand has 134 places, 272 transitions, 2513 flow. Second operand 33 states and 435 transitions. [2025-03-13 21:49:12,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 462 transitions, 4598 flow [2025-03-13 21:49:12,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 462 transitions, 4325 flow, removed 83 selfloop flow, removed 12 redundant places. [2025-03-13 21:49:12,152 INFO L231 Difference]: Finished difference. Result has 163 places, 347 transitions, 3414 flow [2025-03-13 21:49:12,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2263, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=3414, PETRI_PLACES=163, PETRI_TRANSITIONS=347} [2025-03-13 21:49:12,153 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 128 predicate places. [2025-03-13 21:49:12,153 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 347 transitions, 3414 flow [2025-03-13 21:49:12,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.625) internal successors, (207), 24 states have internal predecessors, (207), 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-03-13 21:49:12,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:12,153 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] [2025-03-13 21:49:12,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-13 21:49:12,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:12,358 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-03-13 21:49:12,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:12,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1448679899, now seen corresponding path program 5 times [2025-03-13 21:49:12,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:12,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87926480] [2025-03-13 21:49:12,359 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:49:12,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:12,364 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:49:12,374 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:49:12,375 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:12,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:12,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:12,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:12,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87926480] [2025-03-13 21:49:12,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87926480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:12,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775761905] [2025-03-13 21:49:12,806 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:49:12,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:12,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:12,808 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:12,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-13 21:49:12,843 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:49:12,858 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:49:12,858 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:12,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:12,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-13 21:49:12,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:12,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-13 21:49:13,108 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 55 treesize of output 31 [2025-03-13 21:49:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:13,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:13,862 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 69 treesize of output 61 [2025-03-13 21:49:13,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:49:13,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 79 [2025-03-13 21:49:13,991 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 53 treesize of output 47 [2025-03-13 21:49:13,997 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:49:13,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 1 [2025-03-13 21:49:14,000 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 66 treesize of output 58 [2025-03-13 21:49:14,007 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:49:14,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 1 [2025-03-13 21:49:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:14,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775761905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:14,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:14,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-03-13 21:49:14,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613773282] [2025-03-13 21:49:14,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:14,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-13 21:49:14,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:14,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-13 21:49:14,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2025-03-13 21:49:14,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-13 21:49:14,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 347 transitions, 3414 flow. Second operand has 28 states, 28 states have (on average 7.535714285714286) internal successors, (211), 28 states have internal predecessors, (211), 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-03-13 21:49:14,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:14,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-13 21:49:14,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:17,390 INFO L124 PetriNetUnfolderBase]: 8715/12687 cut-off events. [2025-03-13 21:49:17,390 INFO L125 PetriNetUnfolderBase]: For 49375/49375 co-relation queries the response was YES. [2025-03-13 21:49:17,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55826 conditions, 12687 events. 8715/12687 cut-off events. For 49375/49375 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 71977 event pairs, 916 based on Foata normal form. 4/12690 useless extension candidates. Maximal degree in co-relation 55428. Up to 5705 conditions per place. [2025-03-13 21:49:17,457 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 352 selfloop transitions, 392 changer transitions 3/749 dead transitions. [2025-03-13 21:49:17,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 749 transitions, 7775 flow [2025-03-13 21:49:17,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-13 21:49:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-13 21:49:17,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 595 transitions. [2025-03-13 21:49:17,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4097796143250689 [2025-03-13 21:49:17,461 INFO L175 Difference]: Start difference. First operand has 163 places, 347 transitions, 3414 flow. Second operand 44 states and 595 transitions. [2025-03-13 21:49:17,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 749 transitions, 7775 flow [2025-03-13 21:49:17,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 749 transitions, 7428 flow, removed 117 selfloop flow, removed 9 redundant places. [2025-03-13 21:49:17,612 INFO L231 Difference]: Finished difference. Result has 215 places, 532 transitions, 6218 flow [2025-03-13 21:49:17,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3136, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=222, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=6218, PETRI_PLACES=215, PETRI_TRANSITIONS=532} [2025-03-13 21:49:17,614 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 180 predicate places. [2025-03-13 21:49:17,614 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 532 transitions, 6218 flow [2025-03-13 21:49:17,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.535714285714286) internal successors, (211), 28 states have internal predecessors, (211), 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-03-13 21:49:17,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:17,614 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:17,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-13 21:49:17,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:17,816 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-03-13 21:49:17,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:17,817 INFO L85 PathProgramCache]: Analyzing trace with hash 128833131, now seen corresponding path program 6 times [2025-03-13 21:49:17,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:17,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764208989] [2025-03-13 21:49:17,817 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:49:17,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:17,822 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:49:17,830 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:49:17,831 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:49:17,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:17,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:17,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764208989] [2025-03-13 21:49:17,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764208989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:17,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841951227] [2025-03-13 21:49:17,894 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:49:17,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:17,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:17,896 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:17,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-13 21:49:17,933 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:49:17,948 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:49:17,948 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:49:17,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:17,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:49:17,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:18,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:18,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:18,082 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:18,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841951227] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:18,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:18,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-13 21:49:18,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037168390] [2025-03-13 21:49:18,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:18,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-13 21:49:18,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:18,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-13 21:49:18,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-13 21:49:18,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-13 21:49:18,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 532 transitions, 6218 flow. Second operand has 18 states, 18 states have (on average 7.222222222222222) internal successors, (130), 18 states have internal predecessors, (130), 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-03-13 21:49:18,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:18,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-13 21:49:18,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:20,337 INFO L124 PetriNetUnfolderBase]: 11318/16651 cut-off events. [2025-03-13 21:49:20,337 INFO L125 PetriNetUnfolderBase]: For 114945/115576 co-relation queries the response was YES. [2025-03-13 21:49:20,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85192 conditions, 16651 events. 11318/16651 cut-off events. For 114945/115576 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 102945 event pairs, 2670 based on Foata normal form. 603/17132 useless extension candidates. Maximal degree in co-relation 84892. Up to 5856 conditions per place. [2025-03-13 21:49:20,443 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 795 selfloop transitions, 102 changer transitions 0/913 dead transitions. [2025-03-13 21:49:20,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 913 transitions, 12131 flow [2025-03-13 21:49:20,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-13 21:49:20,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-13 21:49:20,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 219 transitions. [2025-03-13 21:49:20,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.474025974025974 [2025-03-13 21:49:20,444 INFO L175 Difference]: Start difference. First operand has 215 places, 532 transitions, 6218 flow. Second operand 14 states and 219 transitions. [2025-03-13 21:49:20,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 913 transitions, 12131 flow [2025-03-13 21:49:20,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 913 transitions, 11535 flow, removed 242 selfloop flow, removed 12 redundant places. [2025-03-13 21:49:20,854 INFO L231 Difference]: Finished difference. Result has 222 places, 573 transitions, 6616 flow [2025-03-13 21:49:20,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=5883, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6616, PETRI_PLACES=222, PETRI_TRANSITIONS=573} [2025-03-13 21:49:20,855 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 187 predicate places. [2025-03-13 21:49:20,855 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 573 transitions, 6616 flow [2025-03-13 21:49:20,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.222222222222222) internal successors, (130), 18 states have internal predecessors, (130), 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-03-13 21:49:20,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:20,855 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:20,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-13 21:49:21,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:21,056 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-03-13 21:49:21,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:21,056 INFO L85 PathProgramCache]: Analyzing trace with hash -635214133, now seen corresponding path program 7 times [2025-03-13 21:49:21,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:21,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435886522] [2025-03-13 21:49:21,056 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:49:21,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:21,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:49:21,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:49:21,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:21,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:21,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:21,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435886522] [2025-03-13 21:49:21,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435886522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:21,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061715726] [2025-03-13 21:49:21,116 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:49:21,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:21,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:21,118 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:21,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-13 21:49:21,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:49:21,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:49:21,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:21,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:21,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:49:21,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:21,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:21,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:21,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061715726] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:21,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:49:21,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-03-13 21:49:21,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557433134] [2025-03-13 21:49:21,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:21,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:49:21,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:21,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:49:21,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-13 21:49:21,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-13 21:49:21,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 573 transitions, 6616 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-03-13 21:49:21,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:21,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-13 21:49:21,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:22,971 INFO L124 PetriNetUnfolderBase]: 8820/13400 cut-off events. [2025-03-13 21:49:22,971 INFO L125 PetriNetUnfolderBase]: For 118742/119140 co-relation queries the response was YES. [2025-03-13 21:49:23,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77511 conditions, 13400 events. 8820/13400 cut-off events. For 118742/119140 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 85127 event pairs, 1705 based on Foata normal form. 283/13663 useless extension candidates. Maximal degree in co-relation 77410. Up to 4033 conditions per place. [2025-03-13 21:49:23,103 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 643 selfloop transitions, 83 changer transitions 0/748 dead transitions. [2025-03-13 21:49:23,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 748 transitions, 10027 flow [2025-03-13 21:49:23,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:49:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:49:23,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2025-03-13 21:49:23,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-03-13 21:49:23,107 INFO L175 Difference]: Start difference. First operand has 222 places, 573 transitions, 6616 flow. Second operand 8 states and 144 transitions. [2025-03-13 21:49:23,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 748 transitions, 10027 flow [2025-03-13 21:49:23,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 748 transitions, 9856 flow, removed 82 selfloop flow, removed 4 redundant places. [2025-03-13 21:49:23,583 INFO L231 Difference]: Finished difference. Result has 227 places, 578 transitions, 6843 flow [2025-03-13 21:49:23,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=6451, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6843, PETRI_PLACES=227, PETRI_TRANSITIONS=578} [2025-03-13 21:49:23,583 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 192 predicate places. [2025-03-13 21:49:23,584 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 578 transitions, 6843 flow [2025-03-13 21:49:23,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-03-13 21:49:23,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:23,584 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-13 21:49:23,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-13 21:49:23,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-13 21:49:23,784 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-03-13 21:49:23,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:23,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2056781167, now seen corresponding path program 8 times [2025-03-13 21:49:23,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:23,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15601603] [2025-03-13 21:49:23,785 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:23,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:23,791 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-13 21:49:23,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:49:23,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:23,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:23,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:23,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:23,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15601603] [2025-03-13 21:49:23,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15601603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:23,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587472100] [2025-03-13 21:49:23,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:23,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:23,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:23,867 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:23,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-13 21:49:23,910 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-13 21:49:23,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:49:23,927 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:23,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:23,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:49:23,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:24,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:24,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:24,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:24,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587472100] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:24,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:24,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-13 21:49:24,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954201284] [2025-03-13 21:49:24,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:24,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-13 21:49:24,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:24,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-13 21:49:24,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:49:24,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-13 21:49:24,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 578 transitions, 6843 flow. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 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-03-13 21:49:24,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:24,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-13 21:49:24,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:27,170 INFO L124 PetriNetUnfolderBase]: 16642/24111 cut-off events. [2025-03-13 21:49:27,171 INFO L125 PetriNetUnfolderBase]: For 215857/215857 co-relation queries the response was YES. [2025-03-13 21:49:27,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137150 conditions, 24111 events. 16642/24111 cut-off events. For 215857/215857 co-relation queries the response was YES. Maximal size of possible extension queue 1092. Compared 149996 event pairs, 2536 based on Foata normal form. 14/24125 useless extension candidates. Maximal degree in co-relation 135050. Up to 6498 conditions per place. [2025-03-13 21:49:27,436 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 1384 selfloop transitions, 377 changer transitions 0/1762 dead transitions. [2025-03-13 21:49:27,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 1762 transitions, 24733 flow [2025-03-13 21:49:27,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-13 21:49:27,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-13 21:49:27,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 261 transitions. [2025-03-13 21:49:27,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41626794258373206 [2025-03-13 21:49:27,441 INFO L175 Difference]: Start difference. First operand has 227 places, 578 transitions, 6843 flow. Second operand 19 states and 261 transitions. [2025-03-13 21:49:27,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 1762 transitions, 24733 flow [2025-03-13 21:49:28,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 1762 transitions, 24585 flow, removed 34 selfloop flow, removed 3 redundant places. [2025-03-13 21:49:28,589 INFO L231 Difference]: Finished difference. Result has 256 places, 840 transitions, 11984 flow [2025-03-13 21:49:28,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=6802, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=11984, PETRI_PLACES=256, PETRI_TRANSITIONS=840} [2025-03-13 21:49:28,590 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 221 predicate places. [2025-03-13 21:49:28,590 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 840 transitions, 11984 flow [2025-03-13 21:49:28,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 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-03-13 21:49:28,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:28,590 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:28,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-13 21:49:28,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:28,791 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-03-13 21:49:28,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:28,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1612780034, now seen corresponding path program 1 times [2025-03-13 21:49:28,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:28,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707940065] [2025-03-13 21:49:28,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:28,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:28,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:49:28,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:49:28,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:28,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:28,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:28,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:28,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707940065] [2025-03-13 21:49:28,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707940065] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:28,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577865902] [2025-03-13 21:49:28,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:28,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:28,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:28,857 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:28,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-13 21:49:28,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:49:28,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:49:28,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:28,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:28,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:49:28,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:28,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:28,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:29,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577865902] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:29,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:29,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-13 21:49:29,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480576872] [2025-03-13 21:49:29,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:29,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:49:29,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:29,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:49:29,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:49:29,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-13 21:49:29,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 840 transitions, 11984 flow. Second operand has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 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-03-13 21:49:29,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:29,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-13 21:49:29,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:31,090 INFO L124 PetriNetUnfolderBase]: 7786/12411 cut-off events. [2025-03-13 21:49:31,091 INFO L125 PetriNetUnfolderBase]: For 181214/181992 co-relation queries the response was YES. [2025-03-13 21:49:31,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86307 conditions, 12411 events. 7786/12411 cut-off events. For 181214/181992 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 84941 event pairs, 2845 based on Foata normal form. 788/13022 useless extension candidates. Maximal degree in co-relation 86186. Up to 5582 conditions per place. [2025-03-13 21:49:31,199 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 692 selfloop transitions, 24 changer transitions 0/818 dead transitions. [2025-03-13 21:49:31,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 818 transitions, 13351 flow [2025-03-13 21:49:31,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:49:31,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:49:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-03-13 21:49:31,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2025-03-13 21:49:31,200 INFO L175 Difference]: Start difference. First operand has 256 places, 840 transitions, 11984 flow. Second operand 6 states and 98 transitions. [2025-03-13 21:49:31,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 818 transitions, 13351 flow [2025-03-13 21:49:32,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 818 transitions, 13045 flow, removed 118 selfloop flow, removed 3 redundant places. [2025-03-13 21:49:32,110 INFO L231 Difference]: Finished difference. Result has 255 places, 686 transitions, 10031 flow [2025-03-13 21:49:32,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=9961, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10031, PETRI_PLACES=255, PETRI_TRANSITIONS=686} [2025-03-13 21:49:32,111 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 220 predicate places. [2025-03-13 21:49:32,111 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 686 transitions, 10031 flow [2025-03-13 21:49:32,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 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-03-13 21:49:32,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:32,111 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-13 21:49:32,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-13 21:49:32,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-13 21:49:32,316 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-03-13 21:49:32,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:32,316 INFO L85 PathProgramCache]: Analyzing trace with hash 727668487, now seen corresponding path program 9 times [2025-03-13 21:49:32,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:32,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181567644] [2025-03-13 21:49:32,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:49:32,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:32,321 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-03-13 21:49:32,328 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:49:32,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:49:32,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:32,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:32,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:32,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181567644] [2025-03-13 21:49:32,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181567644] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:32,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222002414] [2025-03-13 21:49:32,379 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:49:32,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:32,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:32,382 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:32,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-13 21:49:32,423 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-03-13 21:49:32,437 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:49:32,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:49:32,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:32,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:49:32,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:32,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:32,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:32,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222002414] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:32,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:32,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-13 21:49:32,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849214284] [2025-03-13 21:49:32,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:32,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 21:49:32,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:32,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 21:49:32,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-13 21:49:32,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-13 21:49:32,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 686 transitions, 10031 flow. Second operand has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 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-03-13 21:49:32,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:32,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-13 21:49:32,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:34,443 INFO L124 PetriNetUnfolderBase]: 6708/10686 cut-off events. [2025-03-13 21:49:34,443 INFO L125 PetriNetUnfolderBase]: For 157660/157986 co-relation queries the response was YES. [2025-03-13 21:49:34,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74221 conditions, 10686 events. 6708/10686 cut-off events. For 157660/157986 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 70297 event pairs, 2298 based on Foata normal form. 480/11132 useless extension candidates. Maximal degree in co-relation 70971. Up to 5557 conditions per place. [2025-03-13 21:49:34,573 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 532 selfloop transitions, 76 changer transitions 0/666 dead transitions. [2025-03-13 21:49:34,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 666 transitions, 10842 flow [2025-03-13 21:49:34,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:49:34,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:49:34,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2025-03-13 21:49:34,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49783549783549785 [2025-03-13 21:49:34,575 INFO L175 Difference]: Start difference. First operand has 255 places, 686 transitions, 10031 flow. Second operand 7 states and 115 transitions. [2025-03-13 21:49:34,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 666 transitions, 10842 flow [2025-03-13 21:49:35,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 666 transitions, 10705 flow, removed 36 selfloop flow, removed 8 redundant places. [2025-03-13 21:49:35,466 INFO L231 Difference]: Finished difference. Result has 252 places, 591 transitions, 8825 flow [2025-03-13 21:49:35,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=8594, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8825, PETRI_PLACES=252, PETRI_TRANSITIONS=591} [2025-03-13 21:49:35,467 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 217 predicate places. [2025-03-13 21:49:35,467 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 591 transitions, 8825 flow [2025-03-13 21:49:35,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 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-03-13 21:49:35,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:35,467 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-13 21:49:35,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-13 21:49:35,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-13 21:49:35,668 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:35,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:35,668 INFO L85 PathProgramCache]: Analyzing trace with hash 651317553, now seen corresponding path program 10 times [2025-03-13 21:49:35,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:35,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527625794] [2025-03-13 21:49:35,668 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:49:35,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:35,673 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-13 21:49:35,676 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 29 statements. [2025-03-13 21:49:35,676 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 21:49:35,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:35,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:35,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527625794] [2025-03-13 21:49:35,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527625794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:35,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818528832] [2025-03-13 21:49:35,730 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:49:35,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:35,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:35,732 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:35,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-13 21:49:35,776 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-13 21:49:35,786 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 29 statements. [2025-03-13 21:49:35,786 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 21:49:35,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:35,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-13 21:49:35,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:35,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:35,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:35,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818528832] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:35,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:49:35,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 19 [2025-03-13 21:49:35,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006217794] [2025-03-13 21:49:35,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:35,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:49:35,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:35,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:49:35,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-13 21:49:35,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-13 21:49:35,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 591 transitions, 8825 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:35,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:35,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-13 21:49:35,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:37,929 INFO L124 PetriNetUnfolderBase]: 8746/13336 cut-off events. [2025-03-13 21:49:37,929 INFO L125 PetriNetUnfolderBase]: For 164082/164090 co-relation queries the response was YES. [2025-03-13 21:49:38,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88007 conditions, 13336 events. 8746/13336 cut-off events. For 164082/164090 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 83908 event pairs, 780 based on Foata normal form. 40/13375 useless extension candidates. Maximal degree in co-relation 84896. Up to 4049 conditions per place. [2025-03-13 21:49:38,056 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 818 selfloop transitions, 215 changer transitions 17/1052 dead transitions. [2025-03-13 21:49:38,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 1052 transitions, 16786 flow [2025-03-13 21:49:38,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:49:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:49:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 194 transitions. [2025-03-13 21:49:38,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344352617079889 [2025-03-13 21:49:38,057 INFO L175 Difference]: Start difference. First operand has 252 places, 591 transitions, 8825 flow. Second operand 11 states and 194 transitions. [2025-03-13 21:49:38,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 1052 transitions, 16786 flow [2025-03-13 21:49:39,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 1052 transitions, 16625 flow, removed 31 selfloop flow, removed 5 redundant places. [2025-03-13 21:49:39,113 INFO L231 Difference]: Finished difference. Result has 263 places, 662 transitions, 10583 flow [2025-03-13 21:49:39,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=8700, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10583, PETRI_PLACES=263, PETRI_TRANSITIONS=662} [2025-03-13 21:49:39,114 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 228 predicate places. [2025-03-13 21:49:39,114 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 662 transitions, 10583 flow [2025-03-13 21:49:39,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:39,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:39,114 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-13 21:49:39,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-13 21:49:39,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-13 21:49:39,315 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:39,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:39,315 INFO L85 PathProgramCache]: Analyzing trace with hash -816583829, now seen corresponding path program 11 times [2025-03-13 21:49:39,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:39,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41376414] [2025-03-13 21:49:39,315 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:49:39,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:39,319 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 3 equivalence classes. [2025-03-13 21:49:39,324 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:49:39,324 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-13 21:49:39,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:39,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:39,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:39,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41376414] [2025-03-13 21:49:39,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41376414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:39,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758942738] [2025-03-13 21:49:39,367 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:49:39,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:39,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:39,369 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:39,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-13 21:49:39,410 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 3 equivalence classes. [2025-03-13 21:49:39,426 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:49:39,426 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-13 21:49:39,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:39,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:49:39,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:39,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:39,578 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:39,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758942738] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:39,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:39,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-13 21:49:39,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285826379] [2025-03-13 21:49:39,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:39,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 21:49:39,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:39,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 21:49:39,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-13 21:49:39,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-13 21:49:39,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 662 transitions, 10583 flow. Second operand has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 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-03-13 21:49:39,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:39,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-13 21:49:39,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:41,290 INFO L124 PetriNetUnfolderBase]: 6536/10344 cut-off events. [2025-03-13 21:49:41,290 INFO L125 PetriNetUnfolderBase]: For 155327/155525 co-relation queries the response was YES. [2025-03-13 21:49:41,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71805 conditions, 10344 events. 6536/10344 cut-off events. For 155327/155525 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 66460 event pairs, 2541 based on Foata normal form. 448/10743 useless extension candidates. Maximal degree in co-relation 69902. Up to 6599 conditions per place. [2025-03-13 21:49:41,360 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 363 selfloop transitions, 3 changer transitions 259/653 dead transitions. [2025-03-13 21:49:41,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 653 transitions, 11589 flow [2025-03-13 21:49:41,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:49:41,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:49:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2025-03-13 21:49:41,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-03-13 21:49:41,361 INFO L175 Difference]: Start difference. First operand has 263 places, 662 transitions, 10583 flow. Second operand 7 states and 110 transitions. [2025-03-13 21:49:41,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 653 transitions, 11589 flow [2025-03-13 21:49:42,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 653 transitions, 11236 flow, removed 84 selfloop flow, removed 4 redundant places. [2025-03-13 21:49:42,240 INFO L231 Difference]: Finished difference. Result has 266 places, 394 transitions, 5739 flow [2025-03-13 21:49:42,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=9335, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5739, PETRI_PLACES=266, PETRI_TRANSITIONS=394} [2025-03-13 21:49:42,241 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 231 predicate places. [2025-03-13 21:49:42,241 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 394 transitions, 5739 flow [2025-03-13 21:49:42,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 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-03-13 21:49:42,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:42,241 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] [2025-03-13 21:49:42,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-13 21:49:42,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-13 21:49:42,442 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:42,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:42,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1214858339, now seen corresponding path program 12 times [2025-03-13 21:49:42,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:42,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259731389] [2025-03-13 21:49:42,442 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:49:42,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:42,446 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-03-13 21:49:42,451 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:49:42,451 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:49:42,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:42,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:42,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:42,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259731389] [2025-03-13 21:49:42,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259731389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:42,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493354294] [2025-03-13 21:49:42,517 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:49:42,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:42,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:42,519 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:42,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-13 21:49:42,562 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-03-13 21:49:42,578 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:49:42,579 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:49:42,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:42,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:49:42,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:42,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:42,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:42,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493354294] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:42,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:42,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-13 21:49:42,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360055633] [2025-03-13 21:49:42,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:42,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-13 21:49:42,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:42,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-13 21:49:42,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-03-13 21:49:42,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-13 21:49:42,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 394 transitions, 5739 flow. Second operand has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 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-03-13 21:49:42,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:42,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-13 21:49:42,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:45,919 INFO L124 PetriNetUnfolderBase]: 15700/22888 cut-off events. [2025-03-13 21:49:45,919 INFO L125 PetriNetUnfolderBase]: For 339420/340153 co-relation queries the response was YES. [2025-03-13 21:49:46,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159450 conditions, 22888 events. 15700/22888 cut-off events. For 339420/340153 co-relation queries the response was YES. Maximal size of possible extension queue 752. Compared 138828 event pairs, 856 based on Foata normal form. 515/23390 useless extension candidates. Maximal degree in co-relation 159369. Up to 8504 conditions per place. [2025-03-13 21:49:46,162 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 879 selfloop transitions, 306 changer transitions 0/1212 dead transitions. [2025-03-13 21:49:46,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 1212 transitions, 18772 flow [2025-03-13 21:49:46,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-13 21:49:46,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-13 21:49:46,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 573 transitions. [2025-03-13 21:49:46,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4692874692874693 [2025-03-13 21:49:46,163 INFO L175 Difference]: Start difference. First operand has 266 places, 394 transitions, 5739 flow. Second operand 37 states and 573 transitions. [2025-03-13 21:49:46,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 1212 transitions, 18772 flow [2025-03-13 21:49:47,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 1212 transitions, 17219 flow, removed 317 selfloop flow, removed 27 redundant places. [2025-03-13 21:49:47,728 INFO L231 Difference]: Finished difference. Result has 239 places, 576 transitions, 8653 flow [2025-03-13 21:49:47,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=5200, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=8653, PETRI_PLACES=239, PETRI_TRANSITIONS=576} [2025-03-13 21:49:47,729 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 204 predicate places. [2025-03-13 21:49:47,729 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 576 transitions, 8653 flow [2025-03-13 21:49:47,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 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-03-13 21:49:47,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:47,729 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] [2025-03-13 21:49:47,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-13 21:49:47,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:47,930 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:47,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:47,930 INFO L85 PathProgramCache]: Analyzing trace with hash -2128219363, now seen corresponding path program 13 times [2025-03-13 21:49:47,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:47,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70832075] [2025-03-13 21:49:47,930 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:49:47,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:47,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 21:49:47,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:49:47,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:47,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:48,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:48,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70832075] [2025-03-13 21:49:48,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70832075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:48,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337977520] [2025-03-13 21:49:48,005 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:49:48,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:48,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:48,007 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:48,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-13 21:49:48,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 21:49:48,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:49:48,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:48,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:48,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:49:48,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:48,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:48,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:48,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337977520] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:48,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:49:48,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 18 [2025-03-13 21:49:48,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078884534] [2025-03-13 21:49:48,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:48,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:49:48,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:48,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:49:48,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-03-13 21:49:48,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-13 21:49:48,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 576 transitions, 8653 flow. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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-03-13 21:49:48,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:48,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-13 21:49:48,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:51,987 INFO L124 PetriNetUnfolderBase]: 17235/25133 cut-off events. [2025-03-13 21:49:51,987 INFO L125 PetriNetUnfolderBase]: For 397192/397933 co-relation queries the response was YES. [2025-03-13 21:49:52,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185708 conditions, 25133 events. 17235/25133 cut-off events. For 397192/397933 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 155420 event pairs, 1715 based on Foata normal form. 612/25725 useless extension candidates. Maximal degree in co-relation 185627. Up to 9823 conditions per place. [2025-03-13 21:49:52,438 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 535 selfloop transitions, 328 changer transitions 0/890 dead transitions. [2025-03-13 21:49:52,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 890 transitions, 14348 flow [2025-03-13 21:49:52,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-13 21:49:52,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-13 21:49:52,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 195 transitions. [2025-03-13 21:49:52,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-03-13 21:49:52,439 INFO L175 Difference]: Start difference. First operand has 239 places, 576 transitions, 8653 flow. Second operand 13 states and 195 transitions. [2025-03-13 21:49:52,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 890 transitions, 14348 flow [2025-03-13 21:49:55,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 890 transitions, 13799 flow, removed 271 selfloop flow, removed 4 redundant places. [2025-03-13 21:49:55,056 INFO L231 Difference]: Finished difference. Result has 252 places, 629 transitions, 10367 flow [2025-03-13 21:49:55,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=8244, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=276, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=10367, PETRI_PLACES=252, PETRI_TRANSITIONS=629} [2025-03-13 21:49:55,057 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 217 predicate places. [2025-03-13 21:49:55,057 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 629 transitions, 10367 flow [2025-03-13 21:49:55,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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-03-13 21:49:55,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:55,057 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] [2025-03-13 21:49:55,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-13 21:49:55,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-13 21:49:55,258 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:55,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:55,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2122763785, now seen corresponding path program 14 times [2025-03-13 21:49:55,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:55,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249257664] [2025-03-13 21:49:55,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:55,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:55,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-13 21:49:55,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:49:55,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:55,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:55,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:55,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:55,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249257664] [2025-03-13 21:49:55,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249257664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:55,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55879857] [2025-03-13 21:49:55,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:55,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:55,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:55,329 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:55,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-13 21:49:55,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-13 21:49:55,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:49:55,387 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:55,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:55,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:49:55,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:55,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:55,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:55,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55879857] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:55,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:55,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-13 21:49:55,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949045415] [2025-03-13 21:49:55,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:55,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-13 21:49:55,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:55,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-13 21:49:55,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-03-13 21:49:55,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-13 21:49:55,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 629 transitions, 10367 flow. Second operand has 20 states, 20 states have (on average 7.35) internal successors, (147), 20 states have internal predecessors, (147), 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-03-13 21:49:55,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:55,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-13 21:49:55,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:00,461 INFO L124 PetriNetUnfolderBase]: 19845/28965 cut-off events. [2025-03-13 21:50:00,462 INFO L125 PetriNetUnfolderBase]: For 431429/432312 co-relation queries the response was YES. [2025-03-13 21:50:00,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214142 conditions, 28965 events. 19845/28965 cut-off events. For 431429/432312 co-relation queries the response was YES. Maximal size of possible extension queue 1002. Compared 183545 event pairs, 1690 based on Foata normal form. 672/29611 useless extension candidates. Maximal degree in co-relation 214056. Up to 11500 conditions per place. [2025-03-13 21:50:00,851 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 836 selfloop transitions, 411 changer transitions 0/1274 dead transitions. [2025-03-13 21:50:00,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 1274 transitions, 20643 flow [2025-03-13 21:50:00,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-13 21:50:00,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-13 21:50:00,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 406 transitions. [2025-03-13 21:50:00,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4556677890011223 [2025-03-13 21:50:00,852 INFO L175 Difference]: Start difference. First operand has 252 places, 629 transitions, 10367 flow. Second operand 27 states and 406 transitions. [2025-03-13 21:50:00,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 1274 transitions, 20643 flow [2025-03-13 21:50:05,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 1274 transitions, 19982 flow, removed 82 selfloop flow, removed 6 redundant places. [2025-03-13 21:50:05,988 INFO L231 Difference]: Finished difference. Result has 277 places, 707 transitions, 12212 flow [2025-03-13 21:50:05,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=9809, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=342, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=12212, PETRI_PLACES=277, PETRI_TRANSITIONS=707} [2025-03-13 21:50:05,989 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 242 predicate places. [2025-03-13 21:50:05,989 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 707 transitions, 12212 flow [2025-03-13 21:50:05,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.35) internal successors, (147), 20 states have internal predecessors, (147), 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-03-13 21:50:05,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:05,989 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] [2025-03-13 21:50:05,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-13 21:50:06,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:06,190 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:50:06,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:06,190 INFO L85 PathProgramCache]: Analyzing trace with hash 2122241321, now seen corresponding path program 15 times [2025-03-13 21:50:06,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:06,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264291803] [2025-03-13 21:50:06,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:50:06,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:06,194 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-03-13 21:50:06,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:50:06,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:50:06,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:50:06,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:06,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264291803] [2025-03-13 21:50:06,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264291803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:06,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510059399] [2025-03-13 21:50:06,256 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:50:06,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:06,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:06,258 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:06,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-13 21:50:06,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-03-13 21:50:06,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:50:06,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:50:06,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:06,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:50:06,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:50:06,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:06,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:50:06,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510059399] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:06,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:06,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-03-13 21:50:06,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324657917] [2025-03-13 21:50:06,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:06,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-13 21:50:06,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:06,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-13 21:50:06,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2025-03-13 21:50:06,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-13 21:50:06,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 707 transitions, 12212 flow. Second operand has 21 states, 21 states have (on average 7.142857142857143) internal successors, (150), 21 states have internal predecessors, (150), 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-03-13 21:50:06,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:06,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-13 21:50:06,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:11,837 INFO L124 PetriNetUnfolderBase]: 21885/31907 cut-off events. [2025-03-13 21:50:11,837 INFO L125 PetriNetUnfolderBase]: For 484694/485652 co-relation queries the response was YES. [2025-03-13 21:50:12,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238672 conditions, 31907 events. 21885/31907 cut-off events. For 484694/485652 co-relation queries the response was YES. Maximal size of possible extension queue 1088. Compared 204441 event pairs, 2777 based on Foata normal form. 761/32649 useless extension candidates. Maximal degree in co-relation 238582. Up to 12954 conditions per place. [2025-03-13 21:50:12,284 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 803 selfloop transitions, 376 changer transitions 0/1206 dead transitions. [2025-03-13 21:50:12,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 1206 transitions, 21366 flow [2025-03-13 21:50:12,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-13 21:50:12,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-13 21:50:12,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 278 transitions. [2025-03-13 21:50:12,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4433811802232855 [2025-03-13 21:50:12,285 INFO L175 Difference]: Start difference. First operand has 277 places, 707 transitions, 12212 flow. Second operand 19 states and 278 transitions. [2025-03-13 21:50:12,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 1206 transitions, 21366 flow [2025-03-13 21:50:17,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 1206 transitions, 21099 flow, removed 69 selfloop flow, removed 7 redundant places. [2025-03-13 21:50:17,351 INFO L231 Difference]: Finished difference. Result has 293 places, 779 transitions, 14966 flow [2025-03-13 21:50:17,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=11966, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=706, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=305, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=14966, PETRI_PLACES=293, PETRI_TRANSITIONS=779} [2025-03-13 21:50:17,352 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 258 predicate places. [2025-03-13 21:50:17,352 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 779 transitions, 14966 flow [2025-03-13 21:50:17,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.142857142857143) internal successors, (150), 21 states have internal predecessors, (150), 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-03-13 21:50:17,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:17,352 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] [2025-03-13 21:50:17,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-13 21:50:17,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:17,553 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:50:17,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:17,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1019425511, now seen corresponding path program 16 times [2025-03-13 21:50:17,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:17,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799211644] [2025-03-13 21:50:17,553 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:50:17,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:17,557 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-13 21:50:17,558 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 30 statements. [2025-03-13 21:50:17,558 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 21:50:17,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:17,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:50:17,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:17,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799211644] [2025-03-13 21:50:17,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799211644] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:17,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861511524] [2025-03-13 21:50:17,601 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:50:17,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:17,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:17,603 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:17,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-13 21:50:17,650 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-13 21:50:17,660 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 30 statements. [2025-03-13 21:50:17,660 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 21:50:17,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:17,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:50:17,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:50:17,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:50:17,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861511524] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:17,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:17,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-13 21:50:17,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352333409] [2025-03-13 21:50:17,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:17,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 21:50:17,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:17,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 21:50:17,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:50:17,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-13 21:50:17,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 779 transitions, 14966 flow. Second operand has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 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-03-13 21:50:17,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:17,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-13 21:50:17,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:25,454 INFO L124 PetriNetUnfolderBase]: 29198/41450 cut-off events. [2025-03-13 21:50:25,455 INFO L125 PetriNetUnfolderBase]: For 756103/756103 co-relation queries the response was YES.