./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:15:54,786 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:15:54,840 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:15:54,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:15:54,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:15:54,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:15:54,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:15:54,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:15:54,862 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:15:54,862 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:15:54,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:15:54,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:15:54,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:15:54,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:15:54,863 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:15:54,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:15:54,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:15:54,863 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:15:54,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:15:54,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:15:54,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:15:54,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:15:54,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:15:54,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:15:54,863 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:15:54,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:15:54,863 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:15:54,864 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:15:54,864 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:15:54,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:15:54,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:15:54,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:15:54,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:15:54,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:15:54,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:15:54,864 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:15:54,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:15:54,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:15:54,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:15:54,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:15:54,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:15:54,864 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:15:54,864 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:15:54,864 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 [2025-02-08 01:15:55,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:15:55,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:15:55,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:15:55,073 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:15:55,073 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:15:55,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2025-02-08 01:15:56,144 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c68e8d9ee/570f5553e4074dcdac5fdae3b89ba3a6/FLAG2c4e5d8a7 [2025-02-08 01:15:56,359 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:15:56,364 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2025-02-08 01:15:56,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c68e8d9ee/570f5553e4074dcdac5fdae3b89ba3a6/FLAG2c4e5d8a7 [2025-02-08 01:15:56,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c68e8d9ee/570f5553e4074dcdac5fdae3b89ba3a6 [2025-02-08 01:15:56,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:15:56,695 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:15:56,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:15:56,696 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:15:56,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:15:56,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:15:56" (1/1) ... [2025-02-08 01:15:56,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1facb3f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:56, skipping insertion in model container [2025-02-08 01:15:56,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:15:56" (1/1) ... [2025-02-08 01:15:56,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:15:56,831 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c[2554,2567] [2025-02-08 01:15:56,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:15:56,844 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:15:56,861 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c[2554,2567] [2025-02-08 01:15:56,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:15:56,874 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:15:56,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:56 WrapperNode [2025-02-08 01:15:56,875 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:15:56,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:15:56,876 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:15:56,876 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:15:56,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:56" (1/1) ... [2025-02-08 01:15:56,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:56" (1/1) ... [2025-02-08 01:15:56,899 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2025-02-08 01:15:56,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:15:56,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:15:56,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:15:56,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:15:56,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:56" (1/1) ... [2025-02-08 01:15:56,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:56" (1/1) ... [2025-02-08 01:15:56,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:56" (1/1) ... [2025-02-08 01:15:56,924 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 01:15:56,925 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:56" (1/1) ... [2025-02-08 01:15:56,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:56" (1/1) ... [2025-02-08 01:15:56,930 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:56" (1/1) ... [2025-02-08 01:15:56,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:56" (1/1) ... [2025-02-08 01:15:56,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:56" (1/1) ... [2025-02-08 01:15:56,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:56" (1/1) ... [2025-02-08 01:15:56,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:15:56,935 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:15:56,936 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:15:56,937 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:15:56,938 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:56" (1/1) ... [2025-02-08 01:15:56,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:15:56,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:15:56,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:15:56,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:15:56,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:15:56,995 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:15:56,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:15:56,995 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:15:56,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:15:56,995 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 01:15:56,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 01:15:56,995 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 01:15:56,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 01:15:56,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:15:56,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:15:56,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:15:56,996 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:15:57,079 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:15:57,080 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:15:57,275 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:15:57,276 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:15:57,403 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:15:57,403 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:15:57,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:15:57 BoogieIcfgContainer [2025-02-08 01:15:57,404 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:15:57,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:15:57,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:15:57,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:15:57,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:15:56" (1/3) ... [2025-02-08 01:15:57,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@890b2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:15:57, skipping insertion in model container [2025-02-08 01:15:57,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:56" (2/3) ... [2025-02-08 01:15:57,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@890b2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:15:57, skipping insertion in model container [2025-02-08 01:15:57,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:15:57" (3/3) ... [2025-02-08 01:15:57,412 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2025-02-08 01:15:57,422 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:15:57,423 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-4.wvr.c that has 5 procedures, 57 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-08 01:15:57,423 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:15:57,478 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 01:15:57,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 59 transitions, 146 flow [2025-02-08 01:15:57,546 INFO L124 PetriNetUnfolderBase]: 3/55 cut-off events. [2025-02-08 01:15:57,549 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 01:15:57,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 55 events. 3/55 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 100 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2025-02-08 01:15:57,552 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 59 transitions, 146 flow [2025-02-08 01:15:57,555 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 54 transitions, 132 flow [2025-02-08 01:15:57,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:15:57,573 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;@71dbbaac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:15:57,575 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 01:15:57,595 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:15:57,597 INFO L124 PetriNetUnfolderBase]: 3/53 cut-off events. [2025-02-08 01:15:57,597 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 01:15:57,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:57,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:57,598 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 2 more)] === [2025-02-08 01:15:57,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:57,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1298405920, now seen corresponding path program 1 times [2025-02-08 01:15:57,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:57,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834604503] [2025-02-08 01:15:57,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:15:57,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:57,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 01:15:57,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 01:15:57,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:15:57,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:57,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:57,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:57,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834604503] [2025-02-08 01:15:57,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834604503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:57,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:57,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:15:57,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818847492] [2025-02-08 01:15:57,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:57,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:15:57,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:57,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:15:57,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:15:57,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-02-08 01:15:58,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:15:58,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:58,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-02-08 01:15:58,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:59,610 INFO L124 PetriNetUnfolderBase]: 17631/24183 cut-off events. [2025-02-08 01:15:59,610 INFO L125 PetriNetUnfolderBase]: For 1375/1375 co-relation queries the response was YES. [2025-02-08 01:15:59,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48712 conditions, 24183 events. 17631/24183 cut-off events. For 1375/1375 co-relation queries the response was YES. Maximal size of possible extension queue 936. Compared 140414 event pairs, 6173 based on Foata normal form. 1/23393 useless extension candidates. Maximal degree in co-relation 45421. Up to 14774 conditions per place. [2025-02-08 01:15:59,746 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 66 selfloop transitions, 6 changer transitions 1/84 dead transitions. [2025-02-08 01:15:59,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 84 transitions, 356 flow [2025-02-08 01:15:59,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:15:59,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:15:59,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2025-02-08 01:15:59,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.672316384180791 [2025-02-08 01:15:59,760 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 132 flow. Second operand 3 states and 119 transitions. [2025-02-08 01:15:59,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 84 transitions, 356 flow [2025-02-08 01:15:59,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 328 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 01:15:59,788 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 148 flow [2025-02-08 01:15:59,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2025-02-08 01:15:59,793 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -5 predicate places. [2025-02-08 01:15:59,794 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 148 flow [2025-02-08 01:15:59,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:15:59,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:59,795 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:59,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:15:59,795 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 2 more)] === [2025-02-08 01:15:59,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:59,796 INFO L85 PathProgramCache]: Analyzing trace with hash -850907849, now seen corresponding path program 1 times [2025-02-08 01:15:59,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:59,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527417331] [2025-02-08 01:15:59,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:15:59,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:59,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 01:15:59,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 01:15:59,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:15:59,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:59,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:59,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527417331] [2025-02-08 01:15:59,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527417331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:59,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:59,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:15:59,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46136795] [2025-02-08 01:15:59,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:59,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:15:59,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:59,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:15:59,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:15:59,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 59 [2025-02-08 01:15:59,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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-02-08 01:15:59,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:59,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 59 [2025-02-08 01:15:59,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:01,668 INFO L124 PetriNetUnfolderBase]: 24981/33971 cut-off events. [2025-02-08 01:16:01,668 INFO L125 PetriNetUnfolderBase]: For 2745/2745 co-relation queries the response was YES. [2025-02-08 01:16:01,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72790 conditions, 33971 events. 24981/33971 cut-off events. For 2745/2745 co-relation queries the response was YES. Maximal size of possible extension queue 1153. Compared 196152 event pairs, 17656 based on Foata normal form. 0/33394 useless extension candidates. Maximal degree in co-relation 41625. Up to 29158 conditions per place. [2025-02-08 01:16:01,789 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 73 selfloop transitions, 8 changer transitions 0/86 dead transitions. [2025-02-08 01:16:01,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 86 transitions, 386 flow [2025-02-08 01:16:01,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:16:01,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:16:01,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-02-08 01:16:01,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5932203389830508 [2025-02-08 01:16:01,791 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 148 flow. Second operand 3 states and 105 transitions. [2025-02-08 01:16:01,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 86 transitions, 386 flow [2025-02-08 01:16:01,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 86 transitions, 377 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:16:01,797 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 196 flow [2025-02-08 01:16:01,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=62, PETRI_TRANSITIONS=61} [2025-02-08 01:16:01,797 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -2 predicate places. [2025-02-08 01:16:01,798 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 196 flow [2025-02-08 01:16:01,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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-02-08 01:16:01,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:01,798 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:01,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:16:01,798 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 2 more)] === [2025-02-08 01:16:01,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:01,799 INFO L85 PathProgramCache]: Analyzing trace with hash 573023741, now seen corresponding path program 1 times [2025-02-08 01:16:01,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:01,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051310589] [2025-02-08 01:16:01,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:16:01,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:01,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 01:16:01,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 01:16:01,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:01,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:16:01,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:01,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051310589] [2025-02-08 01:16:01,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051310589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:01,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:01,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:16:01,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147282879] [2025-02-08 01:16:01,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:01,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:16:01,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:01,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:16:01,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:16:01,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-02-08 01:16:01,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:01,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:01,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-02-08 01:16:01,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:04,458 INFO L124 PetriNetUnfolderBase]: 38556/55598 cut-off events. [2025-02-08 01:16:04,458 INFO L125 PetriNetUnfolderBase]: For 17732/17746 co-relation queries the response was YES. [2025-02-08 01:16:04,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126400 conditions, 55598 events. 38556/55598 cut-off events. For 17732/17746 co-relation queries the response was YES. Maximal size of possible extension queue 2451. Compared 394114 event pairs, 7852 based on Foata normal form. 398/54491 useless extension candidates. Maximal degree in co-relation 67771. Up to 19624 conditions per place. [2025-02-08 01:16:04,680 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 140 selfloop transitions, 27 changer transitions 3/184 dead transitions. [2025-02-08 01:16:04,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 184 transitions, 885 flow [2025-02-08 01:16:04,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:16:04,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:16:04,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 242 transitions. [2025-02-08 01:16:04,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6836158192090396 [2025-02-08 01:16:04,684 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 196 flow. Second operand 6 states and 242 transitions. [2025-02-08 01:16:04,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 184 transitions, 885 flow [2025-02-08 01:16:04,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 184 transitions, 853 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:16:04,778 INFO L231 Difference]: Finished difference. Result has 68 places, 85 transitions, 344 flow [2025-02-08 01:16:04,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=344, PETRI_PLACES=68, PETRI_TRANSITIONS=85} [2025-02-08 01:16:04,780 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 4 predicate places. [2025-02-08 01:16:04,780 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 85 transitions, 344 flow [2025-02-08 01:16:04,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:04,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:04,781 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:04,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:16:04,781 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 2 more)] === [2025-02-08 01:16:04,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:04,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1906599287, now seen corresponding path program 2 times [2025-02-08 01:16:04,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:04,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418506832] [2025-02-08 01:16:04,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:16:04,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:04,794 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-02-08 01:16:04,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 01:16:04,813 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:16:04,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:16:05,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:05,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418506832] [2025-02-08 01:16:05,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418506832] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:05,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:05,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:16:05,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858814400] [2025-02-08 01:16:05,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:05,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:16:05,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:05,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:16:05,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:16:05,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-02-08 01:16:05,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 85 transitions, 344 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:05,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:05,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-02-08 01:16:05,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:07,826 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([408] L45-1-->L46-3: Formula: (= v_~x~0_12 0) InVars {} OutVars{~x~0=v_~x~0_12} AuxVars[] AssignedVars[~x~0][80], [Black: 76#true, 8#L100-1true, 35#L66-3true, Black: 83#(<= ~s~0 ~t~0), 11#thread4EXITtrue, 56#L46-3true, 84#(<= (+ ~s~0 1) ~t~0), Black: 88#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ 2 ~s~0) |thread3Thread1of1ForFork0_#t~post5#1|)), 58#L56-3true, Black: 74#(= (mod ~b~0 256) 0), 94#(<= ~s~0 ~t~0)]) [2025-02-08 01:16:07,827 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-02-08 01:16:07,827 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-02-08 01:16:07,827 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-02-08 01:16:07,827 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-02-08 01:16:07,828 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L56-3-->L56: Formula: (and (= (+ |v_thread2Thread1of1ForFork1_#t~post4#1_1| 1) v_~s~0_28) (= v_~s~0_29 |v_thread2Thread1of1ForFork1_#t~post4#1_1|)) InVars {~s~0=v_~s~0_29} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|, ~s~0=v_~s~0_28} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, ~s~0][78], [Black: 76#true, 9#L45-1true, 8#L100-1true, 83#(<= ~s~0 ~t~0), 35#L66-3true, 12#L56true, 11#thread4EXITtrue, Black: 88#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ 2 ~s~0) |thread3Thread1of1ForFork0_#t~post5#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 84#(<= (+ ~s~0 1) ~t~0), 92#true]) [2025-02-08 01:16:07,828 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-02-08 01:16:07,828 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-02-08 01:16:07,828 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-02-08 01:16:07,828 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-02-08 01:16:08,100 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([408] L45-1-->L46-3: Formula: (= v_~x~0_12 0) InVars {} OutVars{~x~0=v_~x~0_12} AuxVars[] AssignedVars[~x~0][80], [Black: 76#true, 35#L66-3true, Black: 83#(<= ~s~0 ~t~0), 11#thread4EXITtrue, 84#(<= (+ ~s~0 1) ~t~0), 46#L101true, 56#L46-3true, Black: 88#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ 2 ~s~0) |thread3Thread1of1ForFork0_#t~post5#1|)), Black: 74#(= (mod ~b~0 256) 0), 58#L56-3true, 94#(<= ~s~0 ~t~0)]) [2025-02-08 01:16:08,100 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-02-08 01:16:08,101 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-02-08 01:16:08,101 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-02-08 01:16:08,101 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-02-08 01:16:08,101 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L56-3-->L56: Formula: (and (= (+ |v_thread2Thread1of1ForFork1_#t~post4#1_1| 1) v_~s~0_28) (= v_~s~0_29 |v_thread2Thread1of1ForFork1_#t~post4#1_1|)) InVars {~s~0=v_~s~0_29} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|, ~s~0=v_~s~0_28} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, ~s~0][78], [Black: 76#true, 9#L45-1true, 83#(<= ~s~0 ~t~0), 35#L66-3true, 12#L56true, 11#thread4EXITtrue, 46#L101true, Black: 88#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ 2 ~s~0) |thread3Thread1of1ForFork0_#t~post5#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 84#(<= (+ ~s~0 1) ~t~0), 92#true]) [2025-02-08 01:16:08,101 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-02-08 01:16:08,101 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-02-08 01:16:08,101 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-02-08 01:16:08,101 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-02-08 01:16:08,737 INFO L124 PetriNetUnfolderBase]: 50168/73145 cut-off events. [2025-02-08 01:16:08,737 INFO L125 PetriNetUnfolderBase]: For 53244/53350 co-relation queries the response was YES. [2025-02-08 01:16:08,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195862 conditions, 73145 events. 50168/73145 cut-off events. For 53244/53350 co-relation queries the response was YES. Maximal size of possible extension queue 3207. Compared 547188 event pairs, 12329 based on Foata normal form. 642/71704 useless extension candidates. Maximal degree in co-relation 111792. Up to 27673 conditions per place. [2025-02-08 01:16:09,258 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 138 selfloop transitions, 32 changer transitions 5/189 dead transitions. [2025-02-08 01:16:09,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 189 transitions, 1096 flow [2025-02-08 01:16:09,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:16:09,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:16:09,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 199 transitions. [2025-02-08 01:16:09,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6745762711864407 [2025-02-08 01:16:09,261 INFO L175 Difference]: Start difference. First operand has 68 places, 85 transitions, 344 flow. Second operand 5 states and 199 transitions. [2025-02-08 01:16:09,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 189 transitions, 1096 flow [2025-02-08 01:16:09,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 189 transitions, 1096 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:16:09,360 INFO L231 Difference]: Finished difference. Result has 75 places, 111 transitions, 647 flow [2025-02-08 01:16:09,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=647, PETRI_PLACES=75, PETRI_TRANSITIONS=111} [2025-02-08 01:16:09,362 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places. [2025-02-08 01:16:09,362 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 111 transitions, 647 flow [2025-02-08 01:16:09,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:09,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:09,363 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:09,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:16:09,363 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 2 more)] === [2025-02-08 01:16:09,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:09,363 INFO L85 PathProgramCache]: Analyzing trace with hash 883178159, now seen corresponding path program 3 times [2025-02-08 01:16:09,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:09,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120729285] [2025-02-08 01:16:09,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:16:09,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:09,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 1 equivalence classes. [2025-02-08 01:16:09,401 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 01:16:09,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:16:09,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:09,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:16:09,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:09,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120729285] [2025-02-08 01:16:09,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120729285] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:09,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:09,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:16:09,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635964877] [2025-02-08 01:16:09,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:09,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:16:09,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:09,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:16:09,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:16:09,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-02-08 01:16:09,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 111 transitions, 647 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:09,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:09,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-02-08 01:16:09,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:13,517 INFO L124 PetriNetUnfolderBase]: 47912/69481 cut-off events. [2025-02-08 01:16:13,517 INFO L125 PetriNetUnfolderBase]: For 112869/113087 co-relation queries the response was YES. [2025-02-08 01:16:13,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217341 conditions, 69481 events. 47912/69481 cut-off events. For 112869/113087 co-relation queries the response was YES. Maximal size of possible extension queue 3111. Compared 514968 event pairs, 9200 based on Foata normal form. 801/68047 useless extension candidates. Maximal degree in co-relation 123971. Up to 27579 conditions per place. [2025-02-08 01:16:13,902 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 139 selfloop transitions, 59 changer transitions 4/216 dead transitions. [2025-02-08 01:16:13,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 216 transitions, 1433 flow [2025-02-08 01:16:13,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:16:13,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:16:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 241 transitions. [2025-02-08 01:16:13,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6807909604519774 [2025-02-08 01:16:13,904 INFO L175 Difference]: Start difference. First operand has 75 places, 111 transitions, 647 flow. Second operand 6 states and 241 transitions. [2025-02-08 01:16:13,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 216 transitions, 1433 flow [2025-02-08 01:16:13,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 216 transitions, 1433 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:16:13,960 INFO L231 Difference]: Finished difference. Result has 81 places, 118 transitions, 844 flow [2025-02-08 01:16:13,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=844, PETRI_PLACES=81, PETRI_TRANSITIONS=118} [2025-02-08 01:16:13,961 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 17 predicate places. [2025-02-08 01:16:13,962 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 118 transitions, 844 flow [2025-02-08 01:16:13,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:13,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:13,962 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:13,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:16:13,963 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 2 more)] === [2025-02-08 01:16:13,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:13,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2010432989, now seen corresponding path program 4 times [2025-02-08 01:16:13,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:13,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467995053] [2025-02-08 01:16:13,965 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:16:13,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:13,979 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-02-08 01:16:13,997 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 01:16:13,998 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:16:13,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:14,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:16:14,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:14,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467995053] [2025-02-08 01:16:14,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467995053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:14,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:14,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:16:14,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945983025] [2025-02-08 01:16:14,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:14,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:16:14,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:14,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:16:14,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:16:14,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-02-08 01:16:14,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 118 transitions, 844 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:14,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:14,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-02-08 01:16:14,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:17,967 INFO L124 PetriNetUnfolderBase]: 47048/68956 cut-off events. [2025-02-08 01:16:17,968 INFO L125 PetriNetUnfolderBase]: For 177131/177345 co-relation queries the response was YES. [2025-02-08 01:16:18,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234781 conditions, 68956 events. 47048/68956 cut-off events. For 177131/177345 co-relation queries the response was YES. Maximal size of possible extension queue 3086. Compared 517359 event pairs, 11148 based on Foata normal form. 558/67647 useless extension candidates. Maximal degree in co-relation 136193. Up to 27762 conditions per place. [2025-02-08 01:16:18,339 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 142 selfloop transitions, 42 changer transitions 1/199 dead transitions. [2025-02-08 01:16:18,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 199 transitions, 1549 flow [2025-02-08 01:16:18,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:16:18,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:16:18,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 198 transitions. [2025-02-08 01:16:18,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6711864406779661 [2025-02-08 01:16:18,341 INFO L175 Difference]: Start difference. First operand has 81 places, 118 transitions, 844 flow. Second operand 5 states and 198 transitions. [2025-02-08 01:16:18,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 199 transitions, 1549 flow [2025-02-08 01:16:18,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 199 transitions, 1439 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-08 01:16:18,627 INFO L231 Difference]: Finished difference. Result has 83 places, 124 transitions, 934 flow [2025-02-08 01:16:18,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=934, PETRI_PLACES=83, PETRI_TRANSITIONS=124} [2025-02-08 01:16:18,629 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 19 predicate places. [2025-02-08 01:16:18,629 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 124 transitions, 934 flow [2025-02-08 01:16:18,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:18,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:18,630 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:18,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:16:18,630 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 2 more)] === [2025-02-08 01:16:18,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:18,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1997827613, now seen corresponding path program 2 times [2025-02-08 01:16:18,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:18,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607162103] [2025-02-08 01:16:18,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:16:18,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:18,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-02-08 01:16:18,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 01:16:18,648 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:16:18,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:18,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:16:18,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:18,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607162103] [2025-02-08 01:16:18,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607162103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:18,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:18,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:16:18,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543565669] [2025-02-08 01:16:18,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:18,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:16:18,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:18,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:16:18,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:16:18,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-02-08 01:16:18,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 124 transitions, 934 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:18,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:18,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-02-08 01:16:18,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:22,681 INFO L124 PetriNetUnfolderBase]: 44544/65995 cut-off events. [2025-02-08 01:16:22,681 INFO L125 PetriNetUnfolderBase]: For 186287/186439 co-relation queries the response was YES. [2025-02-08 01:16:22,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224645 conditions, 65995 events. 44544/65995 cut-off events. For 186287/186439 co-relation queries the response was YES. Maximal size of possible extension queue 3042. Compared 503387 event pairs, 11024 based on Foata normal form. 748/65092 useless extension candidates. Maximal degree in co-relation 132224. Up to 27059 conditions per place. [2025-02-08 01:16:23,149 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 139 selfloop transitions, 52 changer transitions 8/213 dead transitions. [2025-02-08 01:16:23,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 213 transitions, 1778 flow [2025-02-08 01:16:23,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:16:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:16:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2025-02-08 01:16:23,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6779661016949152 [2025-02-08 01:16:23,153 INFO L175 Difference]: Start difference. First operand has 83 places, 124 transitions, 934 flow. Second operand 5 states and 200 transitions. [2025-02-08 01:16:23,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 213 transitions, 1778 flow [2025-02-08 01:16:23,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 213 transitions, 1698 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-02-08 01:16:23,260 INFO L231 Difference]: Finished difference. Result has 86 places, 136 transitions, 1170 flow [2025-02-08 01:16:23,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1170, PETRI_PLACES=86, PETRI_TRANSITIONS=136} [2025-02-08 01:16:23,261 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 22 predicate places. [2025-02-08 01:16:23,261 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 136 transitions, 1170 flow [2025-02-08 01:16:23,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:23,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:23,262 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:23,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:16:23,263 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 2 more)] === [2025-02-08 01:16:23,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:23,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1736562193, now seen corresponding path program 5 times [2025-02-08 01:16:23,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:23,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287906330] [2025-02-08 01:16:23,263 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:16:23,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:23,282 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-02-08 01:16:23,292 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 01:16:23,296 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:16:23,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:16:23,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:23,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287906330] [2025-02-08 01:16:23,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287906330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:23,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:23,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:16:23,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588174884] [2025-02-08 01:16:23,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:23,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:16:23,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:23,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:16:23,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:16:23,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-02-08 01:16:23,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 136 transitions, 1170 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:23,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:23,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-02-08 01:16:23,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:26,095 INFO L124 PetriNetUnfolderBase]: 30183/44575 cut-off events. [2025-02-08 01:16:26,095 INFO L125 PetriNetUnfolderBase]: For 134167/134259 co-relation queries the response was YES. [2025-02-08 01:16:26,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153129 conditions, 44575 events. 30183/44575 cut-off events. For 134167/134259 co-relation queries the response was YES. Maximal size of possible extension queue 2015. Compared 318457 event pairs, 7907 based on Foata normal form. 392/43917 useless extension candidates. Maximal degree in co-relation 105632. Up to 21727 conditions per place. [2025-02-08 01:16:26,362 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 129 selfloop transitions, 60 changer transitions 8/211 dead transitions. [2025-02-08 01:16:26,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 211 transitions, 1943 flow [2025-02-08 01:16:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:16:26,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:16:26,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2025-02-08 01:16:26,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6542372881355932 [2025-02-08 01:16:26,365 INFO L175 Difference]: Start difference. First operand has 86 places, 136 transitions, 1170 flow. Second operand 5 states and 193 transitions. [2025-02-08 01:16:26,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 211 transitions, 1943 flow [2025-02-08 01:16:26,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 211 transitions, 1876 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:16:26,433 INFO L231 Difference]: Finished difference. Result has 90 places, 142 transitions, 1383 flow [2025-02-08 01:16:26,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1383, PETRI_PLACES=90, PETRI_TRANSITIONS=142} [2025-02-08 01:16:26,434 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 26 predicate places. [2025-02-08 01:16:26,434 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 142 transitions, 1383 flow [2025-02-08 01:16:26,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:26,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:26,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:16:26,434 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 2 more)] === [2025-02-08 01:16:26,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:26,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1825588379, now seen corresponding path program 6 times [2025-02-08 01:16:26,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:26,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574046139] [2025-02-08 01:16:26,435 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:16:26,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:26,443 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 49 statements into 1 equivalence classes. [2025-02-08 01:16:26,448 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 01:16:26,448 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:16:26,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:26,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:16:26,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:26,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574046139] [2025-02-08 01:16:26,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574046139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:26,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:26,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:16:26,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123636642] [2025-02-08 01:16:26,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:26,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:16:26,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:26,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:16:26,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:16:26,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-02-08 01:16:26,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 142 transitions, 1383 flow. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 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-02-08 01:16:26,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:26,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-02-08 01:16:26,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:29,764 INFO L124 PetriNetUnfolderBase]: 30490/45030 cut-off events. [2025-02-08 01:16:29,764 INFO L125 PetriNetUnfolderBase]: For 153095/153269 co-relation queries the response was YES. [2025-02-08 01:16:29,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160932 conditions, 45030 events. 30490/45030 cut-off events. For 153095/153269 co-relation queries the response was YES. Maximal size of possible extension queue 2085. Compared 323433 event pairs, 7095 based on Foata normal form. 433/44176 useless extension candidates. Maximal degree in co-relation 111817. Up to 16695 conditions per place. [2025-02-08 01:16:30,067 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 160 selfloop transitions, 98 changer transitions 5/277 dead transitions. [2025-02-08 01:16:30,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 277 transitions, 2591 flow [2025-02-08 01:16:30,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:16:30,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:16:30,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 304 transitions. [2025-02-08 01:16:30,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6440677966101694 [2025-02-08 01:16:30,070 INFO L175 Difference]: Start difference. First operand has 90 places, 142 transitions, 1383 flow. Second operand 8 states and 304 transitions. [2025-02-08 01:16:30,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 277 transitions, 2591 flow [2025-02-08 01:16:30,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 277 transitions, 2507 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:16:30,127 INFO L231 Difference]: Finished difference. Result has 97 places, 158 transitions, 1790 flow [2025-02-08 01:16:30,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1318, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1790, PETRI_PLACES=97, PETRI_TRANSITIONS=158} [2025-02-08 01:16:30,128 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 33 predicate places. [2025-02-08 01:16:30,128 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 158 transitions, 1790 flow [2025-02-08 01:16:30,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 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-02-08 01:16:30,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:30,129 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:30,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:16:30,130 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 2 more)] === [2025-02-08 01:16:30,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:30,131 INFO L85 PathProgramCache]: Analyzing trace with hash 403738443, now seen corresponding path program 1 times [2025-02-08 01:16:30,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:30,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148847915] [2025-02-08 01:16:30,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:16:30,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:30,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 01:16:30,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 01:16:30,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:30,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:30,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:16:30,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:30,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148847915] [2025-02-08 01:16:30,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148847915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:30,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:30,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:16:30,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536427964] [2025-02-08 01:16:30,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:30,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:16:30,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:30,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:16:30,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:16:30,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-02-08 01:16:30,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 158 transitions, 1790 flow. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 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-02-08 01:16:30,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:30,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-02-08 01:16:30,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:33,342 INFO L124 PetriNetUnfolderBase]: 29213/43612 cut-off events. [2025-02-08 01:16:33,342 INFO L125 PetriNetUnfolderBase]: For 180035/180151 co-relation queries the response was YES. [2025-02-08 01:16:33,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162529 conditions, 43612 events. 29213/43612 cut-off events. For 180035/180151 co-relation queries the response was YES. Maximal size of possible extension queue 1947. Compared 317134 event pairs, 6797 based on Foata normal form. 811/43288 useless extension candidates. Maximal degree in co-relation 115411. Up to 16291 conditions per place. [2025-02-08 01:16:33,646 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 159 selfloop transitions, 103 changer transitions 26/302 dead transitions. [2025-02-08 01:16:33,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 302 transitions, 3142 flow [2025-02-08 01:16:33,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:16:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:16:33,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 310 transitions. [2025-02-08 01:16:33,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6567796610169492 [2025-02-08 01:16:33,648 INFO L175 Difference]: Start difference. First operand has 97 places, 158 transitions, 1790 flow. Second operand 8 states and 310 transitions. [2025-02-08 01:16:33,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 302 transitions, 3142 flow [2025-02-08 01:16:33,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 302 transitions, 2994 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 01:16:33,751 INFO L231 Difference]: Finished difference. Result has 103 places, 163 transitions, 1968 flow [2025-02-08 01:16:33,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1665, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1968, PETRI_PLACES=103, PETRI_TRANSITIONS=163} [2025-02-08 01:16:33,751 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 39 predicate places. [2025-02-08 01:16:33,752 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 163 transitions, 1968 flow [2025-02-08 01:16:33,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 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-02-08 01:16:33,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:33,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:33,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:16:33,752 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 2 more)] === [2025-02-08 01:16:33,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:33,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1919279349, now seen corresponding path program 7 times [2025-02-08 01:16:33,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:33,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598531269] [2025-02-08 01:16:33,755 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:16:33,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:33,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 01:16:33,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 01:16:33,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:33,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:16:33,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:33,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598531269] [2025-02-08 01:16:33,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598531269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:33,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:33,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:16:33,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910520401] [2025-02-08 01:16:33,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:33,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:16:33,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:33,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:16:33,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:16:33,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-02-08 01:16:33,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 163 transitions, 1968 flow. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 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-02-08 01:16:33,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:33,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-02-08 01:16:33,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:36,072 INFO L124 PetriNetUnfolderBase]: 18618/28566 cut-off events. [2025-02-08 01:16:36,076 INFO L125 PetriNetUnfolderBase]: For 112775/112859 co-relation queries the response was YES. [2025-02-08 01:16:36,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107424 conditions, 28566 events. 18618/28566 cut-off events. For 112775/112859 co-relation queries the response was YES. Maximal size of possible extension queue 1190. Compared 203370 event pairs, 4702 based on Foata normal form. 504/28563 useless extension candidates. Maximal degree in co-relation 84491. Up to 10518 conditions per place. [2025-02-08 01:16:36,255 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 134 selfloop transitions, 107 changer transitions 38/293 dead transitions. [2025-02-08 01:16:36,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 293 transitions, 3454 flow [2025-02-08 01:16:36,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:16:36,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:16:36,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 293 transitions. [2025-02-08 01:16:36,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6207627118644068 [2025-02-08 01:16:36,257 INFO L175 Difference]: Start difference. First operand has 103 places, 163 transitions, 1968 flow. Second operand 8 states and 293 transitions. [2025-02-08 01:16:36,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 293 transitions, 3454 flow [2025-02-08 01:16:36,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 293 transitions, 3234 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 01:16:36,337 INFO L231 Difference]: Finished difference. Result has 107 places, 165 transitions, 2099 flow [2025-02-08 01:16:36,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1783, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2099, PETRI_PLACES=107, PETRI_TRANSITIONS=165} [2025-02-08 01:16:36,338 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 43 predicate places. [2025-02-08 01:16:36,338 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 165 transitions, 2099 flow [2025-02-08 01:16:36,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 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-02-08 01:16:36,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:36,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:36,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 01:16:36,339 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 2 more)] === [2025-02-08 01:16:36,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:36,339 INFO L85 PathProgramCache]: Analyzing trace with hash 22753095, now seen corresponding path program 8 times [2025-02-08 01:16:36,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:36,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324072721] [2025-02-08 01:16:36,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:16:36,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:36,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-02-08 01:16:36,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 01:16:36,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:16:36,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:16:36,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:36,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324072721] [2025-02-08 01:16:36,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324072721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:36,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:36,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:16:36,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092268284] [2025-02-08 01:16:36,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:36,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:16:36,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:36,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:16:36,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:16:36,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-02-08 01:16:36,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 165 transitions, 2099 flow. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 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-02-08 01:16:36,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:36,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-02-08 01:16:36,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand