./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 551b0097 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-?-551b009-m [2025-01-09 16:42:12,105 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:42:12,183 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:42:12,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:42:12,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:42:12,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:42:12,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:42:12,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:42:12,222 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:42:12,222 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:42:12,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:42:12,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:42:12,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:42:12,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:42:12,223 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:42:12,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:42:12,224 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:42:12,224 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:42:12,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:42:12,224 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:42:12,224 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:42:12,224 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:42:12,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:42:12,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:42:12,225 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:42:12,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:42:12,225 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:42:12,225 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:42:12,225 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:42:12,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:42:12,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:42:12,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:42:12,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:42:12,226 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:42:12,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:42:12,226 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:42:12,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:42:12,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:42:12,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:42:12,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:42:12,227 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:42:12,227 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:42:12,227 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:42:12,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:42:12,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:42:12,227 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:42:12,227 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:42:12,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:42:12,227 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-01-09 16:42:12,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:42:12,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:42:12,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:42:12,503 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:42:12,504 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:42:12,505 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-01-09 16:42:13,784 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d6d8c321/bdcfb230768a4922993a34b44876f676/FLAGffad66baa [2025-01-09 16:42:14,046 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:42:14,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2025-01-09 16:42:14,054 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d6d8c321/bdcfb230768a4922993a34b44876f676/FLAGffad66baa [2025-01-09 16:42:14,078 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d6d8c321/bdcfb230768a4922993a34b44876f676 [2025-01-09 16:42:14,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:42:14,083 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:42:14,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:42:14,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:42:14,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:42:14,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:42:14" (1/1) ... [2025-01-09 16:42:14,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5097a565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:14, skipping insertion in model container [2025-01-09 16:42:14,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:42:14" (1/1) ... [2025-01-09 16:42:14,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:42:14,274 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-01-09 16:42:14,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:42:14,292 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:42:14,315 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-01-09 16:42:14,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:42:14,335 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:42:14,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:14 WrapperNode [2025-01-09 16:42:14,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:42:14,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:42:14,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:42:14,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:42:14,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:14" (1/1) ... [2025-01-09 16:42:14,351 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:14" (1/1) ... [2025-01-09 16:42:14,376 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2025-01-09 16:42:14,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:42:14,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:42:14,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:42:14,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:42:14,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:14" (1/1) ... [2025-01-09 16:42:14,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:14" (1/1) ... [2025-01-09 16:42:14,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:14" (1/1) ... [2025-01-09 16:42:14,414 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-01-09 16:42:14,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:14" (1/1) ... [2025-01-09 16:42:14,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:14" (1/1) ... [2025-01-09 16:42:14,420 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:14" (1/1) ... [2025-01-09 16:42:14,421 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:14" (1/1) ... [2025-01-09 16:42:14,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:14" (1/1) ... [2025-01-09 16:42:14,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:14" (1/1) ... [2025-01-09 16:42:14,429 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:14" (1/1) ... [2025-01-09 16:42:14,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:42:14,437 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:42:14,437 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:42:14,437 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:42:14,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:14" (1/1) ... [2025-01-09 16:42:14,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:42:14,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:14,464 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-01-09 16:42:14,466 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-01-09 16:42:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:42:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:42:14,487 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:42:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:42:14,487 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:42:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:42:14,487 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:42:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 16:42:14,487 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 16:42:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:42:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:42:14,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:42:14,488 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:42:14,583 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:42:14,585 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:42:14,849 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:42:14,850 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:42:15,033 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:42:15,033 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:42:15,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:42:15 BoogieIcfgContainer [2025-01-09 16:42:15,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:42:15,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:42:15,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:42:15,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:42:15,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:42:14" (1/3) ... [2025-01-09 16:42:15,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e0d5b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:42:15, skipping insertion in model container [2025-01-09 16:42:15,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:14" (2/3) ... [2025-01-09 16:42:15,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e0d5b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:42:15, skipping insertion in model container [2025-01-09 16:42:15,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:42:15" (3/3) ... [2025-01-09 16:42:15,043 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2025-01-09 16:42:15,055 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:42:15,057 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-01-09 16:42:15,057 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:42:15,136 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 16:42:15,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 59 transitions, 146 flow [2025-01-09 16:42:15,224 INFO L124 PetriNetUnfolderBase]: 3/55 cut-off events. [2025-01-09 16:42:15,226 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:42:15,230 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 5. Compared 96 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-01-09 16:42:15,230 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 59 transitions, 146 flow [2025-01-09 16:42:15,236 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 54 transitions, 132 flow [2025-01-09 16:42:15,246 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:42:15,258 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;@776ebbcf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:42:15,258 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 16:42:15,283 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:42:15,284 INFO L124 PetriNetUnfolderBase]: 3/53 cut-off events. [2025-01-09 16:42:15,284 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:42:15,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:15,285 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-01-09 16:42:15,286 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-01-09 16:42:15,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:15,293 INFO L85 PathProgramCache]: Analyzing trace with hash -338410394, now seen corresponding path program 1 times [2025-01-09 16:42:15,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:15,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002422874] [2025-01-09 16:42:15,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:15,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:15,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 16:42:15,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 16:42:15,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:15,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:15,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:15,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:15,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002422874] [2025-01-09 16:42:15,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002422874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:15,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:15,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:42:15,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451591483] [2025-01-09 16:42:15,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:15,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:42:15,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:15,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:42:15,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:42:15,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 59 [2025-01-09 16:42:15,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-01-09 16:42:15,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:15,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 59 [2025-01-09 16:42:15,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:17,448 INFO L124 PetriNetUnfolderBase]: 12679/17507 cut-off events. [2025-01-09 16:42:17,449 INFO L125 PetriNetUnfolderBase]: For 1243/1243 co-relation queries the response was YES. [2025-01-09 16:42:17,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35337 conditions, 17507 events. 12679/17507 cut-off events. For 1243/1243 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 101565 event pairs, 4419 based on Foata normal form. 1/17032 useless extension candidates. Maximal degree in co-relation 32049. Up to 10696 conditions per place. [2025-01-09 16:42:17,600 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 59 selfloop transitions, 6 changer transitions 1/82 dead transitions. [2025-01-09 16:42:17,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 82 transitions, 338 flow [2025-01-09 16:42:17,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:42:17,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:42:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-01-09 16:42:17,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7175141242937854 [2025-01-09 16:42:17,676 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 132 flow. Second operand 3 states and 127 transitions. [2025-01-09 16:42:17,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 82 transitions, 338 flow [2025-01-09 16:42:17,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 310 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-09 16:42:17,716 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 148 flow [2025-01-09 16:42:17,719 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-01-09 16:42:17,722 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -5 predicate places. [2025-01-09 16:42:17,723 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 148 flow [2025-01-09 16:42:17,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-01-09 16:42:17,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:17,725 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-01-09 16:42:17,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:42:17,725 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-01-09 16:42:17,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:17,726 INFO L85 PathProgramCache]: Analyzing trace with hash -728591479, now seen corresponding path program 1 times [2025-01-09 16:42:17,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:17,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291866795] [2025-01-09 16:42:17,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:17,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:17,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 16:42:17,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 16:42:17,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:17,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:17,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:17,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291866795] [2025-01-09 16:42:17,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291866795] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:17,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:17,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:42:17,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37647256] [2025-01-09 16:42:17,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:17,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:42:17,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:17,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:42:17,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:42:17,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2025-01-09 16:42:17,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 148 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-01-09 16:42:17,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:17,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2025-01-09 16:42:17,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:20,080 INFO L124 PetriNetUnfolderBase]: 21965/30404 cut-off events. [2025-01-09 16:42:20,082 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2025-01-09 16:42:20,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61554 conditions, 30404 events. 21965/30404 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 1155. Compared 181661 event pairs, 16979 based on Foata normal form. 0/29844 useless extension candidates. Maximal degree in co-relation 41623. Up to 26138 conditions per place. [2025-01-09 16:42:20,236 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 58 selfloop transitions, 8 changer transitions 0/80 dead transitions. [2025-01-09 16:42:20,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 329 flow [2025-01-09 16:42:20,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:42:20,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:42:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2025-01-09 16:42:20,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6440677966101694 [2025-01-09 16:42:20,241 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 148 flow. Second operand 3 states and 114 transitions. [2025-01-09 16:42:20,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 329 flow [2025-01-09 16:42:20,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 323 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:42:20,245 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 196 flow [2025-01-09 16:42:20,245 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-01-09 16:42:20,246 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -2 predicate places. [2025-01-09 16:42:20,246 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 196 flow [2025-01-09 16:42:20,247 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-01-09 16:42:20,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:20,247 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-01-09 16:42:20,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:42:20,249 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-01-09 16:42:20,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:20,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1852755381, now seen corresponding path program 1 times [2025-01-09 16:42:20,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:20,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945550682] [2025-01-09 16:42:20,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:20,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:20,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 16:42:20,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 16:42:20,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:20,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:20,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:20,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:20,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945550682] [2025-01-09 16:42:20,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945550682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:20,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:20,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:42:20,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980792051] [2025-01-09 16:42:20,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:20,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:42:20,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:20,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:42:20,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:42:20,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-01-09 16:42:20,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 196 flow. Second operand has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 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-01-09 16:42:20,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:20,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-01-09 16:42:20,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:22,399 INFO L124 PetriNetUnfolderBase]: 18572/28993 cut-off events. [2025-01-09 16:42:22,399 INFO L125 PetriNetUnfolderBase]: For 1566/1670 co-relation queries the response was YES. [2025-01-09 16:42:22,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59625 conditions, 28993 events. 18572/28993 cut-off events. For 1566/1670 co-relation queries the response was YES. Maximal size of possible extension queue 1654. Compared 225070 event pairs, 3513 based on Foata normal form. 358/27918 useless extension candidates. Maximal degree in co-relation 37875. Up to 9172 conditions per place. [2025-01-09 16:42:22,597 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 105 selfloop transitions, 41 changer transitions 1/172 dead transitions. [2025-01-09 16:42:22,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 172 transitions, 732 flow [2025-01-09 16:42:22,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:42:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:42:22,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 348 transitions. [2025-01-09 16:42:22,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.655367231638418 [2025-01-09 16:42:22,600 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 196 flow. Second operand 9 states and 348 transitions. [2025-01-09 16:42:22,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 172 transitions, 732 flow [2025-01-09 16:42:22,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 172 transitions, 716 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:42:22,646 INFO L231 Difference]: Finished difference. Result has 71 places, 97 transitions, 366 flow [2025-01-09 16:42:22,647 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=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=366, PETRI_PLACES=71, PETRI_TRANSITIONS=97} [2025-01-09 16:42:22,648 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places. [2025-01-09 16:42:22,648 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 97 transitions, 366 flow [2025-01-09 16:42:22,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 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-01-09 16:42:22,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:22,648 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-01-09 16:42:22,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:42:22,649 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-01-09 16:42:22,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:22,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1191460215, now seen corresponding path program 2 times [2025-01-09 16:42:22,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:22,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642438177] [2025-01-09 16:42:22,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:42:22,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:22,662 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-01-09 16:42:22,676 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 16:42:22,676 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:42:22,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:22,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:22,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:22,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642438177] [2025-01-09 16:42:22,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642438177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:22,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:22,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:42:22,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060803164] [2025-01-09 16:42:22,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:22,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:42:22,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:22,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:42:22,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:42:22,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-01-09 16:42:22,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 97 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 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-01-09 16:42:22,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:22,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-01-09 16:42:22,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:24,756 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, 7#L44-1true, 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:24,756 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2025-01-09 16:42:24,756 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:42:24,757 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:42:24,757 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:42:24,757 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 44#L56-1true, 29#L76-1true, 41#L66-1true, 7#L44-1true, 84#(<= (+ ~s~0 1) ~t~0), 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:24,757 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2025-01-09 16:42:24,757 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:42:24,757 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:42:24,757 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:42:24,923 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, 7#L44-1true, 98#true, 46#L101true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:24,923 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-09 16:42:24,923 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:24,923 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:24,924 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:24,924 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 44#L56-1true, 29#L76-1true, 41#L66-1true, 7#L44-1true, 46#L101true, 98#true, 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:24,924 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-09 16:42:24,924 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:24,924 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:24,924 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:24,924 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 29#L76-1true, 41#L66-1true, 7#L44-1true, 98#true, 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:24,924 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-09 16:42:24,924 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:24,924 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:24,924 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:24,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, 7#L44-1true, 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:24,925 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-09 16:42:24,925 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:24,925 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:24,925 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:24,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, 7#L44-1true, 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:24,925 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-09 16:42:24,925 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:24,925 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:24,926 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:24,926 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 44#L56-1true, 41#L66-1true, 7#L44-1true, 98#true, 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:24,926 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-09 16:42:24,926 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:24,927 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:24,927 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:25,242 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 29#L76-1true, 41#L66-1true, 7#L44-1true, 46#L101true, 84#(<= (+ ~s~0 1) ~t~0), 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:25,242 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,242 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,242 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,242 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,243 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, 7#L44-1true, 46#L101true, 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:25,243 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,243 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,243 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,243 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,243 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, 51#thread2EXITtrue, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, 7#L44-1true, 98#true, 46#L101true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:25,243 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,243 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,243 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,243 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 44#L56-1true, 41#L66-1true, 7#L44-1true, 46#L101true, 84#(<= (+ ~s~0 1) ~t~0), 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:25,244 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,244 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,244 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,244 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 9#thread4EXITtrue, 41#L66-1true, 7#L44-1true, 98#true, 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:25,244 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,244 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,244 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,244 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,245 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, 7#L44-1true, 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:25,245 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,245 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,245 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,245 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:25,327 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, 51#thread2EXITtrue, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 41#L66-1true, 7#L44-1true, 46#L101true, 98#true, 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:25,327 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-01-09 16:42:25,327 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:42:25,327 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:42:25,327 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:42:25,327 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, 7#L44-1true, 98#true, 46#L101true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:25,327 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-01-09 16:42:25,327 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:42:25,327 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:42:25,327 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:42:25,426 INFO L124 PetriNetUnfolderBase]: 31017/48718 cut-off events. [2025-01-09 16:42:25,426 INFO L125 PetriNetUnfolderBase]: For 23066/23594 co-relation queries the response was YES. [2025-01-09 16:42:25,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120023 conditions, 48718 events. 31017/48718 cut-off events. For 23066/23594 co-relation queries the response was YES. Maximal size of possible extension queue 2591. Compared 401575 event pairs, 7493 based on Foata normal form. 523/47334 useless extension candidates. Maximal degree in co-relation 77638. Up to 18165 conditions per place. [2025-01-09 16:42:25,678 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 104 selfloop transitions, 55 changer transitions 4/188 dead transitions. [2025-01-09 16:42:25,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 188 transitions, 998 flow [2025-01-09 16:42:25,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:42:25,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:42:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 213 transitions. [2025-01-09 16:42:25,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7220338983050848 [2025-01-09 16:42:25,680 INFO L175 Difference]: Start difference. First operand has 71 places, 97 transitions, 366 flow. Second operand 5 states and 213 transitions. [2025-01-09 16:42:25,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 188 transitions, 998 flow [2025-01-09 16:42:25,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 188 transitions, 991 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:42:25,811 INFO L231 Difference]: Finished difference. Result has 77 places, 134 transitions, 759 flow [2025-01-09 16:42:25,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=759, PETRI_PLACES=77, PETRI_TRANSITIONS=134} [2025-01-09 16:42:25,812 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 13 predicate places. [2025-01-09 16:42:25,812 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 134 transitions, 759 flow [2025-01-09 16:42:25,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 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-01-09 16:42:25,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:25,812 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-01-09 16:42:25,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:42:25,813 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-01-09 16:42:25,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:25,813 INFO L85 PathProgramCache]: Analyzing trace with hash 475877975, now seen corresponding path program 1 times [2025-01-09 16:42:25,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:25,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987644832] [2025-01-09 16:42:25,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:25,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:25,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 16:42:25,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 16:42:25,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:25,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:25,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:25,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:25,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987644832] [2025-01-09 16:42:25,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987644832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:25,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:25,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:42:25,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472215630] [2025-01-09 16:42:25,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:25,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:42:25,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:25,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:42:25,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:42:25,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-01-09 16:42:25,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 134 transitions, 759 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 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-01-09 16:42:25,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:25,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-01-09 16:42:25,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:28,225 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), 84#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, 5#L100-4true, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:28,225 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2025-01-09 16:42:28,225 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:42:28,225 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:42:28,225 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:42:28,226 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, 5#L100-4true, Black: 76#true, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:28,226 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2025-01-09 16:42:28,226 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:42:28,226 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:42:28,226 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:42:28,392 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 7#L44-1true, 46#L101true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:28,392 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,392 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,392 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,392 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,392 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 108#true, Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), Black: 76#true, 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:28,392 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,392 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,392 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,392 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,393 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 5#L100-4true, 51#thread2EXITtrue, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:28,393 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,393 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,393 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,393 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,393 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), 108#true, Black: 100#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:28,393 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,393 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,393 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,393 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,393 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, 5#L100-4true, Black: 76#true, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:28,393 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,393 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,393 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,393 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,394 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 108#true, Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:28,394 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,394 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,394 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,394 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:28,527 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 46#L101true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:28,528 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,528 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,528 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,528 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,528 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), 84#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 108#true, Black: 100#(<= ~s~0 ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:28,528 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,528 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,528 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,528 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,528 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), 108#true, Black: 100#(<= ~s~0 ~t~0), Black: 76#true, 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:28,528 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,529 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,529 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,529 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,529 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:28,529 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,529 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,529 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,529 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,529 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:28,529 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,529 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,529 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,529 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,530 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:28,530 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,530 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,530 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,530 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:28,629 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 46#L101true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:28,629 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-01-09 16:42:28,630 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:42:28,630 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:42:28,630 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:42:28,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:28,630 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-01-09 16:42:28,630 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:42:28,630 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:42:28,630 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:42:28,898 INFO L124 PetriNetUnfolderBase]: 28896/45634 cut-off events. [2025-01-09 16:42:28,899 INFO L125 PetriNetUnfolderBase]: For 66729/68306 co-relation queries the response was YES. [2025-01-09 16:42:28,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139415 conditions, 45634 events. 28896/45634 cut-off events. For 66729/68306 co-relation queries the response was YES. Maximal size of possible extension queue 2401. Compared 374889 event pairs, 7274 based on Foata normal form. 952/44887 useless extension candidates. Maximal degree in co-relation 86598. Up to 17640 conditions per place. [2025-01-09 16:42:29,151 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 107 selfloop transitions, 68 changer transitions 0/200 dead transitions. [2025-01-09 16:42:29,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 200 transitions, 1397 flow [2025-01-09 16:42:29,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:42:29,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:42:29,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 212 transitions. [2025-01-09 16:42:29,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7186440677966102 [2025-01-09 16:42:29,154 INFO L175 Difference]: Start difference. First operand has 77 places, 134 transitions, 759 flow. Second operand 5 states and 212 transitions. [2025-01-09 16:42:29,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 200 transitions, 1397 flow [2025-01-09 16:42:29,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 200 transitions, 1382 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-01-09 16:42:29,313 INFO L231 Difference]: Finished difference. Result has 82 places, 147 transitions, 1057 flow [2025-01-09 16:42:29,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1057, PETRI_PLACES=82, PETRI_TRANSITIONS=147} [2025-01-09 16:42:29,314 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 18 predicate places. [2025-01-09 16:42:29,314 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 147 transitions, 1057 flow [2025-01-09 16:42:29,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 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-01-09 16:42:29,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:29,315 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-01-09 16:42:29,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:42:29,315 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-01-09 16:42:29,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:29,316 INFO L85 PathProgramCache]: Analyzing trace with hash 93800467, now seen corresponding path program 3 times [2025-01-09 16:42:29,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:29,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236564537] [2025-01-09 16:42:29,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:42:29,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:29,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 1 equivalence classes. [2025-01-09 16:42:29,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 16:42:29,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:42:29,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:29,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:29,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:29,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236564537] [2025-01-09 16:42:29,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236564537] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:29,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:29,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:42:29,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31173789] [2025-01-09 16:42:29,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:29,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:42:29,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:29,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:42:29,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:42:29,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-01-09 16:42:29,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 147 transitions, 1057 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 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-01-09 16:42:29,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:29,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-01-09 16:42:29,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:31,941 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), 117#true, 5#L100-4true, Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:31,941 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2025-01-09 16:42:31,941 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:42:31,941 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:42:31,941 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:42:32,133 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, 117#true, Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:32,134 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-09 16:42:32,134 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:32,134 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:32,134 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:32,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), 117#true, 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:32,134 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-09 16:42:32,134 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:32,134 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:32,134 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:32,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 117#true, Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), 5#L100-4true, Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:32,134 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-09 16:42:32,134 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:32,134 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:32,134 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:32,308 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, 117#true, Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:32,308 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-09 16:42:32,308 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:32,308 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:32,308 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:32,308 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, 117#true, Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:32,309 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-09 16:42:32,309 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:32,309 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:32,309 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:32,309 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), 117#true, 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:32,309 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-09 16:42:32,309 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:32,309 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:32,309 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:32,432 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 117#true, Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:32,432 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-01-09 16:42:32,432 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:42:32,432 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:42:32,432 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:42:32,758 INFO L124 PetriNetUnfolderBase]: 32470/50995 cut-off events. [2025-01-09 16:42:32,758 INFO L125 PetriNetUnfolderBase]: For 103598/106226 co-relation queries the response was YES. [2025-01-09 16:42:32,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169020 conditions, 50995 events. 32470/50995 cut-off events. For 103598/106226 co-relation queries the response was YES. Maximal size of possible extension queue 2826. Compared 425275 event pairs, 6385 based on Foata normal form. 1598/50204 useless extension candidates. Maximal degree in co-relation 105849. Up to 17284 conditions per place. [2025-01-09 16:42:32,994 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 107 selfloop transitions, 106 changer transitions 4/242 dead transitions. [2025-01-09 16:42:32,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 242 transitions, 1922 flow [2025-01-09 16:42:32,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:42:32,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:42:32,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 257 transitions. [2025-01-09 16:42:32,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7259887005649718 [2025-01-09 16:42:32,996 INFO L175 Difference]: Start difference. First operand has 82 places, 147 transitions, 1057 flow. Second operand 6 states and 257 transitions. [2025-01-09 16:42:32,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 242 transitions, 1922 flow [2025-01-09 16:42:33,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 242 transitions, 1836 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:42:33,129 INFO L231 Difference]: Finished difference. Result has 87 places, 175 transitions, 1487 flow [2025-01-09 16:42:33,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1487, PETRI_PLACES=87, PETRI_TRANSITIONS=175} [2025-01-09 16:42:33,129 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 23 predicate places. [2025-01-09 16:42:33,129 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 175 transitions, 1487 flow [2025-01-09 16:42:33,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 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-01-09 16:42:33,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:33,130 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-01-09 16:42:33,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:42:33,130 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-01-09 16:42:33,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:33,131 INFO L85 PathProgramCache]: Analyzing trace with hash 150968343, now seen corresponding path program 4 times [2025-01-09 16:42:33,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:33,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667358215] [2025-01-09 16:42:33,131 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:42:33,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:33,142 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-01-09 16:42:33,159 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 16:42:33,160 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:42:33,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:33,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:33,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:33,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667358215] [2025-01-09 16:42:33,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667358215] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:33,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:33,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:42:33,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737939414] [2025-01-09 16:42:33,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:33,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:42:33,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:33,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:42:33,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:42:33,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-01-09 16:42:33,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 175 transitions, 1487 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 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-01-09 16:42:33,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:33,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-01-09 16:42:33,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:35,867 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 117#true, Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:35,868 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2025-01-09 16:42:35,868 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:42:35,868 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:42:35,868 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:42:36,037 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][158], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 119#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:36,037 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-09 16:42:36,037 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:36,037 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:36,037 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:36,085 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 117#true, Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L101true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:36,085 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-09 16:42:36,085 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:36,085 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:36,085 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:36,085 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 117#true, Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:36,085 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-09 16:42:36,085 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:36,085 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:36,085 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:36,085 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), 117#true, Black: 100#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:36,086 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-09 16:42:36,086 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:36,086 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:36,086 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:42:36,227 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][158], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 119#(<= ~s~0 ~t~0), Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L101true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:36,228 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-09 16:42:36,228 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:36,228 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:36,228 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:36,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][158], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), 84#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 119#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:36,228 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-09 16:42:36,228 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:36,228 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:36,228 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:36,258 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), 117#true, Black: 100#(<= ~s~0 ~t~0), Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:36,258 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-09 16:42:36,258 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:36,258 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:36,258 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:36,258 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), 117#true, Black: 100#(<= ~s~0 ~t~0), Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:36,258 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-09 16:42:36,258 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:36,258 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:36,258 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:36,259 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 117#true, 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:36,259 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-09 16:42:36,259 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:36,259 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:36,259 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:42:36,557 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][158], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 119#(<= ~s~0 ~t~0), Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L101true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:36,558 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-01-09 16:42:36,558 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:42:36,558 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:42:36,558 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:42:36,575 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), 117#true, Black: 100#(<= ~s~0 ~t~0), Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2025-01-09 16:42:36,575 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-01-09 16:42:36,575 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:42:36,575 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:42:36,575 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:42:36,733 INFO L124 PetriNetUnfolderBase]: 31732/50954 cut-off events. [2025-01-09 16:42:36,733 INFO L125 PetriNetUnfolderBase]: For 160772/163129 co-relation queries the response was YES. [2025-01-09 16:42:36,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178732 conditions, 50954 events. 31732/50954 cut-off events. For 160772/163129 co-relation queries the response was YES. Maximal size of possible extension queue 2810. Compared 436290 event pairs, 8150 based on Foata normal form. 1179/50358 useless extension candidates. Maximal degree in co-relation 111088. Up to 23495 conditions per place. [2025-01-09 16:42:36,993 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 124 selfloop transitions, 85 changer transitions 12/246 dead transitions. [2025-01-09 16:42:36,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 246 transitions, 2344 flow [2025-01-09 16:42:36,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:42:36,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:42:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2025-01-09 16:42:36,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7254237288135593 [2025-01-09 16:42:36,994 INFO L175 Difference]: Start difference. First operand has 87 places, 175 transitions, 1487 flow. Second operand 5 states and 214 transitions. [2025-01-09 16:42:36,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 246 transitions, 2344 flow [2025-01-09 16:42:37,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 246 transitions, 2275 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-01-09 16:42:37,255 INFO L231 Difference]: Finished difference. Result has 91 places, 185 transitions, 1807 flow [2025-01-09 16:42:37,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1429, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1807, PETRI_PLACES=91, PETRI_TRANSITIONS=185} [2025-01-09 16:42:37,256 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 27 predicate places. [2025-01-09 16:42:37,256 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 185 transitions, 1807 flow [2025-01-09 16:42:37,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 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-01-09 16:42:37,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:37,257 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-01-09 16:42:37,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:42:37,257 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-01-09 16:42:37,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:37,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1047806689, now seen corresponding path program 5 times [2025-01-09 16:42:37,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:37,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215504126] [2025-01-09 16:42:37,258 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:42:37,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:37,267 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-01-09 16:42:37,274 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 16:42:37,275 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:42:37,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:37,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:37,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:37,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215504126] [2025-01-09 16:42:37,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215504126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:37,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:37,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:42:37,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396383045] [2025-01-09 16:42:37,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:37,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:42:37,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:37,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:42:37,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:42:37,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-01-09 16:42:37,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 185 transitions, 1807 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 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-01-09 16:42:37,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:37,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-01-09 16:42:37,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:40,178 INFO L124 PetriNetUnfolderBase]: 20188/32582 cut-off events. [2025-01-09 16:42:40,178 INFO L125 PetriNetUnfolderBase]: For 113177/115127 co-relation queries the response was YES. [2025-01-09 16:42:40,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115558 conditions, 32582 events. 20188/32582 cut-off events. For 113177/115127 co-relation queries the response was YES. Maximal size of possible extension queue 1796. Compared 263393 event pairs, 5504 based on Foata normal form. 1250/32738 useless extension candidates. Maximal degree in co-relation 89621. Up to 16794 conditions per place. [2025-01-09 16:42:40,336 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 116 selfloop transitions, 91 changer transitions 5/237 dead transitions. [2025-01-09 16:42:40,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 237 transitions, 2473 flow [2025-01-09 16:42:40,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:42:40,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:42:40,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2025-01-09 16:42:40,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7152542372881356 [2025-01-09 16:42:40,337 INFO L175 Difference]: Start difference. First operand has 91 places, 185 transitions, 1807 flow. Second operand 5 states and 211 transitions. [2025-01-09 16:42:40,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 237 transitions, 2473 flow [2025-01-09 16:42:40,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 237 transitions, 2372 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:42:40,450 INFO L231 Difference]: Finished difference. Result has 95 places, 189 transitions, 2039 flow [2025-01-09 16:42:40,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2039, PETRI_PLACES=95, PETRI_TRANSITIONS=189} [2025-01-09 16:42:40,451 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 31 predicate places. [2025-01-09 16:42:40,451 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 189 transitions, 2039 flow [2025-01-09 16:42:40,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 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-01-09 16:42:40,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:40,451 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-01-09 16:42:40,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:42:40,452 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-01-09 16:42:40,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:40,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1574365825, now seen corresponding path program 6 times [2025-01-09 16:42:40,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:40,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519899208] [2025-01-09 16:42:40,452 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:42:40,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:40,460 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 49 statements into 1 equivalence classes. [2025-01-09 16:42:40,466 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 16:42:40,466 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:42:40,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:40,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:40,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:40,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519899208] [2025-01-09 16:42:40,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519899208] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:40,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:40,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:42:40,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188669449] [2025-01-09 16:42:40,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:40,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:42:40,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:40,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:42:40,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:42:40,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-01-09 16:42:40,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 189 transitions, 2039 flow. Second operand has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 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-01-09 16:42:40,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:40,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-01-09 16:42:40,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:42,993 INFO L124 PetriNetUnfolderBase]: 20083/32372 cut-off events. [2025-01-09 16:42:42,993 INFO L125 PetriNetUnfolderBase]: For 133913/136182 co-relation queries the response was YES. [2025-01-09 16:42:43,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120675 conditions, 32372 events. 20083/32372 cut-off events. For 133913/136182 co-relation queries the response was YES. Maximal size of possible extension queue 1737. Compared 262245 event pairs, 4425 based on Foata normal form. 1212/32298 useless extension candidates. Maximal degree in co-relation 94601. Up to 9620 conditions per place. [2025-01-09 16:42:43,217 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 120 selfloop transitions, 127 changer transitions 3/275 dead transitions. [2025-01-09 16:42:43,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 275 transitions, 2941 flow [2025-01-09 16:42:43,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:42:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:42:43,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 326 transitions. [2025-01-09 16:42:43,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.690677966101695 [2025-01-09 16:42:43,218 INFO L175 Difference]: Start difference. First operand has 95 places, 189 transitions, 2039 flow. Second operand 8 states and 326 transitions. [2025-01-09 16:42:43,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 275 transitions, 2941 flow [2025-01-09 16:42:43,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 275 transitions, 2828 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:42:43,338 INFO L231 Difference]: Finished difference. Result has 102 places, 196 transitions, 2333 flow [2025-01-09 16:42:43,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1938, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2333, PETRI_PLACES=102, PETRI_TRANSITIONS=196} [2025-01-09 16:42:43,338 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 38 predicate places. [2025-01-09 16:42:43,338 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 196 transitions, 2333 flow [2025-01-09 16:42:43,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 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-01-09 16:42:43,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:43,339 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-01-09 16:42:43,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:42:43,339 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-01-09 16:42:43,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:43,340 INFO L85 PathProgramCache]: Analyzing trace with hash -466208189, now seen corresponding path program 2 times [2025-01-09 16:42:43,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:43,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356483636] [2025-01-09 16:42:43,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:42:43,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:43,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-01-09 16:42:43,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 16:42:43,359 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:42:43,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:43,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:43,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356483636] [2025-01-09 16:42:43,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356483636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:43,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:43,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:42:43,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307275069] [2025-01-09 16:42:43,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:43,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:42:43,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:43,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:42:43,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:42:43,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-01-09 16:42:43,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 196 transitions, 2333 flow. Second operand has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 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-01-09 16:42:43,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:43,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-01-09 16:42:43,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:46,453 INFO L124 PetriNetUnfolderBase]: 19464/31902 cut-off events. [2025-01-09 16:42:46,453 INFO L125 PetriNetUnfolderBase]: For 161756/163656 co-relation queries the response was YES. [2025-01-09 16:42:46,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124405 conditions, 31902 events. 19464/31902 cut-off events. For 161756/163656 co-relation queries the response was YES. Maximal size of possible extension queue 1654. Compared 262968 event pairs, 4270 based on Foata normal form. 1207/31930 useless extension candidates. Maximal degree in co-relation 97901. Up to 9533 conditions per place. [2025-01-09 16:42:46,609 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 122 selfloop transitions, 139 changer transitions 26/312 dead transitions. [2025-01-09 16:42:46,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 312 transitions, 3738 flow [2025-01-09 16:42:46,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:42:46,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:42:46,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 332 transitions. [2025-01-09 16:42:46,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7033898305084746 [2025-01-09 16:42:46,611 INFO L175 Difference]: Start difference. First operand has 102 places, 196 transitions, 2333 flow. Second operand 8 states and 332 transitions. [2025-01-09 16:42:46,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 312 transitions, 3738 flow [2025-01-09 16:42:46,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 312 transitions, 3515 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-01-09 16:42:46,767 INFO L231 Difference]: Finished difference. Result has 107 places, 207 transitions, 2653 flow [2025-01-09 16:42:46,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2158, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2653, PETRI_PLACES=107, PETRI_TRANSITIONS=207} [2025-01-09 16:42:46,767 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 43 predicate places. [2025-01-09 16:42:46,767 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 207 transitions, 2653 flow [2025-01-09 16:42:46,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 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-01-09 16:42:46,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:46,768 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-01-09 16:42:46,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:42:46,768 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-01-09 16:42:46,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:46,769 INFO L85 PathProgramCache]: Analyzing trace with hash -520405845, now seen corresponding path program 7 times [2025-01-09 16:42:46,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:46,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630399270] [2025-01-09 16:42:46,769 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:42:46,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:46,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 16:42:46,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 16:42:46,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:46,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:46,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:46,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630399270] [2025-01-09 16:42:46,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630399270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:46,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:46,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:42:46,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319243121] [2025-01-09 16:42:46,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:46,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:42:46,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:46,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:42:46,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:42:46,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-01-09 16:42:46,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 207 transitions, 2653 flow. Second operand has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 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-01-09 16:42:46,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:46,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-01-09 16:42:46,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:49,088 INFO L124 PetriNetUnfolderBase]: 13479/22220 cut-off events. [2025-01-09 16:42:49,088 INFO L125 PetriNetUnfolderBase]: For 108052/109168 co-relation queries the response was YES. [2025-01-09 16:42:49,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86335 conditions, 22220 events. 13479/22220 cut-off events. For 108052/109168 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 173244 event pairs, 3104 based on Foata normal form. 828/22418 useless extension candidates. Maximal degree in co-relation 71321. Up to 6362 conditions per place. [2025-01-09 16:42:49,171 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 112 selfloop transitions, 138 changer transitions 35/309 dead transitions. [2025-01-09 16:42:49,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 309 transitions, 3930 flow [2025-01-09 16:42:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:42:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:42:49,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 328 transitions. [2025-01-09 16:42:49,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6949152542372882 [2025-01-09 16:42:49,172 INFO L175 Difference]: Start difference. First operand has 107 places, 207 transitions, 2653 flow. Second operand 8 states and 328 transitions. [2025-01-09 16:42:49,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 309 transitions, 3930 flow [2025-01-09 16:42:49,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 309 transitions, 3783 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:42:49,245 INFO L231 Difference]: Finished difference. Result has 113 places, 202 transitions, 2782 flow [2025-01-09 16:42:49,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2487, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2782, PETRI_PLACES=113, PETRI_TRANSITIONS=202} [2025-01-09 16:42:49,246 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 49 predicate places. [2025-01-09 16:42:49,246 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 202 transitions, 2782 flow [2025-01-09 16:42:49,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 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-01-09 16:42:49,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:49,246 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-01-09 16:42:49,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:42:49,246 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-01-09 16:42:49,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:49,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1458401591, now seen corresponding path program 8 times [2025-01-09 16:42:49,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:49,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835287037] [2025-01-09 16:42:49,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:42:49,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:49,254 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-01-09 16:42:49,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 16:42:49,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:42:49,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:49,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:49,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:49,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835287037] [2025-01-09 16:42:49,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835287037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:49,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:49,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:42:49,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340244700] [2025-01-09 16:42:49,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:49,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:42:49,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:49,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:42:49,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:42:49,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-01-09 16:42:49,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 202 transitions, 2782 flow. Second operand has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 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-01-09 16:42:49,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:49,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-01-09 16:42:49,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:50,998 INFO L124 PetriNetUnfolderBase]: 12306/19949 cut-off events. [2025-01-09 16:42:50,998 INFO L125 PetriNetUnfolderBase]: For 116199/117047 co-relation queries the response was YES. [2025-01-09 16:42:51,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79240 conditions, 19949 events. 12306/19949 cut-off events. For 116199/117047 co-relation queries the response was YES. Maximal size of possible extension queue 1045. Compared 151397 event pairs, 2965 based on Foata normal form. 496/19718 useless extension candidates. Maximal degree in co-relation 64408. Up to 7340 conditions per place. [2025-01-09 16:42:51,086 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 100 selfloop transitions, 138 changer transitions 31/293 dead transitions. [2025-01-09 16:42:51,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 293 transitions, 3831 flow [2025-01-09 16:42:51,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:42:51,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:42:51,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 348 transitions. [2025-01-09 16:42:51,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.655367231638418 [2025-01-09 16:42:51,088 INFO L175 Difference]: Start difference. First operand has 113 places, 202 transitions, 2782 flow. Second operand 9 states and 348 transitions. [2025-01-09 16:42:51,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 293 transitions, 3831 flow [2025-01-09 16:42:51,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 293 transitions, 3699 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:42:51,194 INFO L231 Difference]: Finished difference. Result has 119 places, 191 transitions, 2738 flow [2025-01-09 16:42:51,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2661, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2738, PETRI_PLACES=119, PETRI_TRANSITIONS=191} [2025-01-09 16:42:51,195 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 55 predicate places. [2025-01-09 16:42:51,195 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 191 transitions, 2738 flow [2025-01-09 16:42:51,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 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-01-09 16:42:51,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:51,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:51,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:42:51,196 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:42:51,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:51,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1356573209, now seen corresponding path program 9 times [2025-01-09 16:42:51,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:51,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218647945] [2025-01-09 16:42:51,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:42:51,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:51,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 1 equivalence classes. [2025-01-09 16:42:51,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 16:42:51,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:42:51,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:51,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:51,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218647945] [2025-01-09 16:42:51,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218647945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:51,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:51,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:42:51,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186176590] [2025-01-09 16:42:51,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:51,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:42:51,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:51,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:42:51,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:42:51,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-01-09 16:42:51,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 191 transitions, 2738 flow. Second operand has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 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-01-09 16:42:51,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:51,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-01-09 16:42:51,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:53,302 INFO L124 PetriNetUnfolderBase]: 11627/18961 cut-off events. [2025-01-09 16:42:53,302 INFO L125 PetriNetUnfolderBase]: For 129513/130495 co-relation queries the response was YES. [2025-01-09 16:42:53,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76776 conditions, 18961 events. 11627/18961 cut-off events. For 129513/130495 co-relation queries the response was YES. Maximal size of possible extension queue 1016. Compared 144097 event pairs, 2866 based on Foata normal form. 670/18974 useless extension candidates. Maximal degree in co-relation 61763. Up to 7010 conditions per place. [2025-01-09 16:42:53,386 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 110 selfloop transitions, 136 changer transitions 18/288 dead transitions. [2025-01-09 16:42:53,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 288 transitions, 3743 flow [2025-01-09 16:42:53,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:42:53,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:42:53,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 435 transitions. [2025-01-09 16:42:53,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.614406779661017 [2025-01-09 16:42:53,388 INFO L175 Difference]: Start difference. First operand has 119 places, 191 transitions, 2738 flow. Second operand 12 states and 435 transitions. [2025-01-09 16:42:53,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 288 transitions, 3743 flow [2025-01-09 16:42:53,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 288 transitions, 3559 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-01-09 16:42:53,507 INFO L231 Difference]: Finished difference. Result has 127 places, 190 transitions, 2782 flow [2025-01-09 16:42:53,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2580, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2782, PETRI_PLACES=127, PETRI_TRANSITIONS=190} [2025-01-09 16:42:53,508 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 63 predicate places. [2025-01-09 16:42:53,508 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 190 transitions, 2782 flow [2025-01-09 16:42:53,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 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-01-09 16:42:53,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:53,508 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-01-09 16:42:53,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:42:53,509 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:42:53,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:53,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1616034583, now seen corresponding path program 10 times [2025-01-09 16:42:53,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:53,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106192379] [2025-01-09 16:42:53,510 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:42:53,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:53,517 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-01-09 16:42:53,524 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 16:42:53,525 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:42:53,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:53,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:53,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106192379] [2025-01-09 16:42:53,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106192379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:53,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:53,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:42:53,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205008501] [2025-01-09 16:42:53,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:53,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:42:53,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:53,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:42:53,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:42:53,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-01-09 16:42:53,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 190 transitions, 2782 flow. Second operand has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 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-01-09 16:42:53,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:53,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-01-09 16:42:53,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:55,609 INFO L124 PetriNetUnfolderBase]: 11595/18937 cut-off events. [2025-01-09 16:42:55,609 INFO L125 PetriNetUnfolderBase]: For 145920/146700 co-relation queries the response was YES. [2025-01-09 16:42:55,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78317 conditions, 18937 events. 11595/18937 cut-off events. For 145920/146700 co-relation queries the response was YES. Maximal size of possible extension queue 1011. Compared 144326 event pairs, 3080 based on Foata normal form. 412/18659 useless extension candidates. Maximal degree in co-relation 62831. Up to 7053 conditions per place. [2025-01-09 16:42:55,697 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 94 selfloop transitions, 128 changer transitions 50/296 dead transitions. [2025-01-09 16:42:55,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 296 transitions, 3955 flow [2025-01-09 16:42:55,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:42:55,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:42:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 438 transitions. [2025-01-09 16:42:55,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6186440677966102 [2025-01-09 16:42:55,699 INFO L175 Difference]: Start difference. First operand has 127 places, 190 transitions, 2782 flow. Second operand 12 states and 438 transitions. [2025-01-09 16:42:55,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 296 transitions, 3955 flow [2025-01-09 16:42:55,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 296 transitions, 3697 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-01-09 16:42:55,824 INFO L231 Difference]: Finished difference. Result has 132 places, 181 transitions, 2659 flow [2025-01-09 16:42:55,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2545, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2659, PETRI_PLACES=132, PETRI_TRANSITIONS=181} [2025-01-09 16:42:55,824 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 68 predicate places. [2025-01-09 16:42:55,825 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 181 transitions, 2659 flow [2025-01-09 16:42:55,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 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-01-09 16:42:55,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:55,825 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-01-09 16:42:55,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:42:55,825 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:42:55,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:55,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1751130347, now seen corresponding path program 3 times [2025-01-09 16:42:55,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:55,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937069698] [2025-01-09 16:42:55,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:42:55,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:55,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 1 equivalence classes. [2025-01-09 16:42:55,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 16:42:55,836 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:42:55,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:55,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:55,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:55,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937069698] [2025-01-09 16:42:55,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937069698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:55,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:55,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:42:55,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869258337] [2025-01-09 16:42:55,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:55,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:42:55,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:55,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:42:55,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:42:55,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-01-09 16:42:55,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 181 transitions, 2659 flow. Second operand has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 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-01-09 16:42:55,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:55,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-01-09 16:42:55,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:57,667 INFO L124 PetriNetUnfolderBase]: 11384/18738 cut-off events. [2025-01-09 16:42:57,667 INFO L125 PetriNetUnfolderBase]: For 149931/150935 co-relation queries the response was YES. [2025-01-09 16:42:57,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77816 conditions, 18738 events. 11384/18738 cut-off events. For 149931/150935 co-relation queries the response was YES. Maximal size of possible extension queue 999. Compared 144227 event pairs, 3035 based on Foata normal form. 614/18734 useless extension candidates. Maximal degree in co-relation 62463. Up to 6965 conditions per place. [2025-01-09 16:42:57,741 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 103 selfloop transitions, 128 changer transitions 33/288 dead transitions. [2025-01-09 16:42:57,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 288 transitions, 3830 flow [2025-01-09 16:42:57,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:42:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:42:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 438 transitions. [2025-01-09 16:42:57,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6186440677966102 [2025-01-09 16:42:57,743 INFO L175 Difference]: Start difference. First operand has 132 places, 181 transitions, 2659 flow. Second operand 12 states and 438 transitions. [2025-01-09 16:42:57,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 288 transitions, 3830 flow [2025-01-09 16:42:57,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 288 transitions, 3530 flow, removed 9 selfloop flow, removed 9 redundant places. [2025-01-09 16:42:57,857 INFO L231 Difference]: Finished difference. Result has 133 places, 180 transitions, 2605 flow [2025-01-09 16:42:57,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2401, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2605, PETRI_PLACES=133, PETRI_TRANSITIONS=180} [2025-01-09 16:42:57,858 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 69 predicate places. [2025-01-09 16:42:57,858 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 180 transitions, 2605 flow [2025-01-09 16:42:57,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 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-01-09 16:42:57,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:57,858 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-01-09 16:42:57,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:42:57,858 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:42:57,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:57,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1735540055, now seen corresponding path program 2 times [2025-01-09 16:42:57,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:57,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284976095] [2025-01-09 16:42:57,859 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:42:57,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:57,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-01-09 16:42:57,868 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 16:42:57,868 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:42:57,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:57,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:57,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:57,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284976095] [2025-01-09 16:42:57,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284976095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:57,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:57,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:42:57,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735495005] [2025-01-09 16:42:57,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:57,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:42:57,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:57,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:42:57,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:42:57,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-01-09 16:42:57,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 180 transitions, 2605 flow. Second operand has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 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-01-09 16:42:57,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:57,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-01-09 16:42:57,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:58,627 INFO L124 PetriNetUnfolderBase]: 3893/6605 cut-off events. [2025-01-09 16:42:58,627 INFO L125 PetriNetUnfolderBase]: For 41575/41953 co-relation queries the response was YES. [2025-01-09 16:42:58,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27678 conditions, 6605 events. 3893/6605 cut-off events. For 41575/41953 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 43186 event pairs, 1185 based on Foata normal form. 616/7119 useless extension candidates. Maximal degree in co-relation 27618. Up to 2436 conditions per place. [2025-01-09 16:42:58,647 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 0 selfloop transitions, 0 changer transitions 227/227 dead transitions. [2025-01-09 16:42:58,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 227 transitions, 3061 flow [2025-01-09 16:42:58,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:42:58,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:42:58,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 415 transitions. [2025-01-09 16:42:58,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5861581920903954 [2025-01-09 16:42:58,649 INFO L175 Difference]: Start difference. First operand has 133 places, 180 transitions, 2605 flow. Second operand 12 states and 415 transitions. [2025-01-09 16:42:58,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 227 transitions, 3061 flow [2025-01-09 16:42:58,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 227 transitions, 2997 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-01-09 16:42:58,685 INFO L231 Difference]: Finished difference. Result has 133 places, 0 transitions, 0 flow [2025-01-09 16:42:58,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2105, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=0, PETRI_PLACES=133, PETRI_TRANSITIONS=0} [2025-01-09 16:42:58,685 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 69 predicate places. [2025-01-09 16:42:58,685 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 0 transitions, 0 flow [2025-01-09 16:42:58,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 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-01-09 16:42:58,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-01-09 16:42:58,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-01-09 16:42:58,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-01-09 16:42:58,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-01-09 16:42:58,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-01-09 16:42:58,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:42:58,689 INFO L422 BasicCegarLoop]: Path program histogram: [10, 3, 2, 1] [2025-01-09 16:42:58,692 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:42:58,692 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:42:58,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:42:58 BasicIcfg [2025-01-09 16:42:58,696 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:42:58,697 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:42:58,697 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:42:58,697 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:42:58,697 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:42:15" (3/4) ... [2025-01-09 16:42:58,699 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 16:42:58,701 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 16:42:58,701 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 16:42:58,701 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 16:42:58,701 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-01-09 16:42:58,705 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 77 nodes and edges [2025-01-09 16:42:58,705 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-01-09 16:42:58,706 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 16:42:58,707 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 16:42:58,765 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:42:58,765 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:42:58,765 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:42:58,766 INFO L158 Benchmark]: Toolchain (without parser) took 44683.45ms. Allocated memory was 142.6MB in the beginning and 13.2GB in the end (delta: 13.1GB). Free memory was 113.3MB in the beginning and 9.8GB in the end (delta: -9.7GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. [2025-01-09 16:42:58,766 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:42:58,766 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.65ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 101.4MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:42:58,767 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.80ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 99.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:42:58,767 INFO L158 Benchmark]: Boogie Preprocessor took 58.52ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 98.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:42:58,767 INFO L158 Benchmark]: RCFGBuilder took 596.96ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 64.5MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 16:42:58,767 INFO L158 Benchmark]: TraceAbstraction took 43660.13ms. Allocated memory was 142.6MB in the beginning and 13.2GB in the end (delta: 13.1GB). Free memory was 64.0MB in the beginning and 9.8GB in the end (delta: -9.8GB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. [2025-01-09 16:42:58,768 INFO L158 Benchmark]: Witness Printer took 68.80ms. Allocated memory is still 13.2GB. Free memory was 9.8GB in the beginning and 9.8GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:42:58,769 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.65ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 101.4MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.80ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 99.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.52ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 98.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 596.96ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 64.5MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 43660.13ms. Allocated memory was 142.6MB in the beginning and 13.2GB in the end (delta: 13.1GB). Free memory was 64.0MB in the beginning and 9.8GB in the end (delta: -9.8GB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. * Witness Printer took 68.80ms. Allocated memory is still 13.2GB. Free memory was 9.8GB in the beginning and 9.8GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 107]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 93 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 43.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 40.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1068 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1055 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 288 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4667 IncrementalHoareTripleChecker+Invalid, 4955 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 288 mSolverCounterUnsat, 6 mSDtfsCounter, 4667 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2782occurred in iteration=11, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 783 NumberOfCodeBlocks, 783 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 767 ConstructedInterpolants, 0 QuantifiedInterpolants, 1940 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 16:42:58,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE