./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe018_power.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/safe018_power.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 81ed16bb51b8da596bb3c9a2024b72d3baf359b31125524126025207d822fe2c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:28:39,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:28:39,405 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:28:39,410 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:28:39,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:28:39,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:28:39,434 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:28:39,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:28:39,435 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:28:39,435 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:28:39,436 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:28:39,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:28:39,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:28:39,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:28:39,436 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:28:39,437 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:28:39,437 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:28:39,437 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:28:39,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:28:39,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:28:39,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:28:39,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:28:39,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:28:39,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:28:39,437 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:28:39,437 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:28:39,438 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:28:39,438 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:28:39,438 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:28:39,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:28:39,438 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:28:39,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:28:39,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:28:39,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:28:39,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:28:39,438 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:28:39,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:28:39,439 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:28:39,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:28:39,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:28:39,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:28:39,439 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:28:39,439 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:28:39,439 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 -> 81ed16bb51b8da596bb3c9a2024b72d3baf359b31125524126025207d822fe2c [2025-03-17 06:28:39,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:28:39,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:28:39,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:28:39,683 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:28:39,683 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:28:39,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe018_power.opt.i [2025-03-17 06:28:40,910 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed237a891/91941b59667c4ef1a5568d35ea9ae5bb/FLAG93c5c0b03 [2025-03-17 06:28:41,178 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:28:41,180 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe018_power.opt.i [2025-03-17 06:28:41,196 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed237a891/91941b59667c4ef1a5568d35ea9ae5bb/FLAG93c5c0b03 [2025-03-17 06:28:41,466 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed237a891/91941b59667c4ef1a5568d35ea9ae5bb [2025-03-17 06:28:41,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:28:41,469 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:28:41,470 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:28:41,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:28:41,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:28:41,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:28:41" (1/1) ... [2025-03-17 06:28:41,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48dc266b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:28:41, skipping insertion in model container [2025-03-17 06:28:41,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:28:41" (1/1) ... [2025-03-17 06:28:41,498 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:28:41,628 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/safe018_power.opt.i[994,1007] [2025-03-17 06:28:41,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:28:41,814 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:28:41,824 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/safe018_power.opt.i[994,1007] [2025-03-17 06:28:41,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:28:41,919 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:28:41,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:28:41 WrapperNode [2025-03-17 06:28:41,920 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:28:41,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:28:41,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:28:41,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:28:41,926 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:28:41" (1/1) ... [2025-03-17 06:28:41,938 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:28:41" (1/1) ... [2025-03-17 06:28:41,955 INFO L138 Inliner]: procedures = 175, calls = 63, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2025-03-17 06:28:41,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:28:41,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:28:41,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:28:41,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:28:41,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:28:41" (1/1) ... [2025-03-17 06:28:41,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:28:41" (1/1) ... [2025-03-17 06:28:41,972 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:28:41" (1/1) ... [2025-03-17 06:28:41,990 INFO L175 MemorySlicer]: Split 24 memory accesses to 2 slices as follows [2, 22]. 92 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 7 writes are split as follows [0, 7]. [2025-03-17 06:28:41,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:28:41" (1/1) ... [2025-03-17 06:28:41,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:28:41" (1/1) ... [2025-03-17 06:28:41,997 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:28:41" (1/1) ... [2025-03-17 06:28:41,998 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:28:41" (1/1) ... [2025-03-17 06:28:42,000 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:28:41" (1/1) ... [2025-03-17 06:28:42,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:28:41" (1/1) ... [2025-03-17 06:28:42,003 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:28:42,004 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:28:42,004 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:28:42,004 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:28:42,005 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:28:41" (1/1) ... [2025-03-17 06:28:42,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:28:42,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:28:42,035 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:28:42,038 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:28:42,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 06:28:42,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 06:28:42,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 06:28:42,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 06:28:42,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 06:28:42,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:28:42,058 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-17 06:28:42,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-17 06:28:42,058 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-17 06:28:42,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-17 06:28:42,058 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-17 06:28:42,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-17 06:28:42,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:28:42,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 06:28:42,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 06:28:42,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:28:42,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:28:42,060 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:28:42,185 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:28:42,187 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:28:42,547 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 06:28:42,548 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:28:42,850 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:28:42,850 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:28:42,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:28:42 BoogieIcfgContainer [2025-03-17 06:28:42,851 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:28:42,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:28:42,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:28:42,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:28:42,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:28:41" (1/3) ... [2025-03-17 06:28:42,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4077e11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:28:42, skipping insertion in model container [2025-03-17 06:28:42,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:28:41" (2/3) ... [2025-03-17 06:28:42,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4077e11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:28:42, skipping insertion in model container [2025-03-17 06:28:42,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:28:42" (3/3) ... [2025-03-17 06:28:42,858 INFO L128 eAbstractionObserver]: Analyzing ICFG safe018_power.opt.i [2025-03-17 06:28:42,871 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:28:42,875 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe018_power.opt.i that has 4 procedures, 38 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-17 06:28:42,876 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 06:28:42,943 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 06:28:42,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 88 flow [2025-03-17 06:28:43,003 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2025-03-17 06:28:43,006 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 06:28:43,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 1/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-03-17 06:28:43,010 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 38 transitions, 88 flow [2025-03-17 06:28:43,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 35 transitions, 79 flow [2025-03-17 06:28:43,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:28:43,030 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;@5e838336, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:28:43,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 06:28:43,036 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:28:43,036 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-17 06:28:43,036 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 06:28:43,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:28:43,037 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 06:28:43,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:28:43,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:28:43,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1560906922, now seen corresponding path program 1 times [2025-03-17 06:28:43,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:28:43,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343917476] [2025-03-17 06:28:43,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:28:43,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:28:43,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 06:28:43,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 06:28:43,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:28:43,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:28:43,460 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:28:43,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:28:43,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343917476] [2025-03-17 06:28:43,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343917476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:28:43,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:28:43,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 06:28:43,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918233216] [2025-03-17 06:28:43,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:28:43,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:28:43,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:28:43,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:28:43,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:28:43,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-03-17 06:28:43,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:28:43,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:28:43,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-03-17 06:28:43,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:28:44,371 INFO L124 PetriNetUnfolderBase]: 3481/5091 cut-off events. [2025-03-17 06:28:44,372 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-17 06:28:44,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10164 conditions, 5091 events. 3481/5091 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 27347 event pairs, 465 based on Foata normal form. 174/5223 useless extension candidates. Maximal degree in co-relation 10153. Up to 4217 conditions per place. [2025-03-17 06:28:44,401 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 42 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2025-03-17 06:28:44,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 208 flow [2025-03-17 06:28:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:28:44,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:28:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-03-17 06:28:44,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-17 06:28:44,414 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 79 flow. Second operand 3 states and 76 transitions. [2025-03-17 06:28:44,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 208 flow [2025-03-17 06:28:44,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 204 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 06:28:44,420 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 74 flow [2025-03-17 06:28:44,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2025-03-17 06:28:44,426 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2025-03-17 06:28:44,428 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 74 flow [2025-03-17 06:28:44,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:28:44,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:28:44,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:28:44,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:28:44,429 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:28:44,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:28:44,430 INFO L85 PathProgramCache]: Analyzing trace with hash -689658664, now seen corresponding path program 1 times [2025-03-17 06:28:44,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:28:44,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521618841] [2025-03-17 06:28:44,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:28:44,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:28:44,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 06:28:44,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 06:28:44,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:28:44,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:28:44,696 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:28:44,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:28:44,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521618841] [2025-03-17 06:28:44,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521618841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:28:44,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:28:44,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:28:44,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659297177] [2025-03-17 06:28:44,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:28:44,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:28:44,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:28:44,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:28:44,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:28:44,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-17 06:28:44,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 74 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:28:44,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:28:44,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-17 06:28:44,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:28:45,821 INFO L124 PetriNetUnfolderBase]: 4791/7058 cut-off events. [2025-03-17 06:28:45,821 INFO L125 PetriNetUnfolderBase]: For 420/420 co-relation queries the response was YES. [2025-03-17 06:28:45,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14460 conditions, 7058 events. 4791/7058 cut-off events. For 420/420 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 39283 event pairs, 584 based on Foata normal form. 0/6905 useless extension candidates. Maximal degree in co-relation 14450. Up to 4281 conditions per place. [2025-03-17 06:28:45,851 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 42 selfloop transitions, 2 changer transitions 65/113 dead transitions. [2025-03-17 06:28:45,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 113 transitions, 470 flow [2025-03-17 06:28:45,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:28:45,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 06:28:45,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2025-03-17 06:28:45,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5493421052631579 [2025-03-17 06:28:45,854 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 74 flow. Second operand 8 states and 167 transitions. [2025-03-17 06:28:45,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 113 transitions, 470 flow [2025-03-17 06:28:45,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 113 transitions, 454 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:28:45,859 INFO L231 Difference]: Finished difference. Result has 51 places, 31 transitions, 84 flow [2025-03-17 06:28:45,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=84, PETRI_PLACES=51, PETRI_TRANSITIONS=31} [2025-03-17 06:28:45,860 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2025-03-17 06:28:45,860 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 31 transitions, 84 flow [2025-03-17 06:28:45,860 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:28:45,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:28:45,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:28:45,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:28:45,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:28:45,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:28:45,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1008464103, now seen corresponding path program 1 times [2025-03-17 06:28:45,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:28:45,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157182063] [2025-03-17 06:28:45,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:28:45,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:28:45,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 06:28:45,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 06:28:45,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:28:45,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:28:46,073 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:28:46,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:28:46,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157182063] [2025-03-17 06:28:46,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157182063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:28:46,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:28:46,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:28:46,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063780524] [2025-03-17 06:28:46,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:28:46,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:28:46,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:28:46,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:28:46,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:28:46,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-17 06:28:46,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 31 transitions, 84 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:28:46,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:28:46,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-17 06:28:46,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:28:46,951 INFO L124 PetriNetUnfolderBase]: 4659/6843 cut-off events. [2025-03-17 06:28:46,951 INFO L125 PetriNetUnfolderBase]: For 842/842 co-relation queries the response was YES. [2025-03-17 06:28:46,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14932 conditions, 6843 events. 4659/6843 cut-off events. For 842/842 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 35784 event pairs, 929 based on Foata normal form. 150/6978 useless extension candidates. Maximal degree in co-relation 14917. Up to 2681 conditions per place. [2025-03-17 06:28:46,978 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 43 selfloop transitions, 3 changer transitions 55/105 dead transitions. [2025-03-17 06:28:46,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 105 transitions, 449 flow [2025-03-17 06:28:46,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:28:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 06:28:46,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2025-03-17 06:28:46,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5230263157894737 [2025-03-17 06:28:46,982 INFO L175 Difference]: Start difference. First operand has 51 places, 31 transitions, 84 flow. Second operand 8 states and 159 transitions. [2025-03-17 06:28:46,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 105 transitions, 449 flow [2025-03-17 06:28:47,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 105 transitions, 427 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-17 06:28:47,015 INFO L231 Difference]: Finished difference. Result has 52 places, 31 transitions, 94 flow [2025-03-17 06:28:47,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=94, PETRI_PLACES=52, PETRI_TRANSITIONS=31} [2025-03-17 06:28:47,017 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2025-03-17 06:28:47,017 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 31 transitions, 94 flow [2025-03-17 06:28:47,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:28:47,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:28:47,017 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:28:47,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:28:47,017 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:28:47,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:28:47,026 INFO L85 PathProgramCache]: Analyzing trace with hash -408858788, now seen corresponding path program 1 times [2025-03-17 06:28:47,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:28:47,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875079181] [2025-03-17 06:28:47,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:28:47,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:28:47,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 06:28:47,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 06:28:47,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:28:47,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:28:47,907 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:28:47,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:28:47,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875079181] [2025-03-17 06:28:47,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875079181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:28:47,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:28:47,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:28:47,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022363377] [2025-03-17 06:28:47,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:28:47,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:28:47,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:28:47,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:28:47,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:28:47,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-17 06:28:47,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 31 transitions, 94 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:28:47,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:28:47,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-17 06:28:47,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:28:48,561 INFO L124 PetriNetUnfolderBase]: 2548/3837 cut-off events. [2025-03-17 06:28:48,561 INFO L125 PetriNetUnfolderBase]: For 1351/1351 co-relation queries the response was YES. [2025-03-17 06:28:48,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8879 conditions, 3837 events. 2548/3837 cut-off events. For 1351/1351 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 18752 event pairs, 1287 based on Foata normal form. 104/3940 useless extension candidates. Maximal degree in co-relation 8862. Up to 2980 conditions per place. [2025-03-17 06:28:48,583 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 50 selfloop transitions, 9 changer transitions 51/114 dead transitions. [2025-03-17 06:28:48,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 114 transitions, 522 flow [2025-03-17 06:28:48,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:28:48,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 06:28:48,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2025-03-17 06:28:48,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-03-17 06:28:48,591 INFO L175 Difference]: Start difference. First operand has 52 places, 31 transitions, 94 flow. Second operand 11 states and 190 transitions. [2025-03-17 06:28:48,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 114 transitions, 522 flow [2025-03-17 06:28:48,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 114 transitions, 472 flow, removed 16 selfloop flow, removed 8 redundant places. [2025-03-17 06:28:48,606 INFO L231 Difference]: Finished difference. Result has 59 places, 39 transitions, 155 flow [2025-03-17 06:28:48,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=155, PETRI_PLACES=59, PETRI_TRANSITIONS=39} [2025-03-17 06:28:48,608 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places. [2025-03-17 06:28:48,608 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 155 flow [2025-03-17 06:28:48,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:28:48,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:28:48,609 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:28:48,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:28:48,609 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:28:48,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:28:48,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1043256893, now seen corresponding path program 1 times [2025-03-17 06:28:48,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:28:48,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392562460] [2025-03-17 06:28:48,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:28:48,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:28:48,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 06:28:48,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 06:28:48,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:28:48,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:28:49,847 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:28:49,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:28:49,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392562460] [2025-03-17 06:28:49,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392562460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:28:49,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:28:49,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:28:49,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662300755] [2025-03-17 06:28:49,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:28:49,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:28:49,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:28:49,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:28:49,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:28:49,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-17 06:28:49,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 39 transitions, 155 flow. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:28:49,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:28:49,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-17 06:28:49,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:28:50,530 INFO L124 PetriNetUnfolderBase]: 2587/3872 cut-off events. [2025-03-17 06:28:50,531 INFO L125 PetriNetUnfolderBase]: For 4606/4606 co-relation queries the response was YES. [2025-03-17 06:28:50,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11273 conditions, 3872 events. 2587/3872 cut-off events. For 4606/4606 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 18047 event pairs, 1302 based on Foata normal form. 87/3958 useless extension candidates. Maximal degree in co-relation 11253. Up to 2620 conditions per place. [2025-03-17 06:28:50,560 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 54 selfloop transitions, 12 changer transitions 51/121 dead transitions. [2025-03-17 06:28:50,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 121 transitions, 679 flow [2025-03-17 06:28:50,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:28:50,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 06:28:50,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-03-17 06:28:50,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46172248803827753 [2025-03-17 06:28:50,561 INFO L175 Difference]: Start difference. First operand has 59 places, 39 transitions, 155 flow. Second operand 11 states and 193 transitions. [2025-03-17 06:28:50,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 121 transitions, 679 flow [2025-03-17 06:28:50,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 121 transitions, 659 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-03-17 06:28:50,576 INFO L231 Difference]: Finished difference. Result has 67 places, 42 transitions, 233 flow [2025-03-17 06:28:50,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=233, PETRI_PLACES=67, PETRI_TRANSITIONS=42} [2025-03-17 06:28:50,578 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2025-03-17 06:28:50,579 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 42 transitions, 233 flow [2025-03-17 06:28:50,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:28:50,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:28:50,579 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:28:50,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:28:50,579 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:28:50,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:28:50,580 INFO L85 PathProgramCache]: Analyzing trace with hash 921660254, now seen corresponding path program 1 times [2025-03-17 06:28:50,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:28:50,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814311733] [2025-03-17 06:28:50,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:28:50,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:28:50,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 06:28:50,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 06:28:50,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:28:50,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:28:50,745 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:28:50,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:28:50,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814311733] [2025-03-17 06:28:50,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814311733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:28:50,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:28:50,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:28:50,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999999851] [2025-03-17 06:28:50,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:28:50,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:28:50,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:28:50,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:28:50,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:28:50,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-03-17 06:28:50,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 42 transitions, 233 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:28:50,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:28:50,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-03-17 06:28:50,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:28:51,092 INFO L124 PetriNetUnfolderBase]: 1938/3040 cut-off events. [2025-03-17 06:28:51,093 INFO L125 PetriNetUnfolderBase]: For 8532/8532 co-relation queries the response was YES. [2025-03-17 06:28:51,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10505 conditions, 3040 events. 1938/3040 cut-off events. For 8532/8532 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 15546 event pairs, 245 based on Foata normal form. 155/3192 useless extension candidates. Maximal degree in co-relation 10479. Up to 1581 conditions per place. [2025-03-17 06:28:51,110 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 72 selfloop transitions, 5 changer transitions 1/83 dead transitions. [2025-03-17 06:28:51,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 83 transitions, 629 flow [2025-03-17 06:28:51,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:28:51,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:28:51,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-03-17 06:28:51,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6118421052631579 [2025-03-17 06:28:51,111 INFO L175 Difference]: Start difference. First operand has 67 places, 42 transitions, 233 flow. Second operand 4 states and 93 transitions. [2025-03-17 06:28:51,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 83 transitions, 629 flow [2025-03-17 06:28:51,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 83 transitions, 524 flow, removed 39 selfloop flow, removed 9 redundant places. [2025-03-17 06:28:51,119 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 214 flow [2025-03-17 06:28:51,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2025-03-17 06:28:51,119 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 13 predicate places. [2025-03-17 06:28:51,120 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 214 flow [2025-03-17 06:28:51,121 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:28:51,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:28:51,121 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:28:51,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:28:51,121 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:28:51,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:28:51,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1539515851, now seen corresponding path program 1 times [2025-03-17 06:28:51,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:28:51,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705964493] [2025-03-17 06:28:51,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:28:51,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:28:51,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 06:28:51,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 06:28:51,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:28:51,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:28:51,320 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:28:51,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:28:51,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705964493] [2025-03-17 06:28:51,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705964493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:28:51,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:28:51,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:28:51,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305129591] [2025-03-17 06:28:51,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:28:51,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:28:51,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:28:51,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:28:51,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:28:51,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-03-17 06:28:51,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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:28:51,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:28:51,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-03-17 06:28:51,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:28:51,619 INFO L124 PetriNetUnfolderBase]: 1220/1951 cut-off events. [2025-03-17 06:28:51,619 INFO L125 PetriNetUnfolderBase]: For 2414/2414 co-relation queries the response was YES. [2025-03-17 06:28:51,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5969 conditions, 1951 events. 1220/1951 cut-off events. For 2414/2414 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8969 event pairs, 134 based on Foata normal form. 116/2064 useless extension candidates. Maximal degree in co-relation 5948. Up to 637 conditions per place. [2025-03-17 06:28:51,628 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 75 selfloop transitions, 8 changer transitions 1/89 dead transitions. [2025-03-17 06:28:51,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 89 transitions, 586 flow [2025-03-17 06:28:51,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:28:51,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:28:51,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-03-17 06:28:51,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5947368421052631 [2025-03-17 06:28:51,630 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 214 flow. Second operand 5 states and 113 transitions. [2025-03-17 06:28:51,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 89 transitions, 586 flow [2025-03-17 06:28:51,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 89 transitions, 576 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 06:28:51,633 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 247 flow [2025-03-17 06:28:51,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2025-03-17 06:28:51,634 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2025-03-17 06:28:51,634 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 247 flow [2025-03-17 06:28:51,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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:28:51,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:28:51,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:28:51,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:28:51,634 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:28:51,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:28:51,635 INFO L85 PathProgramCache]: Analyzing trace with hash 581180064, now seen corresponding path program 1 times [2025-03-17 06:28:51,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:28:51,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476165405] [2025-03-17 06:28:51,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:28:51,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:28:51,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 06:28:51,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 06:28:51,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:28:51,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:28:51,854 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:28:51,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:28:51,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476165405] [2025-03-17 06:28:51,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476165405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:28:51,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:28:51,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:28:51,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904904264] [2025-03-17 06:28:51,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:28:51,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:28:51,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:28:51,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:28:51,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:28:51,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-03-17 06:28:51,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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:28:51,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:28:51,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-03-17 06:28:51,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:28:52,072 INFO L124 PetriNetUnfolderBase]: 734/1165 cut-off events. [2025-03-17 06:28:52,072 INFO L125 PetriNetUnfolderBase]: For 2072/2072 co-relation queries the response was YES. [2025-03-17 06:28:52,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3825 conditions, 1165 events. 734/1165 cut-off events. For 2072/2072 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4702 event pairs, 108 based on Foata normal form. 48/1210 useless extension candidates. Maximal degree in co-relation 3802. Up to 396 conditions per place. [2025-03-17 06:28:52,078 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 65 selfloop transitions, 11 changer transitions 1/82 dead transitions. [2025-03-17 06:28:52,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 82 transitions, 551 flow [2025-03-17 06:28:52,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:28:52,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:28:52,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2025-03-17 06:28:52,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5131578947368421 [2025-03-17 06:28:52,080 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 247 flow. Second operand 6 states and 117 transitions. [2025-03-17 06:28:52,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 82 transitions, 551 flow [2025-03-17 06:28:52,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 82 transitions, 504 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-03-17 06:28:52,085 INFO L231 Difference]: Finished difference. Result has 62 places, 46 transitions, 238 flow [2025-03-17 06:28:52,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=62, PETRI_TRANSITIONS=46} [2025-03-17 06:28:52,086 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 18 predicate places. [2025-03-17 06:28:52,087 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 238 flow [2025-03-17 06:28:52,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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:28:52,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:28:52,087 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:28:52,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:28:52,087 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:28:52,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:28:52,087 INFO L85 PathProgramCache]: Analyzing trace with hash 343774917, now seen corresponding path program 1 times [2025-03-17 06:28:52,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:28:52,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3665391] [2025-03-17 06:28:52,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:28:52,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:28:52,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 06:28:52,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 06:28:52,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:28:52,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:28:54,411 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:28:54,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:28:54,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3665391] [2025-03-17 06:28:54,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3665391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:28:54,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:28:54,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:28:54,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946839081] [2025-03-17 06:28:54,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:28:54,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:28:54,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:28:54,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:28:54,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:28:54,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-17 06:28:54,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 transitions, 238 flow. Second operand has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 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:28:54,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:28:54,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-17 06:28:54,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:28:55,044 INFO L124 PetriNetUnfolderBase]: 1433/2265 cut-off events. [2025-03-17 06:28:55,044 INFO L125 PetriNetUnfolderBase]: For 3682/3682 co-relation queries the response was YES. [2025-03-17 06:28:55,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7127 conditions, 2265 events. 1433/2265 cut-off events. For 3682/3682 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10616 event pairs, 474 based on Foata normal form. 8/2272 useless extension candidates. Maximal degree in co-relation 7105. Up to 1043 conditions per place. [2025-03-17 06:28:55,053 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 76 selfloop transitions, 8 changer transitions 45/133 dead transitions. [2025-03-17 06:28:55,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 133 transitions, 950 flow [2025-03-17 06:28:55,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:28:55,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 06:28:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2025-03-17 06:28:55,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4394736842105263 [2025-03-17 06:28:55,054 INFO L175 Difference]: Start difference. First operand has 62 places, 46 transitions, 238 flow. Second operand 10 states and 167 transitions. [2025-03-17 06:28:55,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 133 transitions, 950 flow [2025-03-17 06:28:55,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 133 transitions, 695 flow, removed 52 selfloop flow, removed 10 redundant places. [2025-03-17 06:28:55,061 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 234 flow [2025-03-17 06:28:55,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=234, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2025-03-17 06:28:55,062 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2025-03-17 06:28:55,062 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 234 flow [2025-03-17 06:28:55,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 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:28:55,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:28:55,062 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:28:55,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:28:55,062 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:28:55,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:28:55,063 INFO L85 PathProgramCache]: Analyzing trace with hash -761264473, now seen corresponding path program 2 times [2025-03-17 06:28:55,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:28:55,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819568347] [2025-03-17 06:28:55,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:28:55,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:28:55,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-03-17 06:28:55,104 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 06:28:55,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:28:55,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:28:56,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:28:56,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:28:56,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819568347] [2025-03-17 06:28:56,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819568347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:28:56,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:28:56,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:28:56,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223613709] [2025-03-17 06:28:56,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:28:56,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:28:56,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:28:56,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:28:56,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:28:56,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-17 06:28:56,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 234 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:28:56,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:28:56,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-17 06:28:56,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:28:57,109 INFO L124 PetriNetUnfolderBase]: 1595/2543 cut-off events. [2025-03-17 06:28:57,110 INFO L125 PetriNetUnfolderBase]: For 2029/2029 co-relation queries the response was YES. [2025-03-17 06:28:57,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6859 conditions, 2543 events. 1595/2543 cut-off events. For 2029/2029 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12088 event pairs, 647 based on Foata normal form. 8/2550 useless extension candidates. Maximal degree in co-relation 6837. Up to 1197 conditions per place. [2025-03-17 06:28:57,120 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 80 selfloop transitions, 11 changer transitions 33/128 dead transitions. [2025-03-17 06:28:57,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 128 transitions, 746 flow [2025-03-17 06:28:57,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:28:57,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 06:28:57,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2025-03-17 06:28:57,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4901315789473684 [2025-03-17 06:28:57,122 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 234 flow. Second operand 8 states and 149 transitions. [2025-03-17 06:28:57,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 128 transitions, 746 flow [2025-03-17 06:28:57,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 128 transitions, 709 flow, removed 17 selfloop flow, removed 5 redundant places. [2025-03-17 06:28:57,127 INFO L231 Difference]: Finished difference. Result has 70 places, 51 transitions, 263 flow [2025-03-17 06:28:57,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=263, PETRI_PLACES=70, PETRI_TRANSITIONS=51} [2025-03-17 06:28:57,127 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2025-03-17 06:28:57,127 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 51 transitions, 263 flow [2025-03-17 06:28:57,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:28:57,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:28:57,128 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:28:57,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:28:57,128 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 06:28:57,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:28:57,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1748788029, now seen corresponding path program 3 times [2025-03-17 06:28:57,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:28:57,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301830237] [2025-03-17 06:28:57,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:28:57,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:28:57,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-03-17 06:28:57,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 06:28:57,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 06:28:57,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:28:57,186 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:28:57,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 06:28:57,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 06:28:57,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:28:57,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:28:57,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:28:57,301 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:28:57,301 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-03-17 06:28:57,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-17 06:28:57,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-03-17 06:28:57,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-17 06:28:57,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-17 06:28:57,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-17 06:28:57,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 06:28:57,303 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:28:57,387 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 06:28:57,387 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:28:57,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:28:57 BasicIcfg [2025-03-17 06:28:57,393 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:28:57,394 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:28:57,394 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:28:57,394 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:28:57,395 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:28:42" (3/4) ... [2025-03-17 06:28:57,395 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 06:28:57,485 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-03-17 06:28:57,522 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 06:28:57,522 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 06:28:57,522 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:28:57,523 INFO L158 Benchmark]: Toolchain (without parser) took 16053.68ms. Allocated memory was 142.6MB in the beginning and 855.6MB in the end (delta: 713.0MB). Free memory was 111.4MB in the beginning and 460.3MB in the end (delta: -348.9MB). Peak memory consumption was 365.2MB. Max. memory is 16.1GB. [2025-03-17 06:28:57,523 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:28:57,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.91ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 86.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 06:28:57,524 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.86ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 83.4MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:28:57,524 INFO L158 Benchmark]: Boogie Preprocessor took 45.00ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 79.5MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:28:57,525 INFO L158 Benchmark]: IcfgBuilder took 846.69ms. Allocated memory is still 142.6MB. Free memory was 79.1MB in the beginning and 106.0MB in the end (delta: -26.9MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. [2025-03-17 06:28:57,525 INFO L158 Benchmark]: TraceAbstraction took 14541.18ms. Allocated memory was 142.6MB in the beginning and 855.6MB in the end (delta: 713.0MB). Free memory was 105.2MB in the beginning and 485.5MB in the end (delta: -380.2MB). Peak memory consumption was 333.2MB. Max. memory is 16.1GB. [2025-03-17 06:28:57,525 INFO L158 Benchmark]: Witness Printer took 128.47ms. Allocated memory is still 855.6MB. Free memory was 485.5MB in the beginning and 460.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 06:28:57,526 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.35ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 449.91ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 86.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.86ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 83.4MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.00ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 79.5MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 846.69ms. Allocated memory is still 142.6MB. Free memory was 79.1MB in the beginning and 106.0MB in the end (delta: -26.9MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. * TraceAbstraction took 14541.18ms. Allocated memory was 142.6MB in the beginning and 855.6MB in the end (delta: 713.0MB). Free memory was 105.2MB in the beginning and 485.5MB in the end (delta: -380.2MB). Peak memory consumption was 333.2MB. Max. memory is 16.1GB. * Witness Printer took 128.47ms. Allocated memory is still 855.6MB. Free memory was 485.5MB in the beginning and 460.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L718] 0 int __unbuffered_p2_EAX$mem_tmp; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L859] 0 pthread_t t2204; [L860] FCALL, FORK 0 pthread_create(&t2204, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2204=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L861] 0 pthread_t t2205; [L862] FCALL, FORK 0 pthread_create(&t2205, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2204=-2, t2205=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L863] 0 pthread_t t2206; [L864] FCALL, FORK 0 pthread_create(&t2206, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2204=-2, t2205=-1, t2206=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L789] 2 x$w_buff1 = x$w_buff0 [L790] 2 x$w_buff0 = 1 [L791] 2 x$w_buff1_used = x$w_buff0_used [L792] 2 x$w_buff0_used = (_Bool)1 [L793] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L793] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L794] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L795] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L796] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L797] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L798] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 x$flush_delayed = weak$$choice2 [L818] EXPR 3 \read(x) [L818] 3 x$mem_tmp = x [L819] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L820] EXPR 3 \read(x) [L820] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L821] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L822] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L823] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L824] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L825] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L826] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L828] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L829] EXPR 3 \read(x) [L829] 3 __unbuffered_p2_EAX = x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] 3 x = x$flush_delayed ? x$mem_tmp : x [L831] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L834] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 \read(x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L838] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L839] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L840] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L841] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L761] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EBX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L801] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L802] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L803] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L804] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L805] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L844] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2204=-2, t2205=-1, t2206=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 \read(x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2204=-2, t2205=-1, t2206=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L877] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L879] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2204=-2, t2205=-1, t2206=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - UnprovableResult [Line: 19]: 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: 862]: 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: 860]: 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: 864]: 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, 62 locations, 59 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: 14.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 682 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 674 mSDsluCounter, 97 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2302 IncrementalHoareTripleChecker+Invalid, 2363 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 5 mSDtfsCounter, 2302 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=10, InterpolantAutomatonStates: 74, 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, 6.8s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 2159 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:28:57,543 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