./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 80bd490b89eb696c85e417e2f0348670cfb7c8195637276a01d1016d9277f95a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:22:42,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:22:42,651 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:22:42,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:22:42,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:22:42,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:22:42,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:22:42,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:22:42,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:22:42,678 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:22:42,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:22:42,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:22:42,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:22:42,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:22:42,680 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:22:42,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:22:42,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:22:42,680 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:22:42,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:22:42,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:22:42,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:22:42,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:22:42,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:22:42,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:22:42,681 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:22:42,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:22:42,681 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:22:42,681 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:22:42,681 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:22:42,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:22:42,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:22:42,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:22:42,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:22:42,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:22:42,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:22:42,682 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:22:42,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:22:42,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:22:42,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:22:42,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:22:42,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:22:42,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:22:42,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:22:42,683 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 80bd490b89eb696c85e417e2f0348670cfb7c8195637276a01d1016d9277f95a [2025-03-17 06:22:42,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:22:42,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:22:42,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:22:42,926 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:22:42,926 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:22:42,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2025-03-17 06:22:44,086 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84e6792a/8d8b12ecd01048459e0e645f6f36c852/FLAG6d475eb39 [2025-03-17 06:22:44,383 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:22:44,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2025-03-17 06:22:44,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84e6792a/8d8b12ecd01048459e0e645f6f36c852/FLAG6d475eb39 [2025-03-17 06:22:44,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84e6792a/8d8b12ecd01048459e0e645f6f36c852 [2025-03-17 06:22:44,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:22:44,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:22:44,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:22:44,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:22:44,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:22:44,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:22:44" (1/1) ... [2025-03-17 06:22:44,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b8edb90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:22:44, skipping insertion in model container [2025-03-17 06:22:44,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:22:44" (1/1) ... [2025-03-17 06:22:44,689 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:22:44,814 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i[974,987] [2025-03-17 06:22:44,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:22:44,990 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:22:45,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i[974,987] [2025-03-17 06:22:45,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:22:45,080 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:22:45,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:22:45 WrapperNode [2025-03-17 06:22:45,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:22:45,082 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:22:45,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:22:45,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:22:45,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:22:45" (1/1) ... [2025-03-17 06:22:45,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:22:45" (1/1) ... [2025-03-17 06:22:45,129 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2025-03-17 06:22:45,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:22:45,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:22:45,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:22:45,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:22:45,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:22:45" (1/1) ... [2025-03-17 06:22:45,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:22:45" (1/1) ... [2025-03-17 06:22:45,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:22:45" (1/1) ... [2025-03-17 06:22:45,165 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-03-17 06:22:45,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:22:45" (1/1) ... [2025-03-17 06:22:45,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:22:45" (1/1) ... [2025-03-17 06:22:45,172 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:22:45" (1/1) ... [2025-03-17 06:22:45,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:22:45" (1/1) ... [2025-03-17 06:22:45,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:22:45" (1/1) ... [2025-03-17 06:22:45,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:22:45" (1/1) ... [2025-03-17 06:22:45,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:22:45,183 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:22:45,183 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:22:45,183 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:22:45,184 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:22:45" (1/1) ... [2025-03-17 06:22:45,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:22:45,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:22:45,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:22:45,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:22:45,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 06:22:45,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:22:45,230 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-17 06:22:45,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-17 06:22:45,230 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-17 06:22:45,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-17 06:22:45,230 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-17 06:22:45,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-17 06:22:45,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:22:45,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 06:22:45,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:22:45,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:22:45,232 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 06:22:45,318 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:22:45,320 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:22:45,611 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 06:22:45,611 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:22:45,809 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:22:45,810 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:22:45,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:22:45 BoogieIcfgContainer [2025-03-17 06:22:45,810 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:22:45,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:22:45,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:22:45,817 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:22:45,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:22:44" (1/3) ... [2025-03-17 06:22:45,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17dd518b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:22:45, skipping insertion in model container [2025-03-17 06:22:45,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:22:45" (2/3) ... [2025-03-17 06:22:45,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17dd518b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:22:45, skipping insertion in model container [2025-03-17 06:22:45,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:22:45" (3/3) ... [2025-03-17 06:22:45,820 INFO L128 eAbstractionObserver]: Analyzing ICFG mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2025-03-17 06:22:45,831 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:22:45,833 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix003_power.opt_pso.opt_rmo.opt_tso.opt.i that has 4 procedures, 41 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-17 06:22:45,833 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 06:22:45,876 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 06:22:45,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 94 flow [2025-03-17 06:22:45,929 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2025-03-17 06:22:45,930 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 06:22:45,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 1/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2025-03-17 06:22:45,936 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 41 transitions, 94 flow [2025-03-17 06:22:45,938 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 85 flow [2025-03-17 06:22:45,947 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:22:45,960 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;@44d1ec9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:22:45,960 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 06:22:45,969 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:22:45,969 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2025-03-17 06:22:45,969 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 06:22:45,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:22:45,970 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:22:45,970 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:22:45,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:22:45,976 INFO L85 PathProgramCache]: Analyzing trace with hash -676587852, now seen corresponding path program 1 times [2025-03-17 06:22:45,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:22:45,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702218064] [2025-03-17 06:22:45,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:22:45,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:22:46,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 06:22:46,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 06:22:46,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:22:46,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:22:46,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:22:46,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:22:46,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702218064] [2025-03-17 06:22:46,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702218064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:22:46,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:22:46,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 06:22:46,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807049685] [2025-03-17 06:22:46,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:22:46,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:22:46,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:22:46,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:22:46,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:22:46,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-17 06:22:46,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:22:46,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:22:46,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-17 06:22:46,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:22:47,411 INFO L124 PetriNetUnfolderBase]: 5851/8435 cut-off events. [2025-03-17 06:22:47,411 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-17 06:22:47,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16838 conditions, 8435 events. 5851/8435 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 44771 event pairs, 679 based on Foata normal form. 294/8675 useless extension candidates. Maximal degree in co-relation 16827. Up to 7189 conditions per place. [2025-03-17 06:22:47,457 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 44 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2025-03-17 06:22:47,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 54 transitions, 213 flow [2025-03-17 06:22:47,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:22:47,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:22:47,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2025-03-17 06:22:47,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-03-17 06:22:47,470 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 78 transitions. [2025-03-17 06:22:47,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 54 transitions, 213 flow [2025-03-17 06:22:47,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 210 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 06:22:47,478 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2025-03-17 06:22:47,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2025-03-17 06:22:47,484 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2025-03-17 06:22:47,485 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2025-03-17 06:22:47,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:22:47,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:22:47,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:22:47,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:22:47,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:22:47,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:22:47,488 INFO L85 PathProgramCache]: Analyzing trace with hash -827345464, now seen corresponding path program 1 times [2025-03-17 06:22:47,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:22:47,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610861803] [2025-03-17 06:22:47,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:22:47,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:22:47,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 06:22:47,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 06:22:47,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:22:47,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:22:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:22:47,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:22:47,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610861803] [2025-03-17 06:22:47,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610861803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:22:47,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:22:47,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:22:47,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519194336] [2025-03-17 06:22:47,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:22:47,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:22:47,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:22:47,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:22:47,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:22:47,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-03-17 06:22:47,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:22:47,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:22:47,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-03-17 06:22:47,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:22:48,812 INFO L124 PetriNetUnfolderBase]: 7733/11241 cut-off events. [2025-03-17 06:22:48,812 INFO L125 PetriNetUnfolderBase]: For 456/456 co-relation queries the response was YES. [2025-03-17 06:22:48,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22821 conditions, 11241 events. 7733/11241 cut-off events. For 456/456 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 64367 event pairs, 1383 based on Foata normal form. 0/11022 useless extension candidates. Maximal degree in co-relation 22811. Up to 6035 conditions per place. [2025-03-17 06:22:48,868 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 45 selfloop transitions, 2 changer transitions 77/128 dead transitions. [2025-03-17 06:22:48,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 128 transitions, 528 flow [2025-03-17 06:22:48,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:22:48,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 06:22:48,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2025-03-17 06:22:48,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5548780487804879 [2025-03-17 06:22:48,870 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 8 states and 182 transitions. [2025-03-17 06:22:48,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 128 transitions, 528 flow [2025-03-17 06:22:48,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 128 transitions, 512 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:22:48,877 INFO L231 Difference]: Finished difference. Result has 54 places, 34 transitions, 90 flow [2025-03-17 06:22:48,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=90, PETRI_PLACES=54, PETRI_TRANSITIONS=34} [2025-03-17 06:22:48,877 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2025-03-17 06:22:48,877 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 34 transitions, 90 flow [2025-03-17 06:22:48,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:22:48,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:22:48,878 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:22:48,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:22:48,878 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:22:48,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:22:48,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1757621953, now seen corresponding path program 1 times [2025-03-17 06:22:48,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:22:48,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138334900] [2025-03-17 06:22:48,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:22:48,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:22:48,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 06:22:48,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 06:22:48,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:22:48,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:22:49,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:22:49,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:22:49,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138334900] [2025-03-17 06:22:49,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138334900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:22:49,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:22:49,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:22:49,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643469106] [2025-03-17 06:22:49,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:22:49,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:22:49,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:22:49,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:22:49,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:22:49,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-03-17 06:22:49,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 34 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:22:49,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:22:49,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-03-17 06:22:49,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:22:49,977 INFO L124 PetriNetUnfolderBase]: 5595/8191 cut-off events. [2025-03-17 06:22:49,977 INFO L125 PetriNetUnfolderBase]: For 1702/1702 co-relation queries the response was YES. [2025-03-17 06:22:49,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18004 conditions, 8191 events. 5595/8191 cut-off events. For 1702/1702 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 43173 event pairs, 1349 based on Foata normal form. 210/8389 useless extension candidates. Maximal degree in co-relation 17989. Up to 5211 conditions per place. [2025-03-17 06:22:50,018 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 43 selfloop transitions, 2 changer transitions 51/100 dead transitions. [2025-03-17 06:22:50,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 100 transitions, 427 flow [2025-03-17 06:22:50,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:22:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 06:22:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2025-03-17 06:22:50,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5121951219512195 [2025-03-17 06:22:50,020 INFO L175 Difference]: Start difference. First operand has 54 places, 34 transitions, 90 flow. Second operand 7 states and 147 transitions. [2025-03-17 06:22:50,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 100 transitions, 427 flow [2025-03-17 06:22:50,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 100 transitions, 405 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-17 06:22:50,095 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 94 flow [2025-03-17 06:22:50,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=7, PETRI_FLOW=94, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2025-03-17 06:22:50,096 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2025-03-17 06:22:50,096 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 94 flow [2025-03-17 06:22:50,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:22:50,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:22:50,097 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] [2025-03-17 06:22:50,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:22:50,097 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:22:50,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:22:50,098 INFO L85 PathProgramCache]: Analyzing trace with hash 503967249, now seen corresponding path program 1 times [2025-03-17 06:22:50,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:22:50,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900321344] [2025-03-17 06:22:50,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:22:50,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:22:50,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 06:22:50,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 06:22:50,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:22:50,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:22:50,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:22:50,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:22:50,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900321344] [2025-03-17 06:22:50,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900321344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:22:50,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:22:50,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:22:50,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986608176] [2025-03-17 06:22:50,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:22:50,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:22:50,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:22:50,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:22:50,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:22:50,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-17 06:22:50,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:22:50,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:22:50,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-17 06:22:50,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:22:50,687 INFO L124 PetriNetUnfolderBase]: 3773/5799 cut-off events. [2025-03-17 06:22:50,688 INFO L125 PetriNetUnfolderBase]: For 528/528 co-relation queries the response was YES. [2025-03-17 06:22:50,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12741 conditions, 5799 events. 3773/5799 cut-off events. For 528/528 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 31765 event pairs, 798 based on Foata normal form. 294/6081 useless extension candidates. Maximal degree in co-relation 12725. Up to 2672 conditions per place. [2025-03-17 06:22:50,709 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 60 selfloop transitions, 5 changer transitions 1/71 dead transitions. [2025-03-17 06:22:50,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 312 flow [2025-03-17 06:22:50,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:22:50,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:22:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-03-17 06:22:50,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-03-17 06:22:50,711 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 94 flow. Second operand 4 states and 104 transitions. [2025-03-17 06:22:50,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 312 flow [2025-03-17 06:22:50,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 71 transitions, 296 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-17 06:22:50,721 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 116 flow [2025-03-17 06:22:50,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2025-03-17 06:22:50,721 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 1 predicate places. [2025-03-17 06:22:50,721 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 116 flow [2025-03-17 06:22:50,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:22:50,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:22:50,722 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:22:50,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:22:50,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:22:50,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:22:50,723 INFO L85 PathProgramCache]: Analyzing trace with hash -137611037, now seen corresponding path program 1 times [2025-03-17 06:22:50,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:22:50,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807847220] [2025-03-17 06:22:50,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:22:50,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:22:50,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 06:22:50,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 06:22:50,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:22:50,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:22:50,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:22:50,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:22:50,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807847220] [2025-03-17 06:22:50,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807847220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:22:50,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:22:50,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:22:50,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468182213] [2025-03-17 06:22:50,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:22:50,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:22:50,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:22:50,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:22:50,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:22:50,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-17 06:22:50,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 116 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-03-17 06:22:50,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:22:50,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-17 06:22:50,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:22:51,282 INFO L124 PetriNetUnfolderBase]: 2298/3570 cut-off events. [2025-03-17 06:22:51,282 INFO L125 PetriNetUnfolderBase]: For 849/849 co-relation queries the response was YES. [2025-03-17 06:22:51,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8573 conditions, 3570 events. 2298/3570 cut-off events. For 849/849 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 17626 event pairs, 516 based on Foata normal form. 194/3752 useless extension candidates. Maximal degree in co-relation 8559. Up to 1305 conditions per place. [2025-03-17 06:22:51,295 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 77 selfloop transitions, 8 changer transitions 1/91 dead transitions. [2025-03-17 06:22:51,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 91 transitions, 423 flow [2025-03-17 06:22:51,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:22:51,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:22:51,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-03-17 06:22:51,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6487804878048781 [2025-03-17 06:22:51,297 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 116 flow. Second operand 5 states and 133 transitions. [2025-03-17 06:22:51,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 91 transitions, 423 flow [2025-03-17 06:22:51,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 91 transitions, 413 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 06:22:51,300 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 156 flow [2025-03-17 06:22:51,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2025-03-17 06:22:51,301 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places. [2025-03-17 06:22:51,301 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 156 flow [2025-03-17 06:22:51,302 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-03-17 06:22:51,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:22:51,302 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:22:51,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:22:51,302 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:22:51,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:22:51,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1560035725, now seen corresponding path program 1 times [2025-03-17 06:22:51,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:22:51,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114199192] [2025-03-17 06:22:51,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:22:51,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:22:51,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 06:22:51,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:22:51,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:22:51,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:22:51,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:22:51,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:22:51,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114199192] [2025-03-17 06:22:51,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114199192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:22:51,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:22:51,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:22:51,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421013033] [2025-03-17 06:22:51,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:22:51,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:22:51,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:22:51,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:22:51,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:22:51,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-17 06:22:51,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:22:51,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:22:51,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-17 06:22:51,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:22:51,841 INFO L124 PetriNetUnfolderBase]: 1533/2347 cut-off events. [2025-03-17 06:22:51,844 INFO L125 PetriNetUnfolderBase]: For 1406/1406 co-relation queries the response was YES. [2025-03-17 06:22:51,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6015 conditions, 2347 events. 1533/2347 cut-off events. For 1406/1406 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 10640 event pairs, 467 based on Foata normal form. 64/2399 useless extension candidates. Maximal degree in co-relation 5999. Up to 906 conditions per place. [2025-03-17 06:22:51,854 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 64 selfloop transitions, 11 changer transitions 1/81 dead transitions. [2025-03-17 06:22:51,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 81 transitions, 404 flow [2025-03-17 06:22:51,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:22:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:22:51,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2025-03-17 06:22:51,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5365853658536586 [2025-03-17 06:22:51,855 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 156 flow. Second operand 6 states and 132 transitions. [2025-03-17 06:22:51,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 81 transitions, 404 flow [2025-03-17 06:22:51,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 81 transitions, 367 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-17 06:22:51,861 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 162 flow [2025-03-17 06:22:51,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2025-03-17 06:22:51,862 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2025-03-17 06:22:51,862 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 162 flow [2025-03-17 06:22:51,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:22:51,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:22:51,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:22:51,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:22:51,862 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:22:51,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:22:51,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2086145713, now seen corresponding path program 1 times [2025-03-17 06:22:51,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:22:51,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93908491] [2025-03-17 06:22:51,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:22:51,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:22:51,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 06:22:51,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 06:22:51,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:22:51,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:22:52,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:22:52,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:22:52,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93908491] [2025-03-17 06:22:52,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93908491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:22:52,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:22:52,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:22:52,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545923552] [2025-03-17 06:22:52,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:22:52,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:22:52,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:22:52,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:22:52,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:22:52,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-03-17 06:22:52,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 162 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:22:52,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:22:52,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-03-17 06:22:52,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:22:53,154 INFO L124 PetriNetUnfolderBase]: 2317/3535 cut-off events. [2025-03-17 06:22:53,155 INFO L125 PetriNetUnfolderBase]: For 2400/2400 co-relation queries the response was YES. [2025-03-17 06:22:53,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8922 conditions, 3535 events. 2317/3535 cut-off events. For 2400/2400 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 16802 event pairs, 341 based on Foata normal form. 8/3540 useless extension candidates. Maximal degree in co-relation 8907. Up to 1869 conditions per place. [2025-03-17 06:22:53,168 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 63 selfloop transitions, 10 changer transitions 58/135 dead transitions. [2025-03-17 06:22:53,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 135 transitions, 742 flow [2025-03-17 06:22:53,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:22:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 06:22:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2025-03-17 06:22:53,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43237250554323725 [2025-03-17 06:22:53,170 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 162 flow. Second operand 11 states and 195 transitions. [2025-03-17 06:22:53,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 135 transitions, 742 flow [2025-03-17 06:22:53,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 135 transitions, 605 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-17 06:22:53,183 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 179 flow [2025-03-17 06:22:53,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=179, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2025-03-17 06:22:53,183 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 15 predicate places. [2025-03-17 06:22:53,184 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 179 flow [2025-03-17 06:22:53,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:22:53,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:22:53,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:22:53,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:22:53,185 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:22:53,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:22:53,185 INFO L85 PathProgramCache]: Analyzing trace with hash -621186645, now seen corresponding path program 2 times [2025-03-17 06:22:53,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:22:53,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714138678] [2025-03-17 06:22:53,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:22:53,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:22:53,197 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-17 06:22:53,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 06:22:53,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:22:53,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:22:53,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:22:53,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:22:53,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714138678] [2025-03-17 06:22:53,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714138678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:22:53,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:22:53,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:22:53,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465802793] [2025-03-17 06:22:53,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:22:53,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:22:53,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:22:53,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:22:53,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:22:53,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-03-17 06:22:53,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 179 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:22:53,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:22:53,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-03-17 06:22:53,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:22:53,773 INFO L124 PetriNetUnfolderBase]: 2011/3076 cut-off events. [2025-03-17 06:22:53,774 INFO L125 PetriNetUnfolderBase]: For 1600/1600 co-relation queries the response was YES. [2025-03-17 06:22:53,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7980 conditions, 3076 events. 2011/3076 cut-off events. For 1600/1600 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 14380 event pairs, 400 based on Foata normal form. 8/3080 useless extension candidates. Maximal degree in co-relation 7962. Up to 1833 conditions per place. [2025-03-17 06:22:53,784 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 53 selfloop transitions, 1 changer transitions 47/105 dead transitions. [2025-03-17 06:22:53,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 105 transitions, 574 flow [2025-03-17 06:22:53,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:22:53,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:22:53,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2025-03-17 06:22:53,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46747967479674796 [2025-03-17 06:22:53,786 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 179 flow. Second operand 6 states and 115 transitions. [2025-03-17 06:22:53,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 105 transitions, 574 flow [2025-03-17 06:22:53,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 105 transitions, 560 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-03-17 06:22:53,791 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 168 flow [2025-03-17 06:22:53,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2025-03-17 06:22:53,791 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 16 predicate places. [2025-03-17 06:22:53,792 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 168 flow [2025-03-17 06:22:53,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:22:53,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:22:53,792 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:22:53,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:22:53,792 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:22:53,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:22:53,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1676325307, now seen corresponding path program 3 times [2025-03-17 06:22:53,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:22:53,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286625421] [2025-03-17 06:22:53,793 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:22:53,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:22:53,800 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-03-17 06:22:53,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 06:22:53,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 06:22:53,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:22:54,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:22:54,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:22:54,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286625421] [2025-03-17 06:22:54,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286625421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:22:54,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:22:54,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:22:54,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781583136] [2025-03-17 06:22:54,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:22:54,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:22:54,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:22:54,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:22:54,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:22:54,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-03-17 06:22:54,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 168 flow. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:22:54,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:22:54,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-03-17 06:22:54,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:22:54,818 INFO L124 PetriNetUnfolderBase]: 2113/3307 cut-off events. [2025-03-17 06:22:54,819 INFO L125 PetriNetUnfolderBase]: For 2244/2244 co-relation queries the response was YES. [2025-03-17 06:22:54,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8663 conditions, 3307 events. 2113/3307 cut-off events. For 2244/2244 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16559 event pairs, 719 based on Foata normal form. 8/3312 useless extension candidates. Maximal degree in co-relation 8643. Up to 1843 conditions per place. [2025-03-17 06:22:54,833 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 69 selfloop transitions, 19 changer transitions 44/136 dead transitions. [2025-03-17 06:22:54,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 136 transitions, 741 flow [2025-03-17 06:22:54,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 06:22:54,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 06:22:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 196 transitions. [2025-03-17 06:22:54,834 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3983739837398374 [2025-03-17 06:22:54,834 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 168 flow. Second operand 12 states and 196 transitions. [2025-03-17 06:22:54,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 136 transitions, 741 flow [2025-03-17 06:22:54,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 136 transitions, 716 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-17 06:22:54,842 INFO L231 Difference]: Finished difference. Result has 71 places, 59 transitions, 298 flow [2025-03-17 06:22:54,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=298, PETRI_PLACES=71, PETRI_TRANSITIONS=59} [2025-03-17 06:22:54,842 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 24 predicate places. [2025-03-17 06:22:54,843 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 59 transitions, 298 flow [2025-03-17 06:22:54,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:22:54,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:22:54,843 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:22:54,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:22:54,843 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:22:54,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:22:54,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1515179385, now seen corresponding path program 4 times [2025-03-17 06:22:54,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:22:54,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693159085] [2025-03-17 06:22:54,844 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:22:54,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:22:54,852 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-17 06:22:54,861 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 06:22:54,861 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 06:22:54,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:22:55,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:22:55,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:22:55,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693159085] [2025-03-17 06:22:55,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693159085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:22:55,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:22:55,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:22:55,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583211980] [2025-03-17 06:22:55,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:22:55,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:22:55,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:22:55,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:22:55,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:22:55,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-03-17 06:22:55,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 59 transitions, 298 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:22:55,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:22:55,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-03-17 06:22:55,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:22:55,364 INFO L124 PetriNetUnfolderBase]: 1969/3083 cut-off events. [2025-03-17 06:22:55,364 INFO L125 PetriNetUnfolderBase]: For 3044/3044 co-relation queries the response was YES. [2025-03-17 06:22:55,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8814 conditions, 3083 events. 1969/3083 cut-off events. For 3044/3044 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 15254 event pairs, 309 based on Foata normal form. 8/3088 useless extension candidates. Maximal degree in co-relation 8791. Up to 1460 conditions per place. [2025-03-17 06:22:55,379 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 44 selfloop transitions, 1 changer transitions 58/107 dead transitions. [2025-03-17 06:22:55,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 107 transitions, 670 flow [2025-03-17 06:22:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:22:55,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:22:55,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-03-17 06:22:55,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2025-03-17 06:22:55,380 INFO L175 Difference]: Start difference. First operand has 71 places, 59 transitions, 298 flow. Second operand 6 states and 114 transitions. [2025-03-17 06:22:55,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 107 transitions, 670 flow [2025-03-17 06:22:55,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 107 transitions, 645 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-03-17 06:22:55,387 INFO L231 Difference]: Finished difference. Result has 74 places, 40 transitions, 151 flow [2025-03-17 06:22:55,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=151, PETRI_PLACES=74, PETRI_TRANSITIONS=40} [2025-03-17 06:22:55,389 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 27 predicate places. [2025-03-17 06:22:55,389 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 40 transitions, 151 flow [2025-03-17 06:22:55,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:22:55,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:22:55,390 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:22:55,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:22:55,390 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:22:55,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:22:55,391 INFO L85 PathProgramCache]: Analyzing trace with hash -483068679, now seen corresponding path program 5 times [2025-03-17 06:22:55,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:22:55,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170121722] [2025-03-17 06:22:55,392 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:22:55,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:22:55,400 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-17 06:22:55,429 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 06:22:55,429 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:22:55,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:22:56,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:22:56,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:22:56,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170121722] [2025-03-17 06:22:56,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170121722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:22:56,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:22:56,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:22:56,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289177866] [2025-03-17 06:22:56,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:22:56,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:22:56,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:22:56,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:22:56,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:22:56,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-03-17 06:22:56,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 40 transitions, 151 flow. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:22:56,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:22:56,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-03-17 06:22:56,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:22:56,969 INFO L124 PetriNetUnfolderBase]: 1079/1761 cut-off events. [2025-03-17 06:22:56,969 INFO L125 PetriNetUnfolderBase]: For 1086/1086 co-relation queries the response was YES. [2025-03-17 06:22:56,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4451 conditions, 1761 events. 1079/1761 cut-off events. For 1086/1086 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 8147 event pairs, 177 based on Foata normal form. 8/1766 useless extension candidates. Maximal degree in co-relation 4427. Up to 772 conditions per place. [2025-03-17 06:22:56,975 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 45 selfloop transitions, 5 changer transitions 37/91 dead transitions. [2025-03-17 06:22:56,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 91 transitions, 491 flow [2025-03-17 06:22:56,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:22:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 06:22:56,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 144 transitions. [2025-03-17 06:22:56,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35121951219512193 [2025-03-17 06:22:56,977 INFO L175 Difference]: Start difference. First operand has 74 places, 40 transitions, 151 flow. Second operand 10 states and 144 transitions. [2025-03-17 06:22:56,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 91 transitions, 491 flow [2025-03-17 06:22:56,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 91 transitions, 441 flow, removed 21 selfloop flow, removed 12 redundant places. [2025-03-17 06:22:56,980 INFO L231 Difference]: Finished difference. Result has 64 places, 40 transitions, 142 flow [2025-03-17 06:22:56,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=142, PETRI_PLACES=64, PETRI_TRANSITIONS=40} [2025-03-17 06:22:56,980 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 17 predicate places. [2025-03-17 06:22:56,980 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 142 flow [2025-03-17 06:22:56,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:22:56,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:22:56,981 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:22:56,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 06:22:56,981 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:22:56,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:22:56,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1450500591, now seen corresponding path program 6 times [2025-03-17 06:22:56,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:22:56,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886320718] [2025-03-17 06:22:56,982 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 06:22:56,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:22:56,994 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 1 equivalence classes. [2025-03-17 06:22:57,017 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 06:22:57,017 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 06:22:57,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:22:57,017 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:22:57,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 06:22:57,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 06:22:57,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:22:57,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:22:57,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:22:57,086 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:22:57,087 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-03-17 06:22:57,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-17 06:22:57,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-03-17 06:22:57,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-17 06:22:57,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-17 06:22:57,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-17 06:22:57,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 06:22:57,089 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2025-03-17 06:22:57,150 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 06:22:57,151 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:22:57,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:22:57 BasicIcfg [2025-03-17 06:22:57,154 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:22:57,155 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:22:57,155 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:22:57,155 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:22:57,156 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:22:45" (3/4) ... [2025-03-17 06:22:57,156 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 06:22:57,235 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-03-17 06:22:57,272 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 06:22:57,272 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 06:22:57,273 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:22:57,275 INFO L158 Benchmark]: Toolchain (without parser) took 12618.06ms. Allocated memory was 142.6MB in the beginning and 738.2MB in the end (delta: 595.6MB). Free memory was 105.1MB in the beginning and 369.6MB in the end (delta: -264.5MB). Peak memory consumption was 331.9MB. Max. memory is 16.1GB. [2025-03-17 06:22:57,275 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:22:57,275 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.22ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 80.8MB in the end (delta: 24.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:22:57,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.73ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 78.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:22:57,276 INFO L158 Benchmark]: Boogie Preprocessor took 49.84ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 75.6MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:22:57,276 INFO L158 Benchmark]: IcfgBuilder took 627.17ms. Allocated memory is still 142.6MB. Free memory was 75.6MB in the beginning and 85.8MB in the end (delta: -10.2MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2025-03-17 06:22:57,276 INFO L158 Benchmark]: TraceAbstraction took 11342.23ms. Allocated memory was 142.6MB in the beginning and 738.2MB in the end (delta: 595.6MB). Free memory was 85.0MB in the beginning and 386.4MB in the end (delta: -301.4MB). Peak memory consumption was 292.3MB. Max. memory is 16.1GB. [2025-03-17 06:22:57,276 INFO L158 Benchmark]: Witness Printer took 117.55ms. Allocated memory is still 738.2MB. Free memory was 386.4MB in the beginning and 369.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:22:57,277 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.25ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.22ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 80.8MB in the end (delta: 24.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.73ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 78.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.84ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 75.6MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 627.17ms. Allocated memory is still 142.6MB. Free memory was 75.6MB in the beginning and 85.8MB in the end (delta: -10.2MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11342.23ms. Allocated memory was 142.6MB in the beginning and 738.2MB in the end (delta: 595.6MB). Free memory was 85.0MB in the beginning and 386.4MB in the end (delta: -301.4MB). Peak memory consumption was 292.3MB. Max. memory is 16.1GB. * Witness Printer took 117.55ms. Allocated memory is still 738.2MB. Free memory was 386.4MB in the beginning and 369.6MB 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_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t65; [L849] FCALL, FORK 0 pthread_create(&t65, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t65=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t66; [L851] FCALL, FORK 0 pthread_create(&t66, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t65=-2, t66=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t67; [L853] FCALL, FORK 0 pthread_create(&t67, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t65=-2, t66=-1, t67=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 y$flush_delayed = weak$$choice2 [L810] 3 y$mem_tmp = y [L811] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EAX = y [L819] 3 y = y$flush_delayed ? y$mem_tmp : y [L820] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L823] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L749] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L752] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L764] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L767] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L826] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L827] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L828] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L829] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L830] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t65=-2, t66=-1, t67=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t65=-2, t66=-1, t67=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L866] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t65=-2, t66=-1, t67=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L868] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - 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: 851]: 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: 853]: 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: 849]: 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, 68 locations, 65 edges, 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: 11.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 812 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 806 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2457 IncrementalHoareTripleChecker+Invalid, 2494 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 4 mSDtfsCounter, 2457 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=298occurred in iteration=9, InterpolantAutomatonStates: 78, 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, 3.7s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 1859 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-03-17 06:22:57,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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