./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-threaded-sum-3.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/popl20-threaded-sum-3.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 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:48:36,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:48:36,503 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:48:36,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:48:36,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:48:36,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:48:36,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:48:36,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:48:36,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:48:36,530 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:48:36,530 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:48:36,530 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:48:36,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:48:36,531 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:48:36,531 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:48:36,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:48:36,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:48:36,531 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:48:36,531 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:48:36,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:48:36,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:48:36,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:48:36,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:48:36,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:48:36,531 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:48:36,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:48:36,531 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:48:36,531 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:48:36,532 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:48:36,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:48:36,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:48:36,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:48:36,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:48:36,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:48:36,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:48:36,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:48:36,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:48:36,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:48:36,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:48:36,532 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:48:36,532 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:48:36,532 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:48:36,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:48:36,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:48:36,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:48:36,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:48:36,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:48:36,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:48:36,533 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 -> 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 [2025-01-09 16:48:36,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:48:36,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:48:36,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:48:36,804 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:48:36,804 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:48:36,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2025-01-09 16:48:37,930 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c54b5d2b/9a15c743264948318a148ae63f89f22f/FLAG2bdb99b62 [2025-01-09 16:48:38,196 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:48:38,201 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2025-01-09 16:48:38,208 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c54b5d2b/9a15c743264948318a148ae63f89f22f/FLAG2bdb99b62 [2025-01-09 16:48:38,499 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c54b5d2b/9a15c743264948318a148ae63f89f22f [2025-01-09 16:48:38,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:48:38,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:48:38,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:48:38,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:48:38,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:48:38,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:48:38" (1/1) ... [2025-01-09 16:48:38,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b49b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:38, skipping insertion in model container [2025-01-09 16:48:38,507 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:48:38" (1/1) ... [2025-01-09 16:48:38,518 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:48:38,651 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c[2996,3009] [2025-01-09 16:48:38,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:48:38,662 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:48:38,682 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c[2996,3009] [2025-01-09 16:48:38,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:48:38,696 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:48:38,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:38 WrapperNode [2025-01-09 16:48:38,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:48:38,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:48:38,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:48:38,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:48:38,703 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:48:38" (1/1) ... [2025-01-09 16:48:38,709 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:48:38" (1/1) ... [2025-01-09 16:48:38,721 INFO L138 Inliner]: procedures = 21, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2025-01-09 16:48:38,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:48:38,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:48:38,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:48:38,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:48:38,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:38" (1/1) ... [2025-01-09 16:48:38,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:38" (1/1) ... [2025-01-09 16:48:38,731 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:38" (1/1) ... [2025-01-09 16:48:38,748 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:48:38,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:38" (1/1) ... [2025-01-09 16:48:38,750 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:38" (1/1) ... [2025-01-09 16:48:38,752 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:38" (1/1) ... [2025-01-09 16:48:38,753 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:38" (1/1) ... [2025-01-09 16:48:38,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:38" (1/1) ... [2025-01-09 16:48:38,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:38" (1/1) ... [2025-01-09 16:48:38,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:38" (1/1) ... [2025-01-09 16:48:38,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:48:38,758 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:48:38,758 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:48:38,758 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:48:38,758 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:38" (1/1) ... [2025-01-09 16:48:38,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:48:38,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:48:38,784 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:48:38,790 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:48:38,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:48:38,804 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:48:38,804 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:48:38,804 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:48:38,804 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:48:38,804 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:48:38,804 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:48:38,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:48:38,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:48:38,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:48:38,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:48:38,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:48:38,805 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:48:38,874 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:48:38,876 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:48:39,063 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:48:39,063 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:48:39,178 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:48:39,179 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:48:39,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:48:39 BoogieIcfgContainer [2025-01-09 16:48:39,179 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:48:39,181 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:48:39,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:48:39,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:48:39,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:48:38" (1/3) ... [2025-01-09 16:48:39,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e060c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:48:39, skipping insertion in model container [2025-01-09 16:48:39,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:38" (2/3) ... [2025-01-09 16:48:39,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e060c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:48:39, skipping insertion in model container [2025-01-09 16:48:39,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:48:39" (3/3) ... [2025-01-09 16:48:39,188 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-threaded-sum-3.wvr.c [2025-01-09 16:48:39,198 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:48:39,199 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-threaded-sum-3.wvr.c that has 4 procedures, 33 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-09 16:48:39,199 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:48:39,248 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:48:39,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 91 flow [2025-01-09 16:48:39,307 INFO L124 PetriNetUnfolderBase]: 3/32 cut-off events. [2025-01-09 16:48:39,309 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:48:39,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 3/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2025-01-09 16:48:39,314 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 35 transitions, 91 flow [2025-01-09 16:48:39,316 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 31 transitions, 80 flow [2025-01-09 16:48:39,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:48:39,334 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;@6bdaacb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:48:39,334 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:48:39,345 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:48:39,345 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2025-01-09 16:48:39,345 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:48:39,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:39,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:39,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:48:39,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:39,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1407512258, now seen corresponding path program 1 times [2025-01-09 16:48:39,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:39,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513810774] [2025-01-09 16:48:39,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:39,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:39,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 16:48:39,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 16:48:39,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:39,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:39,911 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:48:39,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:39,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513810774] [2025-01-09 16:48:39,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513810774] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:48:39,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:48:39,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:48:39,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55303174] [2025-01-09 16:48:39,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:39,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:48:39,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:39,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:48:39,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:48:39,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-01-09 16:48:39,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:39,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:39,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-01-09 16:48:39,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:40,151 INFO L124 PetriNetUnfolderBase]: 367/655 cut-off events. [2025-01-09 16:48:40,152 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-01-09 16:48:40,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1264 conditions, 655 events. 367/655 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3393 event pairs, 26 based on Foata normal form. 20/661 useless extension candidates. Maximal degree in co-relation 1074. Up to 445 conditions per place. [2025-01-09 16:48:40,160 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 33 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2025-01-09 16:48:40,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 204 flow [2025-01-09 16:48:40,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:48:40,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:48:40,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-01-09 16:48:40,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2025-01-09 16:48:40,174 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 80 flow. Second operand 4 states and 95 transitions. [2025-01-09 16:48:40,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 204 flow [2025-01-09 16:48:40,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 49 transitions, 184 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:48:40,184 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 100 flow [2025-01-09 16:48:40,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2025-01-09 16:48:40,189 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2025-01-09 16:48:40,190 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 100 flow [2025-01-09 16:48:40,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:40,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:40,190 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:40,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:48:40,191 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:48:40,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:40,191 INFO L85 PathProgramCache]: Analyzing trace with hash 119125651, now seen corresponding path program 1 times [2025-01-09 16:48:40,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:40,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619413238] [2025-01-09 16:48:40,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:40,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:40,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:48:40,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:48:40,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:40,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:40,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:48:40,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:40,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619413238] [2025-01-09 16:48:40,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619413238] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:48:40,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:48:40,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:48:40,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954363915] [2025-01-09 16:48:40,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:40,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:48:40,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:40,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:48:40,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:48:40,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-01-09 16:48:40,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:48:40,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:40,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-01-09 16:48:40,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:40,665 INFO L124 PetriNetUnfolderBase]: 407/690 cut-off events. [2025-01-09 16:48:40,666 INFO L125 PetriNetUnfolderBase]: For 206/234 co-relation queries the response was YES. [2025-01-09 16:48:40,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1533 conditions, 690 events. 407/690 cut-off events. For 206/234 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3110 event pairs, 41 based on Foata normal form. 36/708 useless extension candidates. Maximal degree in co-relation 1296. Up to 519 conditions per place. [2025-01-09 16:48:40,673 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 31 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2025-01-09 16:48:40,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 222 flow [2025-01-09 16:48:40,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:48:40,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:48:40,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2025-01-09 16:48:40,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6714285714285714 [2025-01-09 16:48:40,674 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 100 flow. Second operand 4 states and 94 transitions. [2025-01-09 16:48:40,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 222 flow [2025-01-09 16:48:40,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 222 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:48:40,676 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 146 flow [2025-01-09 16:48:40,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2025-01-09 16:48:40,677 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2025-01-09 16:48:40,677 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 146 flow [2025-01-09 16:48:40,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:48:40,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:40,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:40,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:48:40,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:48:40,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:40,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1635698915, now seen corresponding path program 2 times [2025-01-09 16:48:40,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:40,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582679337] [2025-01-09 16:48:40,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:48:40,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:40,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:48:40,690 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:48:40,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:48:40,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:40,932 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:48:40,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:40,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582679337] [2025-01-09 16:48:40,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582679337] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:48:40,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:48:40,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:48:40,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971630062] [2025-01-09 16:48:40,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:40,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:48:40,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:40,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:48:40,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:48:40,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-01-09 16:48:40,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 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:48:40,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:40,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-01-09 16:48:40,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:41,392 INFO L124 PetriNetUnfolderBase]: 1237/1874 cut-off events. [2025-01-09 16:48:41,393 INFO L125 PetriNetUnfolderBase]: For 650/695 co-relation queries the response was YES. [2025-01-09 16:48:41,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4444 conditions, 1874 events. 1237/1874 cut-off events. For 650/695 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 9279 event pairs, 117 based on Foata normal form. 83/1936 useless extension candidates. Maximal degree in co-relation 2038. Up to 641 conditions per place. [2025-01-09 16:48:41,403 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 81 selfloop transitions, 35 changer transitions 0/124 dead transitions. [2025-01-09 16:48:41,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 124 transitions, 605 flow [2025-01-09 16:48:41,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:48:41,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:48:41,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 225 transitions. [2025-01-09 16:48:41,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-01-09 16:48:41,405 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 146 flow. Second operand 10 states and 225 transitions. [2025-01-09 16:48:41,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 124 transitions, 605 flow [2025-01-09 16:48:41,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 124 transitions, 598 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:48:41,408 INFO L231 Difference]: Finished difference. Result has 56 places, 66 transitions, 380 flow [2025-01-09 16:48:41,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=380, PETRI_PLACES=56, PETRI_TRANSITIONS=66} [2025-01-09 16:48:41,409 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 18 predicate places. [2025-01-09 16:48:41,409 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 66 transitions, 380 flow [2025-01-09 16:48:41,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 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:48:41,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:41,409 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:41,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:48:41,410 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:48:41,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:41,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1790479239, now seen corresponding path program 3 times [2025-01-09 16:48:41,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:41,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035383760] [2025-01-09 16:48:41,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:48:41,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:41,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:48:41,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:48:41,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:48:41,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:41,605 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:48:41,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:41,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035383760] [2025-01-09 16:48:41,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035383760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:48:41,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:48:41,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:48:41,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226640699] [2025-01-09 16:48:41,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:41,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:48:41,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:41,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:48:41,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:48:41,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-01-09 16:48:41,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 66 transitions, 380 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:48:41,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:41,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-01-09 16:48:41,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:41,736 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([279] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0) (= (mod v_thread1Thread1of1ForFork0_~cond~0_5 256) 0)) InVars {thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_5} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][50], [26#L64true, 59#true, 36#L112-4true, Black: 75#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= 1 thread1Thread1of1ForFork0_~cond~0) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 69#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 61#(or (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0))), 10#thread1EXITtrue, Black: 73#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0))) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 64#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 17#L88true, Black: 71#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork0_~cond~0 1) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 47#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 48#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 53#(and (<= (+ ~T~0 1) (+ ~t~0 (mod ~T~0 4294967296))) (<= (+ ~t~0 (mod ~T~0 4294967296)) (+ 4294967295 ~T~0))), Black: 56#(and (<= (+ ~T~0 1) (+ ~t~0 (mod ~T~0 4294967296))) (= thread1Thread1of1ForFork0_~cond~0 1) (<= (+ ~t~0 (mod ~T~0 4294967296)) (+ 4294967295 ~T~0))), 45#true, 82#true]) [2025-01-09 16:48:41,737 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-01-09 16:48:41,737 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-01-09 16:48:41,737 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-01-09 16:48:41,737 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:48:41,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([279] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0) (= (mod v_thread1Thread1of1ForFork0_~cond~0_5 256) 0)) InVars {thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_5} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][50], [26#L64true, 59#true, 36#L112-4true, Black: 75#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= 1 thread1Thread1of1ForFork0_~cond~0) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 69#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 61#(or (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0))), 10#thread1EXITtrue, Black: 73#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0))) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 64#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 71#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork0_~cond~0 1) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 47#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 48#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 53#(and (<= (+ ~T~0 1) (+ ~t~0 (mod ~T~0 4294967296))) (<= (+ ~t~0 (mod ~T~0 4294967296)) (+ 4294967295 ~T~0))), 31#L91true, Black: 56#(and (<= (+ ~T~0 1) (+ ~t~0 (mod ~T~0 4294967296))) (= thread1Thread1of1ForFork0_~cond~0 1) (<= (+ ~t~0 (mod ~T~0 4294967296)) (+ 4294967295 ~T~0))), 45#true, 82#true]) [2025-01-09 16:48:41,741 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is not cut-off event [2025-01-09 16:48:41,742 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-01-09 16:48:41,742 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2025-01-09 16:48:41,742 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-01-09 16:48:41,758 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([279] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0) (= (mod v_thread1Thread1of1ForFork0_~cond~0_5 256) 0)) InVars {thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_5} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][50], [26#L64true, 59#true, Black: 75#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= 1 thread1Thread1of1ForFork0_~cond~0) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 69#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 61#(or (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0))), 10#thread1EXITtrue, Black: 73#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0))) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 64#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 17#L88true, Black: 71#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork0_~cond~0 1) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 47#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 48#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)), 12#L113true, Black: 53#(and (<= (+ ~T~0 1) (+ ~t~0 (mod ~T~0 4294967296))) (<= (+ ~t~0 (mod ~T~0 4294967296)) (+ 4294967295 ~T~0))), Black: 56#(and (<= (+ ~T~0 1) (+ ~t~0 (mod ~T~0 4294967296))) (= thread1Thread1of1ForFork0_~cond~0 1) (<= (+ ~t~0 (mod ~T~0 4294967296)) (+ 4294967295 ~T~0))), 45#true, 82#true]) [2025-01-09 16:48:41,758 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-01-09 16:48:41,758 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:48:41,759 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-01-09 16:48:41,759 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-01-09 16:48:41,760 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([279] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0) (= (mod v_thread1Thread1of1ForFork0_~cond~0_5 256) 0)) InVars {thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_5} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][50], [24#thread3EXITtrue, 26#L64true, 59#true, 36#L112-4true, Black: 75#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= 1 thread1Thread1of1ForFork0_~cond~0) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 69#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 61#(or (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0))), 10#thread1EXITtrue, Black: 73#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0))) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 64#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 47#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 71#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork0_~cond~0 1) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 48#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 53#(and (<= (+ ~T~0 1) (+ ~t~0 (mod ~T~0 4294967296))) (<= (+ ~t~0 (mod ~T~0 4294967296)) (+ 4294967295 ~T~0))), Black: 56#(and (<= (+ ~T~0 1) (+ ~t~0 (mod ~T~0 4294967296))) (= thread1Thread1of1ForFork0_~cond~0 1) (<= (+ ~t~0 (mod ~T~0 4294967296)) (+ 4294967295 ~T~0))), 45#true, 82#true]) [2025-01-09 16:48:41,760 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-01-09 16:48:41,760 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-01-09 16:48:41,760 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:48:41,760 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-01-09 16:48:41,763 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([279] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0) (= (mod v_thread1Thread1of1ForFork0_~cond~0_5 256) 0)) InVars {thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_5} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][50], [26#L64true, 59#true, Black: 75#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= 1 thread1Thread1of1ForFork0_~cond~0) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 69#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 61#(or (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0))), 10#thread1EXITtrue, Black: 73#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0))) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 64#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 71#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork0_~cond~0 1) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 47#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 48#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)), 12#L113true, Black: 53#(and (<= (+ ~T~0 1) (+ ~t~0 (mod ~T~0 4294967296))) (<= (+ ~t~0 (mod ~T~0 4294967296)) (+ 4294967295 ~T~0))), 31#L91true, Black: 56#(and (<= (+ ~T~0 1) (+ ~t~0 (mod ~T~0 4294967296))) (= thread1Thread1of1ForFork0_~cond~0 1) (<= (+ ~t~0 (mod ~T~0 4294967296)) (+ 4294967295 ~T~0))), 45#true, 82#true]) [2025-01-09 16:48:41,763 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event [2025-01-09 16:48:41,763 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-01-09 16:48:41,764 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-01-09 16:48:41,764 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2025-01-09 16:48:41,778 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([279] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0) (= (mod v_thread1Thread1of1ForFork0_~cond~0_5 256) 0)) InVars {thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_5} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][50], [24#thread3EXITtrue, 26#L64true, 59#true, Black: 75#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= 1 thread1Thread1of1ForFork0_~cond~0) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 69#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 61#(or (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0))), 10#thread1EXITtrue, Black: 73#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0))) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 64#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 71#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork0_~cond~0 1) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 47#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 48#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)), 12#L113true, Black: 53#(and (<= (+ ~T~0 1) (+ ~t~0 (mod ~T~0 4294967296))) (<= (+ ~t~0 (mod ~T~0 4294967296)) (+ 4294967295 ~T~0))), Black: 56#(and (<= (+ ~T~0 1) (+ ~t~0 (mod ~T~0 4294967296))) (= thread1Thread1of1ForFork0_~cond~0 1) (<= (+ ~t~0 (mod ~T~0 4294967296)) (+ 4294967295 ~T~0))), 45#true, 82#true]) [2025-01-09 16:48:41,778 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-01-09 16:48:41,778 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:48:41,779 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:48:41,779 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:48:41,790 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([279] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0) (= (mod v_thread1Thread1of1ForFork0_~cond~0_5 256) 0)) InVars {thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_5} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][50], [26#L64true, 20#L85true, 59#true, 36#L112-4true, Black: 75#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= 1 thread1Thread1of1ForFork0_~cond~0) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 69#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 61#(or (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0))), 10#thread1EXITtrue, Black: 73#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0))) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 64#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 47#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 71#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork0_~cond~0 1) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 48#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 53#(and (<= (+ ~T~0 1) (+ ~t~0 (mod ~T~0 4294967296))) (<= (+ ~t~0 (mod ~T~0 4294967296)) (+ 4294967295 ~T~0))), Black: 56#(and (<= (+ ~T~0 1) (+ ~t~0 (mod ~T~0 4294967296))) (= thread1Thread1of1ForFork0_~cond~0 1) (<= (+ ~t~0 (mod ~T~0 4294967296)) (+ 4294967295 ~T~0))), 45#true, 82#true]) [2025-01-09 16:48:41,790 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-01-09 16:48:41,790 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:48:41,790 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:48:41,790 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:48:41,804 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([279] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0) (= (mod v_thread1Thread1of1ForFork0_~cond~0_5 256) 0)) InVars {thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_5} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][50], [26#L64true, 20#L85true, 59#true, Black: 75#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= 1 thread1Thread1of1ForFork0_~cond~0) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 69#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 61#(or (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0))), 10#thread1EXITtrue, Black: 73#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0))) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 64#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 47#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 71#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork0_~cond~0 1) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 48#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork1_~cond~1 1)), 12#L113true, Black: 53#(and (<= (+ ~T~0 1) (+ ~t~0 (mod ~T~0 4294967296))) (<= (+ ~t~0 (mod ~T~0 4294967296)) (+ 4294967295 ~T~0))), Black: 56#(and (<= (+ ~T~0 1) (+ ~t~0 (mod ~T~0 4294967296))) (= thread1Thread1of1ForFork0_~cond~0 1) (<= (+ ~t~0 (mod ~T~0 4294967296)) (+ 4294967295 ~T~0))), 45#true, 82#true]) [2025-01-09 16:48:41,804 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-01-09 16:48:41,805 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:48:41,805 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:48:41,805 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:48:41,817 INFO L124 PetriNetUnfolderBase]: 1360/2129 cut-off events. [2025-01-09 16:48:41,818 INFO L125 PetriNetUnfolderBase]: For 4709/4865 co-relation queries the response was YES. [2025-01-09 16:48:41,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6984 conditions, 2129 events. 1360/2129 cut-off events. For 4709/4865 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 12091 event pairs, 122 based on Foata normal form. 82/2040 useless extension candidates. Maximal degree in co-relation 3994. Up to 1169 conditions per place. [2025-01-09 16:48:41,834 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 69 selfloop transitions, 9 changer transitions 0/102 dead transitions. [2025-01-09 16:48:41,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 102 transitions, 753 flow [2025-01-09 16:48:41,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:48:41,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:48:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-01-09 16:48:41,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6642857142857143 [2025-01-09 16:48:41,837 INFO L175 Difference]: Start difference. First operand has 56 places, 66 transitions, 380 flow. Second operand 4 states and 93 transitions. [2025-01-09 16:48:41,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 102 transitions, 753 flow [2025-01-09 16:48:41,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 102 transitions, 713 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-01-09 16:48:41,854 INFO L231 Difference]: Finished difference. Result has 58 places, 73 transitions, 432 flow [2025-01-09 16:48:41,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=432, PETRI_PLACES=58, PETRI_TRANSITIONS=73} [2025-01-09 16:48:41,855 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2025-01-09 16:48:41,856 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 73 transitions, 432 flow [2025-01-09 16:48:41,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:48:41,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:41,856 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] [2025-01-09 16:48:41,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:48:41,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:48:41,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:41,858 INFO L85 PathProgramCache]: Analyzing trace with hash 812707207, now seen corresponding path program 1 times [2025-01-09 16:48:41,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:41,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792797506] [2025-01-09 16:48:41,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:41,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:41,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:48:41,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:48:41,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:41,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:42,058 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:48:42,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:42,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792797506] [2025-01-09 16:48:42,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792797506] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:48:42,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:48:42,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:48:42,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446549891] [2025-01-09 16:48:42,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:42,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:48:42,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:42,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:48:42,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:48:42,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-01-09 16:48:42,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 73 transitions, 432 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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:48:42,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:42,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-01-09 16:48:42,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:42,289 INFO L124 PetriNetUnfolderBase]: 1490/2377 cut-off events. [2025-01-09 16:48:42,289 INFO L125 PetriNetUnfolderBase]: For 5059/5208 co-relation queries the response was YES. [2025-01-09 16:48:42,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8146 conditions, 2377 events. 1490/2377 cut-off events. For 5059/5208 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 13874 event pairs, 272 based on Foata normal form. 106/2397 useless extension candidates. Maximal degree in co-relation 4782. Up to 1470 conditions per place. [2025-01-09 16:48:42,304 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 67 selfloop transitions, 11 changer transitions 0/98 dead transitions. [2025-01-09 16:48:42,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 98 transitions, 691 flow [2025-01-09 16:48:42,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:48:42,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:48:42,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2025-01-09 16:48:42,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6514285714285715 [2025-01-09 16:48:42,306 INFO L175 Difference]: Start difference. First operand has 58 places, 73 transitions, 432 flow. Second operand 5 states and 114 transitions. [2025-01-09 16:48:42,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 98 transitions, 691 flow [2025-01-09 16:48:42,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 98 transitions, 679 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:48:42,315 INFO L231 Difference]: Finished difference. Result has 61 places, 75 transitions, 467 flow [2025-01-09 16:48:42,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=467, PETRI_PLACES=61, PETRI_TRANSITIONS=75} [2025-01-09 16:48:42,316 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 23 predicate places. [2025-01-09 16:48:42,316 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 75 transitions, 467 flow [2025-01-09 16:48:42,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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:48:42,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:42,317 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] [2025-01-09 16:48:42,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:48:42,317 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:48:42,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:42,319 INFO L85 PathProgramCache]: Analyzing trace with hash 633137493, now seen corresponding path program 2 times [2025-01-09 16:48:42,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:42,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289085545] [2025-01-09 16:48:42,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:48:42,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:42,326 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:48:42,337 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:48:42,340 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:48:42,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:42,458 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:48:42,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:42,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289085545] [2025-01-09 16:48:42,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289085545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:48:42,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:48:42,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:48:42,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144261894] [2025-01-09 16:48:42,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:42,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:48:42,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:42,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:48:42,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:48:42,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-01-09 16:48:42,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 75 transitions, 467 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:48:42,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:42,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-01-09 16:48:42,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:42,829 INFO L124 PetriNetUnfolderBase]: 2582/4012 cut-off events. [2025-01-09 16:48:42,829 INFO L125 PetriNetUnfolderBase]: For 9408/9660 co-relation queries the response was YES. [2025-01-09 16:48:42,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14335 conditions, 4012 events. 2582/4012 cut-off events. For 9408/9660 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 23996 event pairs, 387 based on Foata normal form. 223/4075 useless extension candidates. Maximal degree in co-relation 8421. Up to 2172 conditions per place. [2025-01-09 16:48:42,858 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 135 selfloop transitions, 20 changer transitions 0/174 dead transitions. [2025-01-09 16:48:42,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 174 transitions, 1385 flow [2025-01-09 16:48:42,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:48:42,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:48:42,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-01-09 16:48:42,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.72 [2025-01-09 16:48:42,861 INFO L175 Difference]: Start difference. First operand has 61 places, 75 transitions, 467 flow. Second operand 5 states and 126 transitions. [2025-01-09 16:48:42,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 174 transitions, 1385 flow [2025-01-09 16:48:42,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 174 transitions, 1361 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:48:42,906 INFO L231 Difference]: Finished difference. Result has 65 places, 91 transitions, 666 flow [2025-01-09 16:48:42,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=666, PETRI_PLACES=65, PETRI_TRANSITIONS=91} [2025-01-09 16:48:42,908 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 27 predicate places. [2025-01-09 16:48:42,908 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 91 transitions, 666 flow [2025-01-09 16:48:42,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:48:42,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:42,908 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] [2025-01-09 16:48:42,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:48:42,908 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:48:42,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:42,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1509048656, now seen corresponding path program 1 times [2025-01-09 16:48:42,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:42,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059589776] [2025-01-09 16:48:42,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:42,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:42,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:48:42,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:48:42,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:42,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:48:44,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:44,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059589776] [2025-01-09 16:48:44,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059589776] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:44,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317765831] [2025-01-09 16:48:44,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:44,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:44,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:48:44,077 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:48:44,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:48:44,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:48:44,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:48:44,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:44,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:44,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 16:48:44,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:48:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:48:49,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:49:11,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:11,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317765831] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:49:11,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:49:11,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2025-01-09 16:49:11,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774611670] [2025-01-09 16:49:11,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:49:11,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 16:49:11,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:11,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 16:49:11,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=555, Unknown=6, NotChecked=0, Total=702 [2025-01-09 16:49:15,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 16:49:19,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 16:49:23,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 16:49:27,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 16:49:27,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-01-09 16:49:27,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 91 transitions, 666 flow. Second operand has 27 states, 27 states have (on average 10.666666666666666) internal successors, (288), 27 states have internal predecessors, (288), 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:49:27,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:27,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-01-09 16:49:27,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:56,366 WARN L286 SmtUtils]: Spent 28.29s on a formula simplification. DAG size of input: 79 DAG size of output: 57 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 16:50:00,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []