./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i -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 a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:23:40,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:23:40,313 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:23:40,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:23:40,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:23:40,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:23:40,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:23:40,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:23:40,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:23:40,338 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:23:40,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:23:40,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:23:40,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:23:40,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:23:40,340 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:23:40,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:23:40,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:23:40,340 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:23:40,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:23:40,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:23:40,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:23:40,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:23:40,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:23:40,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:23:40,341 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:23:40,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:23:40,341 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:23:40,341 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:23:40,341 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:23:40,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:23:40,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:23:40,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:23:40,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:23:40,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:23:40,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:23:40,342 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:23:40,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:23:40,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:23:40,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:23:40,343 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:23:40,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:23:40,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:23:40,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:23:40,343 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 -> a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f [2025-02-06 04:23:40,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:23:40,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:23:40,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:23:40,567 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:23:40,568 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:23:40,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2025-02-06 04:23:41,715 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11f86a479/fc6afbfdae2b426e8b7d2e321d6ff267/FLAGb11546d12 [2025-02-06 04:23:42,006 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:23:42,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2025-02-06 04:23:42,029 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11f86a479/fc6afbfdae2b426e8b7d2e321d6ff267/FLAGb11546d12 [2025-02-06 04:23:42,055 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11f86a479/fc6afbfdae2b426e8b7d2e321d6ff267 [2025-02-06 04:23:42,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:23:42,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:23:42,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:23:42,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:23:42,063 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:23:42,064 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:23:42" (1/1) ... [2025-02-06 04:23:42,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fcdaf5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:23:42, skipping insertion in model container [2025-02-06 04:23:42,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:23:42" (1/1) ... [2025-02-06 04:23:42,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:23:42,219 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/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] [2025-02-06 04:23:42,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:23:42,356 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:23:42,363 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/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] [2025-02-06 04:23:42,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:23:42,434 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:23:42,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:23:42 WrapperNode [2025-02-06 04:23:42,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:23:42,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:23:42,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:23:42,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:23:42,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:23:42" (1/1) ... [2025-02-06 04:23:42,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:23:42" (1/1) ... [2025-02-06 04:23:42,467 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2025-02-06 04:23:42,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:23:42,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:23:42,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:23:42,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:23:42,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:23:42" (1/1) ... [2025-02-06 04:23:42,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:23:42" (1/1) ... [2025-02-06 04:23:42,478 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:23:42" (1/1) ... [2025-02-06 04:23:42,490 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 04:23:42,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:23:42" (1/1) ... [2025-02-06 04:23:42,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:23:42" (1/1) ... [2025-02-06 04:23:42,496 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:23:42" (1/1) ... [2025-02-06 04:23:42,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:23:42" (1/1) ... [2025-02-06 04:23:42,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:23:42" (1/1) ... [2025-02-06 04:23:42,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:23:42" (1/1) ... [2025-02-06 04:23:42,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:23:42,501 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:23:42,501 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:23:42,502 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:23:42,502 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:23:42" (1/1) ... [2025-02-06 04:23:42,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:23:42,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:23:42,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:23:42,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:23:42,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:23:42,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:23:42,553 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 04:23:42,553 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 04:23:42,553 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 04:23:42,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 04:23:42,554 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 04:23:42,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 04:23:42,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:23:42,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:23:42,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:23:42,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:23:42,555 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:23:42,655 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:23:42,657 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:23:42,872 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:23:42,872 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:23:43,071 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:23:43,072 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:23:43,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:23:43 BoogieIcfgContainer [2025-02-06 04:23:43,073 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:23:43,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:23:43,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:23:43,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:23:43,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:23:42" (1/3) ... [2025-02-06 04:23:43,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2c9b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:23:43, skipping insertion in model container [2025-02-06 04:23:43,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:23:42" (2/3) ... [2025-02-06 04:23:43,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2c9b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:23:43, skipping insertion in model container [2025-02-06 04:23:43,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:23:43" (3/3) ... [2025-02-06 04:23:43,081 INFO L128 eAbstractionObserver]: Analyzing ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2025-02-06 04:23:43,092 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:23:43,093 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i that has 4 procedures, 39 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-02-06 04:23:43,094 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:23:43,136 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 04:23:43,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2025-02-06 04:23:43,186 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2025-02-06 04:23:43,188 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:23:43,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-02-06 04:23:43,191 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2025-02-06 04:23:43,194 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2025-02-06 04:23:43,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:23:43,211 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;@4ca5497d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:23:43,214 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 04:23:43,220 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:23:43,220 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-06 04:23:43,220 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:23:43,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:23:43,221 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 04:23:43,221 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:23:43,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:23:43,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1830633885, now seen corresponding path program 1 times [2025-02-06 04:23:43,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:23:43,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731432357] [2025-02-06 04:23:43,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:23:43,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:23:43,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 04:23:43,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 04:23:43,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:23:43,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:23:43,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:23:43,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:23:43,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731432357] [2025-02-06 04:23:43,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731432357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:23:43,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:23:43,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 04:23:43,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738439099] [2025-02-06 04:23:43,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:23:43,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:23:43,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:23:43,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:23:43,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:23:43,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-02-06 04:23:43,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:43,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:23:43,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-02-06 04:23:43,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:23:44,470 INFO L124 PetriNetUnfolderBase]: 4235/6144 cut-off events. [2025-02-06 04:23:44,470 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-02-06 04:23:44,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12283 conditions, 6144 events. 4235/6144 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 33562 event pairs, 465 based on Foata normal form. 210/6313 useless extension candidates. Maximal degree in co-relation 12272. Up to 5271 conditions per place. [2025-02-06 04:23:44,506 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 43 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2025-02-06 04:23:44,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 212 flow [2025-02-06 04:23:44,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:23:44,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:23:44,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-02-06 04:23:44,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6581196581196581 [2025-02-06 04:23:44,520 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 77 transitions. [2025-02-06 04:23:44,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 212 flow [2025-02-06 04:23:44,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 208 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 04:23:44,527 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2025-02-06 04:23:44,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2025-02-06 04:23:44,533 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2025-02-06 04:23:44,535 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2025-02-06 04:23:44,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:44,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:23:44,535 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:23:44,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:23:44,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:23:44,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:23:44,537 INFO L85 PathProgramCache]: Analyzing trace with hash -792226051, now seen corresponding path program 1 times [2025-02-06 04:23:44,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:23:44,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297885240] [2025-02-06 04:23:44,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:23:44,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:23:44,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 04:23:44,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:23:44,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:23:44,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:23:45,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:23:45,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:23:45,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297885240] [2025-02-06 04:23:45,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297885240] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:23:45,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:23:45,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:23:45,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899088105] [2025-02-06 04:23:45,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:23:45,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:23:45,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:23:45,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:23:45,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:23:45,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-06 04:23:45,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:45,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:23:45,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-06 04:23:45,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:23:46,361 INFO L124 PetriNetUnfolderBase]: 7467/10854 cut-off events. [2025-02-06 04:23:46,362 INFO L125 PetriNetUnfolderBase]: For 480/480 co-relation queries the response was YES. [2025-02-06 04:23:46,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22104 conditions, 10854 events. 7467/10854 cut-off events. For 480/480 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 62229 event pairs, 707 based on Foata normal form. 0/10615 useless extension candidates. Maximal degree in co-relation 22094. Up to 5408 conditions per place. [2025-02-06 04:23:46,402 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 58 selfloop transitions, 10 changer transitions 116/188 dead transitions. [2025-02-06 04:23:46,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 188 transitions, 780 flow [2025-02-06 04:23:46,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:23:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:23:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 271 transitions. [2025-02-06 04:23:46,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5790598290598291 [2025-02-06 04:23:46,407 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 12 states and 271 transitions. [2025-02-06 04:23:46,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 188 transitions, 780 flow [2025-02-06 04:23:46,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 188 transitions, 756 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:23:46,413 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 200 flow [2025-02-06 04:23:46,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=200, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2025-02-06 04:23:46,414 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places. [2025-02-06 04:23:46,414 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 200 flow [2025-02-06 04:23:46,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:46,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:23:46,414 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:23:46,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:23:46,415 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:23:46,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:23:46,416 INFO L85 PathProgramCache]: Analyzing trace with hash -685617506, now seen corresponding path program 1 times [2025-02-06 04:23:46,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:23:46,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121857349] [2025-02-06 04:23:46,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:23:46,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:23:46,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 04:23:46,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 04:23:46,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:23:46,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:23:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:23:46,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:23:46,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121857349] [2025-02-06 04:23:46,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121857349] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:23:46,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:23:46,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:23:46,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893989937] [2025-02-06 04:23:46,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:23:46,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:23:46,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:23:46,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:23:46,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:23:46,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-06 04:23:46,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 40 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:46,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:23:46,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-06 04:23:46,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:23:47,950 INFO L124 PetriNetUnfolderBase]: 5761/8479 cut-off events. [2025-02-06 04:23:47,951 INFO L125 PetriNetUnfolderBase]: For 16728/16746 co-relation queries the response was YES. [2025-02-06 04:23:47,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29770 conditions, 8479 events. 5761/8479 cut-off events. For 16728/16746 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 45646 event pairs, 1064 based on Foata normal form. 231/8701 useless extension candidates. Maximal degree in co-relation 29749. Up to 5277 conditions per place. [2025-02-06 04:23:48,011 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 57 selfloop transitions, 19 changer transitions 80/160 dead transitions. [2025-02-06 04:23:48,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 160 transitions, 1142 flow [2025-02-06 04:23:48,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:23:48,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 04:23:48,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 209 transitions. [2025-02-06 04:23:48,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5358974358974359 [2025-02-06 04:23:48,015 INFO L175 Difference]: Start difference. First operand has 62 places, 40 transitions, 200 flow. Second operand 10 states and 209 transitions. [2025-02-06 04:23:48,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 160 transitions, 1142 flow [2025-02-06 04:23:48,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 160 transitions, 1052 flow, removed 43 selfloop flow, removed 5 redundant places. [2025-02-06 04:23:48,064 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 383 flow [2025-02-06 04:23:48,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=383, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2025-02-06 04:23:48,064 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places. [2025-02-06 04:23:48,064 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 383 flow [2025-02-06 04:23:48,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:48,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:23:48,065 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:23:48,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:23:48,065 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:23:48,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:23:48,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1476989222, now seen corresponding path program 1 times [2025-02-06 04:23:48,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:23:48,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305084043] [2025-02-06 04:23:48,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:23:48,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:23:48,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 04:23:48,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 04:23:48,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:23:48,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:23:48,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:23:48,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:23:48,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305084043] [2025-02-06 04:23:48,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305084043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:23:48,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:23:48,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:23:48,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278681674] [2025-02-06 04:23:48,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:23:48,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:23:48,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:23:48,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:23:48,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:23:48,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-06 04:23:48,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 383 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:48,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:23:48,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-06 04:23:48,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:23:49,337 INFO L124 PetriNetUnfolderBase]: 8016/11692 cut-off events. [2025-02-06 04:23:49,338 INFO L125 PetriNetUnfolderBase]: For 29649/29664 co-relation queries the response was YES. [2025-02-06 04:23:49,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44873 conditions, 11692 events. 8016/11692 cut-off events. For 29649/29664 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 65455 event pairs, 1682 based on Foata normal form. 200/11883 useless extension candidates. Maximal degree in co-relation 44846. Up to 4716 conditions per place. [2025-02-06 04:23:49,384 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 65 selfloop transitions, 12 changer transitions 60/141 dead transitions. [2025-02-06 04:23:49,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 141 transitions, 1166 flow [2025-02-06 04:23:49,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:23:49,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:23:49,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2025-02-06 04:23:49,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5860805860805861 [2025-02-06 04:23:49,386 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 383 flow. Second operand 7 states and 160 transitions. [2025-02-06 04:23:49,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 141 transitions, 1166 flow [2025-02-06 04:23:49,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 141 transitions, 1126 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-02-06 04:23:49,461 INFO L231 Difference]: Finished difference. Result has 67 places, 47 transitions, 343 flow [2025-02-06 04:23:49,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=343, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2025-02-06 04:23:49,462 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2025-02-06 04:23:49,462 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 343 flow [2025-02-06 04:23:49,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:49,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:23:49,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:23:49,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:23:49,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:23:49,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:23:49,463 INFO L85 PathProgramCache]: Analyzing trace with hash -387813498, now seen corresponding path program 2 times [2025-02-06 04:23:49,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:23:49,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294140854] [2025-02-06 04:23:49,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:23:49,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:23:49,470 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-02-06 04:23:49,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 04:23:49,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:23:49,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:23:49,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:23:49,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:23:49,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294140854] [2025-02-06 04:23:49,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294140854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:23:49,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:23:49,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:23:49,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698500723] [2025-02-06 04:23:49,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:23:49,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:23:49,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:23:49,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:23:49,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:23:49,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-06 04:23:49,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 47 transitions, 343 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:49,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:23:49,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-06 04:23:49,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:23:50,679 INFO L124 PetriNetUnfolderBase]: 6258/9229 cut-off events. [2025-02-06 04:23:50,680 INFO L125 PetriNetUnfolderBase]: For 22958/22958 co-relation queries the response was YES. [2025-02-06 04:23:50,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34010 conditions, 9229 events. 6258/9229 cut-off events. For 22958/22958 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 51273 event pairs, 1312 based on Foata normal form. 220/9448 useless extension candidates. Maximal degree in co-relation 33990. Up to 4067 conditions per place. [2025-02-06 04:23:50,730 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 60 selfloop transitions, 11 changer transitions 55/130 dead transitions. [2025-02-06 04:23:50,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 130 transitions, 1059 flow [2025-02-06 04:23:50,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:23:50,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:23:50,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2025-02-06 04:23:50,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5256410256410257 [2025-02-06 04:23:50,736 INFO L175 Difference]: Start difference. First operand has 67 places, 47 transitions, 343 flow. Second operand 8 states and 164 transitions. [2025-02-06 04:23:50,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 130 transitions, 1059 flow [2025-02-06 04:23:50,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 130 transitions, 960 flow, removed 24 selfloop flow, removed 9 redundant places. [2025-02-06 04:23:50,773 INFO L231 Difference]: Finished difference. Result has 70 places, 50 transitions, 374 flow [2025-02-06 04:23:50,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=374, PETRI_PLACES=70, PETRI_TRANSITIONS=50} [2025-02-06 04:23:50,775 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2025-02-06 04:23:50,775 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 50 transitions, 374 flow [2025-02-06 04:23:50,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:50,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:23:50,776 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:23:50,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:23:50,776 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:23:50,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:23:50,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1635528657, now seen corresponding path program 1 times [2025-02-06 04:23:50,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:23:50,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075796066] [2025-02-06 04:23:50,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:23:50,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:23:50,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 04:23:50,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 04:23:50,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:23:50,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:23:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:23:50,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:23:50,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075796066] [2025-02-06 04:23:50,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075796066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:23:50,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:23:50,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:23:50,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271399046] [2025-02-06 04:23:50,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:23:50,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:23:50,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:23:50,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:23:50,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:23:50,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-06 04:23:50,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 50 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:50,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:23:50,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-06 04:23:50,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:23:51,962 INFO L124 PetriNetUnfolderBase]: 6398/9409 cut-off events. [2025-02-06 04:23:51,963 INFO L125 PetriNetUnfolderBase]: For 22726/22732 co-relation queries the response was YES. [2025-02-06 04:23:51,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34099 conditions, 9409 events. 6398/9409 cut-off events. For 22726/22732 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 51732 event pairs, 1757 based on Foata normal form. 220/9627 useless extension candidates. Maximal degree in co-relation 34079. Up to 4693 conditions per place. [2025-02-06 04:23:51,994 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 56 selfloop transitions, 5 changer transitions 48/113 dead transitions. [2025-02-06 04:23:51,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 113 transitions, 992 flow [2025-02-06 04:23:51,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:23:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:23:51,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2025-02-06 04:23:51,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5256410256410257 [2025-02-06 04:23:51,995 INFO L175 Difference]: Start difference. First operand has 70 places, 50 transitions, 374 flow. Second operand 6 states and 123 transitions. [2025-02-06 04:23:51,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 113 transitions, 992 flow [2025-02-06 04:23:52,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 113 transitions, 956 flow, removed 18 selfloop flow, removed 4 redundant places. [2025-02-06 04:23:52,025 INFO L231 Difference]: Finished difference. Result has 70 places, 44 transitions, 296 flow [2025-02-06 04:23:52,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=296, PETRI_PLACES=70, PETRI_TRANSITIONS=44} [2025-02-06 04:23:52,025 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2025-02-06 04:23:52,025 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 44 transitions, 296 flow [2025-02-06 04:23:52,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:52,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:23:52,026 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:23:52,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:23:52,026 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:23:52,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:23:52,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1613055153, now seen corresponding path program 1 times [2025-02-06 04:23:52,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:23:52,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335755377] [2025-02-06 04:23:52,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:23:52,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:23:52,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 04:23:52,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:23:52,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:23:52,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:23:52,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:23:52,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:23:52,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335755377] [2025-02-06 04:23:52,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335755377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:23:52,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:23:52,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:23:52,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666799384] [2025-02-06 04:23:52,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:23:52,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:23:52,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:23:52,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:23:52,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:23:52,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-06 04:23:52,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 44 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:52,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:23:52,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-06 04:23:52,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:23:52,721 INFO L124 PetriNetUnfolderBase]: 3721/5507 cut-off events. [2025-02-06 04:23:52,721 INFO L125 PetriNetUnfolderBase]: For 12820/12823 co-relation queries the response was YES. [2025-02-06 04:23:52,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19439 conditions, 5507 events. 3721/5507 cut-off events. For 12820/12823 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 26880 event pairs, 1131 based on Foata normal form. 81/5588 useless extension candidates. Maximal degree in co-relation 19419. Up to 2356 conditions per place. [2025-02-06 04:23:52,745 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 40 selfloop transitions, 3 changer transitions 57/104 dead transitions. [2025-02-06 04:23:52,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 104 transitions, 756 flow [2025-02-06 04:23:52,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:23:52,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:23:52,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2025-02-06 04:23:52,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5091575091575091 [2025-02-06 04:23:52,746 INFO L175 Difference]: Start difference. First operand has 70 places, 44 transitions, 296 flow. Second operand 7 states and 139 transitions. [2025-02-06 04:23:52,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 104 transitions, 756 flow [2025-02-06 04:23:52,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 104 transitions, 699 flow, removed 12 selfloop flow, removed 9 redundant places. [2025-02-06 04:23:52,759 INFO L231 Difference]: Finished difference. Result has 69 places, 38 transitions, 201 flow [2025-02-06 04:23:52,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=201, PETRI_PLACES=69, PETRI_TRANSITIONS=38} [2025-02-06 04:23:52,760 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2025-02-06 04:23:52,760 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 38 transitions, 201 flow [2025-02-06 04:23:52,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:52,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:23:52,760 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:23:52,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:23:52,760 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:23:52,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:23:52,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1092229227, now seen corresponding path program 2 times [2025-02-06 04:23:52,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:23:52,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926500665] [2025-02-06 04:23:52,761 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:23:52,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:23:52,766 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-02-06 04:23:52,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:23:52,788 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:23:52,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:23:53,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:23:53,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:23:53,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926500665] [2025-02-06 04:23:53,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926500665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:23:53,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:23:53,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:23:53,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869435635] [2025-02-06 04:23:53,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:23:53,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:23:53,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:23:53,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:23:53,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:23:53,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-06 04:23:53,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 38 transitions, 201 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:53,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:23:53,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-06 04:23:53,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:23:53,511 INFO L124 PetriNetUnfolderBase]: 1961/3002 cut-off events. [2025-02-06 04:23:53,511 INFO L125 PetriNetUnfolderBase]: For 6061/6061 co-relation queries the response was YES. [2025-02-06 04:23:53,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9987 conditions, 3002 events. 1961/3002 cut-off events. For 6061/6061 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13802 event pairs, 1074 based on Foata normal form. 80/3082 useless extension candidates. Maximal degree in co-relation 9967. Up to 2407 conditions per place. [2025-02-06 04:23:53,526 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 46 selfloop transitions, 7 changer transitions 29/86 dead transitions. [2025-02-06 04:23:53,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 86 transitions, 622 flow [2025-02-06 04:23:53,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:23:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:23:53,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2025-02-06 04:23:53,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42628205128205127 [2025-02-06 04:23:53,527 INFO L175 Difference]: Start difference. First operand has 69 places, 38 transitions, 201 flow. Second operand 8 states and 133 transitions. [2025-02-06 04:23:53,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 86 transitions, 622 flow [2025-02-06 04:23:53,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 86 transitions, 572 flow, removed 16 selfloop flow, removed 7 redundant places. [2025-02-06 04:23:53,536 INFO L231 Difference]: Finished difference. Result has 69 places, 41 transitions, 242 flow [2025-02-06 04:23:53,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=242, PETRI_PLACES=69, PETRI_TRANSITIONS=41} [2025-02-06 04:23:53,538 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2025-02-06 04:23:53,538 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 41 transitions, 242 flow [2025-02-06 04:23:53,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:53,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:23:53,538 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:23:53,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:23:53,539 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:23:53,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:23:53,539 INFO L85 PathProgramCache]: Analyzing trace with hash 946609968, now seen corresponding path program 1 times [2025-02-06 04:23:53,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:23:53,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193219169] [2025-02-06 04:23:53,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:23:53,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:23:53,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 04:23:53,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:23:53,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:23:53,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:23:53,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:23:53,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:23:53,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193219169] [2025-02-06 04:23:53,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193219169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:23:53,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:23:53,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:23:53,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361959680] [2025-02-06 04:23:53,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:23:53,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:23:53,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:23:53,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:23:53,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:23:53,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-02-06 04:23:53,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 41 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:53,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:23:53,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-02-06 04:23:53,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:23:53,859 INFO L124 PetriNetUnfolderBase]: 1454/2330 cut-off events. [2025-02-06 04:23:53,859 INFO L125 PetriNetUnfolderBase]: For 9902/9904 co-relation queries the response was YES. [2025-02-06 04:23:53,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8872 conditions, 2330 events. 1454/2330 cut-off events. For 9902/9904 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 11401 event pairs, 146 based on Foata normal form. 109/2439 useless extension candidates. Maximal degree in co-relation 8852. Up to 1298 conditions per place. [2025-02-06 04:23:53,871 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 57 selfloop transitions, 5 changer transitions 1/68 dead transitions. [2025-02-06 04:23:53,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 68 transitions, 549 flow [2025-02-06 04:23:53,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:23:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:23:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-02-06 04:23:53,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2025-02-06 04:23:53,872 INFO L175 Difference]: Start difference. First operand has 69 places, 41 transitions, 242 flow. Second operand 4 states and 92 transitions. [2025-02-06 04:23:53,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 68 transitions, 549 flow [2025-02-06 04:23:53,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 68 transitions, 504 flow, removed 15 selfloop flow, removed 7 redundant places. [2025-02-06 04:23:53,878 INFO L231 Difference]: Finished difference. Result has 63 places, 42 transitions, 230 flow [2025-02-06 04:23:53,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=63, PETRI_TRANSITIONS=42} [2025-02-06 04:23:53,879 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2025-02-06 04:23:53,879 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 42 transitions, 230 flow [2025-02-06 04:23:53,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:53,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:23:53,879 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-02-06 04:23:53,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:23:53,879 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:23:53,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:23:53,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1638608282, now seen corresponding path program 1 times [2025-02-06 04:23:53,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:23:53,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944833572] [2025-02-06 04:23:53,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:23:53,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:23:53,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:23:53,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:23:53,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:23:53,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:23:53,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:23:53,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:23:53,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944833572] [2025-02-06 04:23:53,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944833572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:23:53,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:23:53,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:23:53,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774485411] [2025-02-06 04:23:53,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:23:53,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:23:53,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:23:53,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:23:53,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:23:53,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-02-06 04:23:53,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 42 transitions, 230 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:53,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:23:53,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-02-06 04:23:53,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:23:54,164 INFO L124 PetriNetUnfolderBase]: 917/1504 cut-off events. [2025-02-06 04:23:54,165 INFO L125 PetriNetUnfolderBase]: For 5684/5686 co-relation queries the response was YES. [2025-02-06 04:23:54,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5711 conditions, 1504 events. 917/1504 cut-off events. For 5684/5686 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6582 event pairs, 71 based on Foata normal form. 86/1590 useless extension candidates. Maximal degree in co-relation 5692. Up to 573 conditions per place. [2025-02-06 04:23:54,171 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 62 selfloop transitions, 8 changer transitions 1/76 dead transitions. [2025-02-06 04:23:54,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 76 transitions, 606 flow [2025-02-06 04:23:54,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:23:54,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:23:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-02-06 04:23:54,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5692307692307692 [2025-02-06 04:23:54,173 INFO L175 Difference]: Start difference. First operand has 63 places, 42 transitions, 230 flow. Second operand 5 states and 111 transitions. [2025-02-06 04:23:54,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 76 transitions, 606 flow [2025-02-06 04:23:54,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 76 transitions, 592 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-06 04:23:54,176 INFO L231 Difference]: Finished difference. Result has 67 places, 44 transitions, 262 flow [2025-02-06 04:23:54,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=262, PETRI_PLACES=67, PETRI_TRANSITIONS=44} [2025-02-06 04:23:54,176 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2025-02-06 04:23:54,176 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 44 transitions, 262 flow [2025-02-06 04:23:54,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:54,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:23:54,177 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:23:54,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:23:54,177 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:23:54,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:23:54,177 INFO L85 PathProgramCache]: Analyzing trace with hash 671428033, now seen corresponding path program 1 times [2025-02-06 04:23:54,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:23:54,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755179058] [2025-02-06 04:23:54,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:23:54,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:23:54,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 04:23:54,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:23:54,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:23:54,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:23:54,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:23:54,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:23:54,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755179058] [2025-02-06 04:23:54,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755179058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:23:54,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:23:54,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:23:54,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295454244] [2025-02-06 04:23:54,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:23:54,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:23:54,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:23:54,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:23:54,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:23:54,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-02-06 04:23:54,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 44 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:54,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:23:54,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-02-06 04:23:54,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:23:54,469 INFO L124 PetriNetUnfolderBase]: 520/853 cut-off events. [2025-02-06 04:23:54,469 INFO L125 PetriNetUnfolderBase]: For 3773/3775 co-relation queries the response was YES. [2025-02-06 04:23:54,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3401 conditions, 853 events. 520/853 cut-off events. For 3773/3775 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3108 event pairs, 52 based on Foata normal form. 40/893 useless extension candidates. Maximal degree in co-relation 3381. Up to 284 conditions per place. [2025-02-06 04:23:54,473 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 55 selfloop transitions, 11 changer transitions 1/72 dead transitions. [2025-02-06 04:23:54,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 72 transitions, 563 flow [2025-02-06 04:23:54,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:23:54,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:23:54,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2025-02-06 04:23:54,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49572649572649574 [2025-02-06 04:23:54,475 INFO L175 Difference]: Start difference. First operand has 67 places, 44 transitions, 262 flow. Second operand 6 states and 116 transitions. [2025-02-06 04:23:54,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 72 transitions, 563 flow [2025-02-06 04:23:54,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 72 transitions, 516 flow, removed 13 selfloop flow, removed 5 redundant places. [2025-02-06 04:23:54,480 INFO L231 Difference]: Finished difference. Result has 69 places, 44 transitions, 256 flow [2025-02-06 04:23:54,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=256, PETRI_PLACES=69, PETRI_TRANSITIONS=44} [2025-02-06 04:23:54,481 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2025-02-06 04:23:54,481 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 44 transitions, 256 flow [2025-02-06 04:23:54,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:54,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:23:54,481 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:23:54,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:23:54,481 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:23:54,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:23:54,482 INFO L85 PathProgramCache]: Analyzing trace with hash -366349837, now seen corresponding path program 1 times [2025-02-06 04:23:54,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:23:54,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974071767] [2025-02-06 04:23:54,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:23:54,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:23:54,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 04:23:54,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:23:54,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:23:54,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:23:55,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:23:55,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:23:55,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974071767] [2025-02-06 04:23:55,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974071767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:23:55,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:23:55,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:23:55,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471096447] [2025-02-06 04:23:55,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:23:55,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:23:55,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:23:55,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:23:55,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:23:55,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-06 04:23:55,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 44 transitions, 256 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:55,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:23:55,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-06 04:23:55,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:23:55,541 INFO L124 PetriNetUnfolderBase]: 730/1182 cut-off events. [2025-02-06 04:23:55,542 INFO L125 PetriNetUnfolderBase]: For 4476/4476 co-relation queries the response was YES. [2025-02-06 04:23:55,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4620 conditions, 1182 events. 730/1182 cut-off events. For 4476/4476 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4572 event pairs, 198 based on Foata normal form. 8/1190 useless extension candidates. Maximal degree in co-relation 4600. Up to 721 conditions per place. [2025-02-06 04:23:55,547 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 56 selfloop transitions, 12 changer transitions 16/88 dead transitions. [2025-02-06 04:23:55,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 88 transitions, 684 flow [2025-02-06 04:23:55,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:23:55,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 04:23:55,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2025-02-06 04:23:55,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37606837606837606 [2025-02-06 04:23:55,549 INFO L175 Difference]: Start difference. First operand has 69 places, 44 transitions, 256 flow. Second operand 9 states and 132 transitions. [2025-02-06 04:23:55,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 88 transitions, 684 flow [2025-02-06 04:23:55,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 88 transitions, 499 flow, removed 50 selfloop flow, removed 12 redundant places. [2025-02-06 04:23:55,553 INFO L231 Difference]: Finished difference. Result has 69 places, 49 transitions, 256 flow [2025-02-06 04:23:55,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=256, PETRI_PLACES=69, PETRI_TRANSITIONS=49} [2025-02-06 04:23:55,554 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2025-02-06 04:23:55,554 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 49 transitions, 256 flow [2025-02-06 04:23:55,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:55,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:23:55,555 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:23:55,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:23:55,555 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:23:55,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:23:55,555 INFO L85 PathProgramCache]: Analyzing trace with hash 2139320041, now seen corresponding path program 2 times [2025-02-06 04:23:55,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:23:55,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787348953] [2025-02-06 04:23:55,555 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:23:55,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:23:55,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-02-06 04:23:55,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:23:55,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:23:55,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:23:56,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:23:56,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:23:56,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787348953] [2025-02-06 04:23:56,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787348953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:23:56,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:23:56,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:23:56,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857235998] [2025-02-06 04:23:56,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:23:56,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:23:56,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:23:56,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:23:56,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:23:56,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-06 04:23:56,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 49 transitions, 256 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:56,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:23:56,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-06 04:23:56,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:23:56,996 INFO L124 PetriNetUnfolderBase]: 1282/2090 cut-off events. [2025-02-06 04:23:56,996 INFO L125 PetriNetUnfolderBase]: For 1994/1994 co-relation queries the response was YES. [2025-02-06 04:23:57,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5920 conditions, 2090 events. 1282/2090 cut-off events. For 1994/1994 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9669 event pairs, 516 based on Foata normal form. 8/2098 useless extension candidates. Maximal degree in co-relation 5904. Up to 845 conditions per place. [2025-02-06 04:23:57,003 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 64 selfloop transitions, 7 changer transitions 44/119 dead transitions. [2025-02-06 04:23:57,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 119 transitions, 764 flow [2025-02-06 04:23:57,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:23:57,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 04:23:57,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2025-02-06 04:23:57,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42735042735042733 [2025-02-06 04:23:57,004 INFO L175 Difference]: Start difference. First operand has 69 places, 49 transitions, 256 flow. Second operand 9 states and 150 transitions. [2025-02-06 04:23:57,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 119 transitions, 764 flow [2025-02-06 04:23:57,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 119 transitions, 679 flow, removed 36 selfloop flow, removed 6 redundant places. [2025-02-06 04:23:57,008 INFO L231 Difference]: Finished difference. Result has 75 places, 47 transitions, 227 flow [2025-02-06 04:23:57,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=227, PETRI_PLACES=75, PETRI_TRANSITIONS=47} [2025-02-06 04:23:57,009 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2025-02-06 04:23:57,009 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 47 transitions, 227 flow [2025-02-06 04:23:57,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:23:57,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:23:57,010 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:23:57,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 04:23:57,010 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:23:57,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:23:57,010 INFO L85 PathProgramCache]: Analyzing trace with hash -484046103, now seen corresponding path program 3 times [2025-02-06 04:23:57,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:23:57,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852513897] [2025-02-06 04:23:57,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:23:57,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:23:57,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-02-06 04:23:57,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:23:57,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:23:57,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:23:57,059 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:23:57,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 04:23:57,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:23:57,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:23:57,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:23:57,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:23:57,121 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:23:57,122 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-02-06 04:23:57,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-02-06 04:23:57,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-02-06 04:23:57,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-06 04:23:57,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-02-06 04:23:57,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-02-06 04:23:57,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 04:23:57,124 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:23:57,185 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 04:23:57,185 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:23:57,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:23:57 BasicIcfg [2025-02-06 04:23:57,190 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:23:57,190 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:23:57,190 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:23:57,191 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:23:57,192 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:23:43" (3/4) ... [2025-02-06 04:23:57,193 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 04:23:57,269 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-02-06 04:23:57,305 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 04:23:57,305 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 04:23:57,305 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:23:57,307 INFO L158 Benchmark]: Toolchain (without parser) took 15247.41ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 111.0MB in the beginning and 910.5MB in the end (delta: -799.4MB). Peak memory consumption was 262.1MB. Max. memory is 16.1GB. [2025-02-06 04:23:57,307 INFO L158 Benchmark]: CDTParser took 0.89ms. Allocated memory is still 226.5MB. Free memory is still 146.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:23:57,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.74ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 87.7MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 04:23:57,308 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.20ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 84.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:23:57,308 INFO L158 Benchmark]: Boogie Preprocessor took 33.27ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 82.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:23:57,309 INFO L158 Benchmark]: IcfgBuilder took 571.24ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 95.3MB in the end (delta: -13.0MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. [2025-02-06 04:23:57,309 INFO L158 Benchmark]: TraceAbstraction took 14115.65ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 94.5MB in the beginning and 927.2MB in the end (delta: -832.7MB). Peak memory consumption was 231.0MB. Max. memory is 16.1GB. [2025-02-06 04:23:57,309 INFO L158 Benchmark]: Witness Printer took 114.58ms. Allocated memory is still 1.2GB. Free memory was 927.2MB in the beginning and 910.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:23:57,310 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.89ms. Allocated memory is still 226.5MB. Free memory is still 146.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.74ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 87.7MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.20ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 84.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.27ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 82.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 571.24ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 95.3MB in the end (delta: -13.0MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14115.65ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 94.5MB in the beginning and 927.2MB in the end (delta: -832.7MB). Peak memory consumption was 231.0MB. Max. memory is 16.1GB. * Witness Printer took 114.58ms. Allocated memory is still 1.2GB. Free memory was 927.2MB in the beginning and 910.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1804; [L819] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L820] 0 pthread_t t1805; [L821] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=-2, t1805=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L822] 0 pthread_t t1806; [L823] FCALL, FORK 0 pthread_create(&t1806, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=-2, t1805=-1, t1806=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L741] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=-2, t1805=-1, t1806=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=-2, t1805=-1, t1806=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=-2, t1805=-1, t1806=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 878 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 871 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2607 IncrementalHoareTripleChecker+Invalid, 2683 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 1 mSDtfsCounter, 2607 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=383occurred in iteration=3, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 2127 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-06 04:23:57,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE