./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe019_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe019_rmo.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2ad190c36ab064f1e4bfbebf06775e6b037058a5a86becabf7b70897d3619304 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:30:36,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:30:36,162 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:30:36,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:30:36,165 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:30:36,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:30:36,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:30:36,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:30:36,194 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:30:36,194 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:30:36,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:30:36,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:30:36,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:30:36,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:30:36,194 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:30:36,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:30:36,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:30:36,194 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:30:36,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:30:36,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:30:36,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:30:36,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:30:36,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:30:36,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:30:36,195 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:30:36,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:30:36,195 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:30:36,195 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:30:36,195 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:30:36,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:30:36,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:30:36,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:30:36,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:30:36,195 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:30:36,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:30:36,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:30:36,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:30:36,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:30:36,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:30:36,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:30:36,196 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:30:36,196 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:30:36,196 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:30:36,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:30:36,199 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:30:36,199 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:30:36,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:30:36,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:30:36,200 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2ad190c36ab064f1e4bfbebf06775e6b037058a5a86becabf7b70897d3619304 [2025-01-09 16:30:36,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:30:36,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:30:36,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:30:36,520 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:30:36,520 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:30:36,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe019_rmo.opt.i [2025-01-09 16:30:37,632 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74ef2bc5f/1b7686c5251d4eb084feac73447d7164/FLAG14748566a [2025-01-09 16:30:37,985 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:30:37,986 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe019_rmo.opt.i [2025-01-09 16:30:38,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74ef2bc5f/1b7686c5251d4eb084feac73447d7164/FLAG14748566a [2025-01-09 16:30:38,214 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74ef2bc5f/1b7686c5251d4eb084feac73447d7164 [2025-01-09 16:30:38,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:30:38,218 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:30:38,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:30:38,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:30:38,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:30:38,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:30:38" (1/1) ... [2025-01-09 16:30:38,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@684e2b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:30:38, skipping insertion in model container [2025-01-09 16:30:38,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:30:38" (1/1) ... [2025-01-09 16:30:38,257 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:30:38,388 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe019_rmo.opt.i[992,1005] [2025-01-09 16:30:38,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:30:38,574 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:30:38,585 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe019_rmo.opt.i[992,1005] [2025-01-09 16:30:38,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:30:38,691 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:30:38,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:30:38 WrapperNode [2025-01-09 16:30:38,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:30:38,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:30:38,693 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:30:38,693 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:30:38,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:30:38" (1/1) ... [2025-01-09 16:30:38,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:30:38" (1/1) ... [2025-01-09 16:30:38,750 INFO L138 Inliner]: procedures = 176, calls = 70, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2025-01-09 16:30:38,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:30:38,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:30:38,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:30:38,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:30:38,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:30:38" (1/1) ... [2025-01-09 16:30:38,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:30:38" (1/1) ... [2025-01-09 16:30:38,771 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:30:38" (1/1) ... [2025-01-09 16:30:38,800 INFO L175 MemorySlicer]: Split 25 memory accesses to 2 slices as follows [2, 23]. 92 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 9 writes are split as follows [0, 9]. [2025-01-09 16:30:38,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:30:38" (1/1) ... [2025-01-09 16:30:38,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:30:38" (1/1) ... [2025-01-09 16:30:38,810 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:30:38" (1/1) ... [2025-01-09 16:30:38,818 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:30:38" (1/1) ... [2025-01-09 16:30:38,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:30:38" (1/1) ... [2025-01-09 16:30:38,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:30:38" (1/1) ... [2025-01-09 16:30:38,826 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:30:38" (1/1) ... [2025-01-09 16:30:38,833 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:30:38,833 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:30:38,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:30:38,833 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:30:38,834 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:30:38" (1/1) ... [2025-01-09 16:30:38,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:30:38,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:30:38,873 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:30:38,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:30:38,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:30:38,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:30:38,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:30:38,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:30:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:30:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:30:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-09 16:30:38,899 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-09 16:30:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-09 16:30:38,899 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-09 16:30:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-09 16:30:38,899 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-09 16:30:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-01-09 16:30:38,899 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-01-09 16:30:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:30:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:30:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:30:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:30:38,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:30:38,901 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:30:39,005 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:30:39,007 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:30:39,385 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:30:39,387 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:30:39,680 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:30:39,681 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:30:39,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:30:39 BoogieIcfgContainer [2025-01-09 16:30:39,682 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:30:39,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:30:39,683 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:30:39,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:30:39,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:30:38" (1/3) ... [2025-01-09 16:30:39,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0df612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:30:39, skipping insertion in model container [2025-01-09 16:30:39,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:30:38" (2/3) ... [2025-01-09 16:30:39,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0df612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:30:39, skipping insertion in model container [2025-01-09 16:30:39,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:30:39" (3/3) ... [2025-01-09 16:30:39,688 INFO L128 eAbstractionObserver]: Analyzing ICFG safe019_rmo.opt.i [2025-01-09 16:30:39,701 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:30:39,704 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe019_rmo.opt.i that has 5 procedures, 45 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 16:30:39,704 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:30:39,786 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:30:39,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 45 transitions, 106 flow [2025-01-09 16:30:39,859 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2025-01-09 16:30:39,860 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:30:39,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 41 events. 1/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 80 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-01-09 16:30:39,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 45 transitions, 106 flow [2025-01-09 16:30:39,864 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 38 transitions, 88 flow [2025-01-09 16:30:39,869 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:30:39,879 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;@6c3c257a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:30:39,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 16:30:39,902 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:30:39,902 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2025-01-09 16:30:39,903 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:30:39,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:30:39,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:30:39,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:30:39,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:30:39,912 INFO L85 PathProgramCache]: Analyzing trace with hash -955909716, now seen corresponding path program 1 times [2025-01-09 16:30:39,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:30:39,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115405630] [2025-01-09 16:30:39,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:30:39,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:30:40,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 16:30:40,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:30:40,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:30:40,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:30:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:30:40,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:30:40,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115405630] [2025-01-09 16:30:40,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115405630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:30:40,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:30:40,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:30:40,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802788851] [2025-01-09 16:30:40,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:30:40,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:30:40,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:30:40,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:30:40,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:30:40,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2025-01-09 16:30:40,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:30:40,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:30:40,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2025-01-09 16:30:40,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:30:42,208 INFO L124 PetriNetUnfolderBase]: 6011/9001 cut-off events. [2025-01-09 16:30:42,209 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-01-09 16:30:42,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17409 conditions, 9001 events. 6011/9001 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 60667 event pairs, 1479 based on Foata normal form. 240/9222 useless extension candidates. Maximal degree in co-relation 17397. Up to 6097 conditions per place. [2025-01-09 16:30:42,314 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 36 selfloop transitions, 3 changer transitions 43/94 dead transitions. [2025-01-09 16:30:42,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 94 transitions, 367 flow [2025-01-09 16:30:42,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:30:42,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:30:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 196 transitions. [2025-01-09 16:30:42,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2025-01-09 16:30:42,328 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 88 flow. Second operand 7 states and 196 transitions. [2025-01-09 16:30:42,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 94 transitions, 367 flow [2025-01-09 16:30:42,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 94 transitions, 362 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 16:30:42,339 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 119 flow [2025-01-09 16:30:42,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=119, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2025-01-09 16:30:42,345 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2025-01-09 16:30:42,345 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 119 flow [2025-01-09 16:30:42,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:30:42,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:30:42,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:30:42,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:30:42,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:30:42,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:30:42,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1888872525, now seen corresponding path program 1 times [2025-01-09 16:30:42,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:30:42,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553914926] [2025-01-09 16:30:42,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:30:42,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:30:42,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:30:42,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:30:42,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:30:42,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:30:42,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:30:42,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:30:42,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553914926] [2025-01-09 16:30:42,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553914926] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:30:42,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:30:42,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:30:42,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482546121] [2025-01-09 16:30:42,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:30:42,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:30:42,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:30:42,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:30:42,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:30:42,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2025-01-09 16:30:42,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:30:42,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:30:42,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2025-01-09 16:30:42,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:30:43,912 INFO L124 PetriNetUnfolderBase]: 5795/9046 cut-off events. [2025-01-09 16:30:43,912 INFO L125 PetriNetUnfolderBase]: For 2880/2880 co-relation queries the response was YES. [2025-01-09 16:30:43,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19737 conditions, 9046 events. 5795/9046 cut-off events. For 2880/2880 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 61770 event pairs, 1047 based on Foata normal form. 288/9092 useless extension candidates. Maximal degree in co-relation 19722. Up to 5254 conditions per place. [2025-01-09 16:30:43,973 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 40 selfloop transitions, 2 changer transitions 41/98 dead transitions. [2025-01-09 16:30:43,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 98 transitions, 417 flow [2025-01-09 16:30:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:30:43,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:30:43,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 204 transitions. [2025-01-09 16:30:43,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6476190476190476 [2025-01-09 16:30:43,977 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 119 flow. Second operand 7 states and 204 transitions. [2025-01-09 16:30:43,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 98 transitions, 417 flow [2025-01-09 16:30:44,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 98 transitions, 406 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-09 16:30:44,045 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 128 flow [2025-01-09 16:30:44,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=128, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2025-01-09 16:30:44,046 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2025-01-09 16:30:44,046 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 128 flow [2025-01-09 16:30:44,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:30:44,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:30:44,046 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-01-09 16:30:44,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:30:44,048 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:30:44,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:30:44,049 INFO L85 PathProgramCache]: Analyzing trace with hash 807637562, now seen corresponding path program 1 times [2025-01-09 16:30:44,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:30:44,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390244613] [2025-01-09 16:30:44,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:30:44,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:30:44,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:30:44,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:30:44,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:30:44,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:30:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:30:44,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:30:44,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390244613] [2025-01-09 16:30:44,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390244613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:30:44,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:30:44,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:30:44,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645164377] [2025-01-09 16:30:44,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:30:44,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:30:44,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:30:44,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:30:44,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:30:44,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-01-09 16:30:44,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 40 transitions, 128 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:30:44,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:30:44,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-01-09 16:30:44,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:30:46,014 INFO L124 PetriNetUnfolderBase]: 9611/14475 cut-off events. [2025-01-09 16:30:46,014 INFO L125 PetriNetUnfolderBase]: For 8914/8914 co-relation queries the response was YES. [2025-01-09 16:30:46,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34738 conditions, 14475 events. 9611/14475 cut-off events. For 8914/8914 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 98224 event pairs, 1223 based on Foata normal form. 216/14593 useless extension candidates. Maximal degree in co-relation 34719. Up to 6241 conditions per place. [2025-01-09 16:30:46,065 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 49 selfloop transitions, 4 changer transitions 31/95 dead transitions. [2025-01-09 16:30:46,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 95 transitions, 459 flow [2025-01-09 16:30:46,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:30:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:30:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2025-01-09 16:30:46,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2025-01-09 16:30:46,066 INFO L175 Difference]: Start difference. First operand has 62 places, 40 transitions, 128 flow. Second operand 6 states and 175 transitions. [2025-01-09 16:30:46,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 95 transitions, 459 flow [2025-01-09 16:30:46,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 95 transitions, 441 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-09 16:30:46,143 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 133 flow [2025-01-09 16:30:46,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=133, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2025-01-09 16:30:46,144 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2025-01-09 16:30:46,144 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 133 flow [2025-01-09 16:30:46,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:30:46,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:30:46,144 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-01-09 16:30:46,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:30:46,144 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:30:46,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:30:46,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2135723864, now seen corresponding path program 2 times [2025-01-09 16:30:46,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:30:46,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707656070] [2025-01-09 16:30:46,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:30:46,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:30:46,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:30:46,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:30:46,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:30:46,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:30:46,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:30:46,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:30:46,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707656070] [2025-01-09 16:30:46,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707656070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:30:46,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:30:46,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:30:46,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207370244] [2025-01-09 16:30:46,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:30:46,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:30:46,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:30:46,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:30:46,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:30:46,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2025-01-09 16:30:46,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:30:46,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:30:46,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2025-01-09 16:30:46,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:30:47,295 INFO L124 PetriNetUnfolderBase]: 4165/6756 cut-off events. [2025-01-09 16:30:47,296 INFO L125 PetriNetUnfolderBase]: For 3768/3784 co-relation queries the response was YES. [2025-01-09 16:30:47,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15244 conditions, 6756 events. 4165/6756 cut-off events. For 3768/3784 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 46555 event pairs, 1825 based on Foata normal form. 180/6736 useless extension candidates. Maximal degree in co-relation 15226. Up to 4093 conditions per place. [2025-01-09 16:30:47,336 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 34 selfloop transitions, 2 changer transitions 37/89 dead transitions. [2025-01-09 16:30:47,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 89 transitions, 393 flow [2025-01-09 16:30:47,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:30:47,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:30:47,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 201 transitions. [2025-01-09 16:30:47,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2025-01-09 16:30:47,339 INFO L175 Difference]: Start difference. First operand has 60 places, 40 transitions, 133 flow. Second operand 7 states and 201 transitions. [2025-01-09 16:30:47,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 89 transitions, 393 flow [2025-01-09 16:30:47,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 89 transitions, 373 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-01-09 16:30:47,356 INFO L231 Difference]: Finished difference. Result has 64 places, 40 transitions, 135 flow [2025-01-09 16:30:47,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=135, PETRI_PLACES=64, PETRI_TRANSITIONS=40} [2025-01-09 16:30:47,358 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2025-01-09 16:30:47,358 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 135 flow [2025-01-09 16:30:47,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:30:47,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:30:47,358 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:30:47,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:30:47,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:30:47,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:30:47,359 INFO L85 PathProgramCache]: Analyzing trace with hash -315152351, now seen corresponding path program 1 times [2025-01-09 16:30:47,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:30:47,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124239218] [2025-01-09 16:30:47,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:30:47,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:30:47,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 16:30:47,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 16:30:47,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:30:47,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:30:47,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:30:47,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:30:47,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124239218] [2025-01-09 16:30:47,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124239218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:30:47,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:30:47,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:30:47,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185543350] [2025-01-09 16:30:47,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:30:47,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:30:47,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:30:47,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:30:47,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:30:47,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2025-01-09 16:30:47,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 40 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:30:47,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:30:47,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2025-01-09 16:30:47,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:30:49,062 INFO L124 PetriNetUnfolderBase]: 6958/10811 cut-off events. [2025-01-09 16:30:49,062 INFO L125 PetriNetUnfolderBase]: For 7506/7506 co-relation queries the response was YES. [2025-01-09 16:30:49,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25586 conditions, 10811 events. 6958/10811 cut-off events. For 7506/7506 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 75453 event pairs, 2527 based on Foata normal form. 252/10962 useless extension candidates. Maximal degree in co-relation 25566. Up to 4315 conditions per place. [2025-01-09 16:30:49,110 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 41 selfloop transitions, 3 changer transitions 41/97 dead transitions. [2025-01-09 16:30:49,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 97 transitions, 463 flow [2025-01-09 16:30:49,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:30:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:30:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2025-01-09 16:30:49,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-01-09 16:30:49,111 INFO L175 Difference]: Start difference. First operand has 64 places, 40 transitions, 135 flow. Second operand 7 states and 198 transitions. [2025-01-09 16:30:49,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 97 transitions, 463 flow [2025-01-09 16:30:49,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 97 transitions, 429 flow, removed 15 selfloop flow, removed 6 redundant places. [2025-01-09 16:30:49,181 INFO L231 Difference]: Finished difference. Result has 65 places, 40 transitions, 140 flow [2025-01-09 16:30:49,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=65, PETRI_TRANSITIONS=40} [2025-01-09 16:30:49,181 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2025-01-09 16:30:49,181 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 40 transitions, 140 flow [2025-01-09 16:30:49,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:30:49,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:30:49,182 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:30:49,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:30:49,182 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:30:49,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:30:49,183 INFO L85 PathProgramCache]: Analyzing trace with hash 91454383, now seen corresponding path program 1 times [2025-01-09 16:30:49,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:30:49,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333134103] [2025-01-09 16:30:49,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:30:49,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:30:49,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:30:49,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:30:49,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:30:49,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:30:49,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:30:49,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:30:49,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333134103] [2025-01-09 16:30:49,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333134103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:30:49,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:30:49,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:30:49,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483296452] [2025-01-09 16:30:49,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:30:49,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:30:49,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:30:49,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:30:49,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:30:49,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2025-01-09 16:30:49,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 40 transitions, 140 flow. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:30:49,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:30:49,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2025-01-09 16:30:49,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:30:50,748 INFO L124 PetriNetUnfolderBase]: 5227/8538 cut-off events. [2025-01-09 16:30:50,748 INFO L125 PetriNetUnfolderBase]: For 6788/6844 co-relation queries the response was YES. [2025-01-09 16:30:50,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19212 conditions, 8538 events. 5227/8538 cut-off events. For 6788/6844 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 61398 event pairs, 3049 based on Foata normal form. 252/8578 useless extension candidates. Maximal degree in co-relation 19192. Up to 4951 conditions per place. [2025-01-09 16:30:50,780 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 44 selfloop transitions, 4 changer transitions 33/97 dead transitions. [2025-01-09 16:30:50,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 97 transitions, 443 flow [2025-01-09 16:30:50,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:30:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:30:50,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 227 transitions. [2025-01-09 16:30:50,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6305555555555555 [2025-01-09 16:30:50,781 INFO L175 Difference]: Start difference. First operand has 65 places, 40 transitions, 140 flow. Second operand 8 states and 227 transitions. [2025-01-09 16:30:50,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 97 transitions, 443 flow [2025-01-09 16:30:50,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 97 transitions, 420 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-01-09 16:30:50,813 INFO L231 Difference]: Finished difference. Result has 69 places, 42 transitions, 155 flow [2025-01-09 16:30:50,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=155, PETRI_PLACES=69, PETRI_TRANSITIONS=42} [2025-01-09 16:30:50,814 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2025-01-09 16:30:50,814 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 42 transitions, 155 flow [2025-01-09 16:30:50,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:30:50,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:30:50,814 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:30:50,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:30:50,814 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:30:50,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:30:50,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1392696434, now seen corresponding path program 1 times [2025-01-09 16:30:50,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:30:50,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179311651] [2025-01-09 16:30:50,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:30:50,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:30:50,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:30:50,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:30:50,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:30:50,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:30:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:30:50,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:30:50,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179311651] [2025-01-09 16:30:50,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179311651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:30:50,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:30:50,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:30:50,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244048107] [2025-01-09 16:30:50,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:30:50,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:30:50,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:30:50,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:30:50,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:30:50,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-01-09 16:30:50,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 42 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:30:50,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:30:50,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-01-09 16:30:50,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:30:52,500 INFO L124 PetriNetUnfolderBase]: 14351/20803 cut-off events. [2025-01-09 16:30:52,500 INFO L125 PetriNetUnfolderBase]: For 9140/9206 co-relation queries the response was YES. [2025-01-09 16:30:52,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48516 conditions, 20803 events. 14351/20803 cut-off events. For 9140/9206 co-relation queries the response was YES. Maximal size of possible extension queue 922. Compared 135848 event pairs, 2005 based on Foata normal form. 715/21377 useless extension candidates. Maximal degree in co-relation 48493. Up to 11540 conditions per place. [2025-01-09 16:30:52,618 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 57 selfloop transitions, 6 changer transitions 1/76 dead transitions. [2025-01-09 16:30:52,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 76 transitions, 383 flow [2025-01-09 16:30:52,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:30:52,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:30:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-01-09 16:30:52,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-01-09 16:30:52,620 INFO L175 Difference]: Start difference. First operand has 69 places, 42 transitions, 155 flow. Second operand 4 states and 120 transitions. [2025-01-09 16:30:52,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 76 transitions, 383 flow [2025-01-09 16:30:52,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 76 transitions, 368 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-01-09 16:30:52,748 INFO L231 Difference]: Finished difference. Result has 65 places, 46 transitions, 186 flow [2025-01-09 16:30:52,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2025-01-09 16:30:52,749 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2025-01-09 16:30:52,749 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 186 flow [2025-01-09 16:30:52,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:30:52,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:30:52,749 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:30:52,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:30:52,749 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:30:52,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:30:52,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1120608527, now seen corresponding path program 1 times [2025-01-09 16:30:52,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:30:52,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071659607] [2025-01-09 16:30:52,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:30:52,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:30:52,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:30:52,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:30:52,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:30:52,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:30:53,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:30:53,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:30:53,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071659607] [2025-01-09 16:30:53,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071659607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:30:53,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:30:53,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:30:53,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287322331] [2025-01-09 16:30:53,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:30:53,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:30:53,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:30:53,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:30:53,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:30:53,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-01-09 16:30:53,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:30:53,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:30:53,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-01-09 16:30:53,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:30:54,641 INFO L124 PetriNetUnfolderBase]: 11031/16066 cut-off events. [2025-01-09 16:30:54,641 INFO L125 PetriNetUnfolderBase]: For 8000/8108 co-relation queries the response was YES. [2025-01-09 16:30:54,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40811 conditions, 16066 events. 11031/16066 cut-off events. For 8000/8108 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 100655 event pairs, 871 based on Foata normal form. 686/16646 useless extension candidates. Maximal degree in co-relation 40789. Up to 7337 conditions per place. [2025-01-09 16:30:54,732 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 72 selfloop transitions, 10 changer transitions 1/95 dead transitions. [2025-01-09 16:30:54,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 511 flow [2025-01-09 16:30:54,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:30:54,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:30:54,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2025-01-09 16:30:54,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6755555555555556 [2025-01-09 16:30:54,734 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 186 flow. Second operand 5 states and 152 transitions. [2025-01-09 16:30:54,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 95 transitions, 511 flow [2025-01-09 16:30:54,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 95 transitions, 500 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-09 16:30:54,739 INFO L231 Difference]: Finished difference. Result has 69 places, 50 transitions, 238 flow [2025-01-09 16:30:54,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=238, PETRI_PLACES=69, PETRI_TRANSITIONS=50} [2025-01-09 16:30:54,740 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2025-01-09 16:30:54,740 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 50 transitions, 238 flow [2025-01-09 16:30:54,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:30:54,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:30:54,741 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:30:54,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:30:54,741 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:30:54,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:30:54,741 INFO L85 PathProgramCache]: Analyzing trace with hash -461598678, now seen corresponding path program 1 times [2025-01-09 16:30:54,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:30:54,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093860489] [2025-01-09 16:30:54,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:30:54,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:30:54,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:30:54,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:30:54,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:30:54,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:30:54,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:30:54,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:30:54,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093860489] [2025-01-09 16:30:54,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093860489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:30:54,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:30:54,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:30:54,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965660517] [2025-01-09 16:30:54,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:30:54,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:30:54,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:30:54,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:30:54,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:30:54,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-01-09 16:30:54,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 50 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:30:54,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:30:54,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-01-09 16:30:54,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:30:55,819 INFO L124 PetriNetUnfolderBase]: 7032/10193 cut-off events. [2025-01-09 16:30:55,819 INFO L125 PetriNetUnfolderBase]: For 9757/9941 co-relation queries the response was YES. [2025-01-09 16:30:55,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28321 conditions, 10193 events. 7032/10193 cut-off events. For 9757/9941 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 58115 event pairs, 450 based on Foata normal form. 508/10602 useless extension candidates. Maximal degree in co-relation 28297. Up to 3000 conditions per place. [2025-01-09 16:30:55,866 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 83 selfloop transitions, 14 changer transitions 1/110 dead transitions. [2025-01-09 16:30:55,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 110 transitions, 632 flow [2025-01-09 16:30:55,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:30:55,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:30:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2025-01-09 16:30:55,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6814814814814815 [2025-01-09 16:30:55,867 INFO L175 Difference]: Start difference. First operand has 69 places, 50 transitions, 238 flow. Second operand 6 states and 184 transitions. [2025-01-09 16:30:55,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 110 transitions, 632 flow [2025-01-09 16:30:55,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 110 transitions, 602 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-09 16:30:55,891 INFO L231 Difference]: Finished difference. Result has 72 places, 54 transitions, 288 flow [2025-01-09 16:30:55,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=288, PETRI_PLACES=72, PETRI_TRANSITIONS=54} [2025-01-09 16:30:55,892 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 21 predicate places. [2025-01-09 16:30:55,892 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 54 transitions, 288 flow [2025-01-09 16:30:55,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:30:55,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:30:55,892 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:30:55,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:30:55,892 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:30:55,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:30:55,893 INFO L85 PathProgramCache]: Analyzing trace with hash 949238360, now seen corresponding path program 1 times [2025-01-09 16:30:55,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:30:55,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124256836] [2025-01-09 16:30:55,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:30:55,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:30:55,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:30:55,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:30:55,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:30:55,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:30:56,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:30:56,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:30:56,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124256836] [2025-01-09 16:30:56,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124256836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:30:56,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:30:56,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:30:56,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276882462] [2025-01-09 16:30:56,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:30:56,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:30:56,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:30:56,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:30:56,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:30:56,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-01-09 16:30:56,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 54 transitions, 288 flow. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:30:56,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:30:56,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-01-09 16:30:56,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:30:56,853 INFO L124 PetriNetUnfolderBase]: 4772/6793 cut-off events. [2025-01-09 16:30:56,854 INFO L125 PetriNetUnfolderBase]: For 9333/9509 co-relation queries the response was YES. [2025-01-09 16:30:56,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20074 conditions, 6793 events. 4772/6793 cut-off events. For 9333/9509 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 35897 event pairs, 304 based on Foata normal form. 240/6934 useless extension candidates. Maximal degree in co-relation 20049. Up to 2156 conditions per place. [2025-01-09 16:30:56,900 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 68 selfloop transitions, 18 changer transitions 7/105 dead transitions. [2025-01-09 16:30:56,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 105 transitions, 617 flow [2025-01-09 16:30:56,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:30:56,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:30:56,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 194 transitions. [2025-01-09 16:30:56,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6158730158730159 [2025-01-09 16:30:56,901 INFO L175 Difference]: Start difference. First operand has 72 places, 54 transitions, 288 flow. Second operand 7 states and 194 transitions. [2025-01-09 16:30:56,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 105 transitions, 617 flow [2025-01-09 16:30:56,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 105 transitions, 538 flow, removed 17 selfloop flow, removed 10 redundant places. [2025-01-09 16:30:56,949 INFO L231 Difference]: Finished difference. Result has 70 places, 54 transitions, 275 flow [2025-01-09 16:30:56,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=275, PETRI_PLACES=70, PETRI_TRANSITIONS=54} [2025-01-09 16:30:56,950 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 19 predicate places. [2025-01-09 16:30:56,950 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 54 transitions, 275 flow [2025-01-09 16:30:56,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:30:56,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:30:56,950 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:30:56,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:30:56,950 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:30:56,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:30:56,951 INFO L85 PathProgramCache]: Analyzing trace with hash -724279197, now seen corresponding path program 1 times [2025-01-09 16:30:56,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:30:56,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532813907] [2025-01-09 16:30:56,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:30:56,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:30:56,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 16:30:56,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 16:30:56,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:30:56,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:30:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:30:57,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:30:57,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532813907] [2025-01-09 16:30:57,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532813907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:30:57,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:30:57,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:30:57,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725326100] [2025-01-09 16:30:57,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:30:57,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:30:57,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:30:57,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:30:57,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:30:57,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-01-09 16:30:57,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 54 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:30:57,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:30:57,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-01-09 16:30:57,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:30:57,920 INFO L124 PetriNetUnfolderBase]: 5563/9040 cut-off events. [2025-01-09 16:30:57,920 INFO L125 PetriNetUnfolderBase]: For 6467/6705 co-relation queries the response was YES. [2025-01-09 16:30:57,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22301 conditions, 9040 events. 5563/9040 cut-off events. For 6467/6705 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 63199 event pairs, 1393 based on Foata normal form. 16/8655 useless extension candidates. Maximal degree in co-relation 22280. Up to 2453 conditions per place. [2025-01-09 16:30:57,950 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 55 selfloop transitions, 4 changer transitions 24/106 dead transitions. [2025-01-09 16:30:57,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 106 transitions, 587 flow [2025-01-09 16:30:57,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:30:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:30:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 186 transitions. [2025-01-09 16:30:57,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2025-01-09 16:30:57,952 INFO L175 Difference]: Start difference. First operand has 70 places, 54 transitions, 275 flow. Second operand 7 states and 186 transitions. [2025-01-09 16:30:57,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 106 transitions, 587 flow [2025-01-09 16:30:58,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 106 transitions, 461 flow, removed 32 selfloop flow, removed 10 redundant places. [2025-01-09 16:30:58,014 INFO L231 Difference]: Finished difference. Result has 70 places, 54 transitions, 195 flow [2025-01-09 16:30:58,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=195, PETRI_PLACES=70, PETRI_TRANSITIONS=54} [2025-01-09 16:30:58,015 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 19 predicate places. [2025-01-09 16:30:58,015 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 54 transitions, 195 flow [2025-01-09 16:30:58,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:30:58,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:30:58,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:30:58,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:30:58,015 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:30:58,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:30:58,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1694139771, now seen corresponding path program 2 times [2025-01-09 16:30:58,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:30:58,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316414097] [2025-01-09 16:30:58,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:30:58,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:30:58,028 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 1 equivalence classes. [2025-01-09 16:30:58,077 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 16:30:58,077 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:30:58,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:30:59,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:30:59,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:30:59,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316414097] [2025-01-09 16:30:59,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316414097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:30:59,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:30:59,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:30:59,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146739791] [2025-01-09 16:30:59,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:30:59,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:30:59,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:30:59,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:30:59,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:30:59,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2025-01-09 16:30:59,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 54 transitions, 195 flow. Second operand has 11 states, 11 states have (on average 19.818181818181817) internal successors, (218), 11 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:30:59,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:30:59,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2025-01-09 16:30:59,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:00,446 INFO L124 PetriNetUnfolderBase]: 3437/5649 cut-off events. [2025-01-09 16:31:00,447 INFO L125 PetriNetUnfolderBase]: For 332/332 co-relation queries the response was YES. [2025-01-09 16:31:00,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11487 conditions, 5649 events. 3437/5649 cut-off events. For 332/332 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 37733 event pairs, 896 based on Foata normal form. 16/5194 useless extension candidates. Maximal degree in co-relation 11468. Up to 2269 conditions per place. [2025-01-09 16:31:00,467 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 28 selfloop transitions, 2 changer transitions 29/87 dead transitions. [2025-01-09 16:31:00,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 87 transitions, 391 flow [2025-01-09 16:31:00,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:31:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:31:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2025-01-09 16:31:00,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2025-01-09 16:31:00,469 INFO L175 Difference]: Start difference. First operand has 70 places, 54 transitions, 195 flow. Second operand 7 states and 185 transitions. [2025-01-09 16:31:00,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 87 transitions, 391 flow [2025-01-09 16:31:00,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 87 transitions, 369 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-01-09 16:31:00,472 INFO L231 Difference]: Finished difference. Result has 71 places, 52 transitions, 182 flow [2025-01-09 16:31:00,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=71, PETRI_TRANSITIONS=52} [2025-01-09 16:31:00,472 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2025-01-09 16:31:00,474 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 52 transitions, 182 flow [2025-01-09 16:31:00,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.818181818181817) internal successors, (218), 11 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:00,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:00,474 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:31:00,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:31:00,475 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:31:00,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:00,475 INFO L85 PathProgramCache]: Analyzing trace with hash -285780887, now seen corresponding path program 3 times [2025-01-09 16:31:00,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:00,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626062977] [2025-01-09 16:31:00,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:31:00,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:00,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 1 equivalence classes. [2025-01-09 16:31:00,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 16:31:00,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:31:00,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:31:00,555 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:31:00,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 16:31:00,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 16:31:00,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:00,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:31:00,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:31:00,663 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:31:00,664 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-01-09 16:31:00,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-01-09 16:31:00,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-01-09 16:31:00,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-01-09 16:31:00,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-01-09 16:31:00,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:31:00,666 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:31:00,768 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:31:00,768 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:31:00,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:31:00 BasicIcfg [2025-01-09 16:31:00,774 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:31:00,775 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:31:00,775 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:31:00,775 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:31:00,775 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:30:39" (3/4) ... [2025-01-09 16:31:00,776 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 16:31:00,894 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 6. [2025-01-09 16:31:00,928 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:31:00,928 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:31:00,928 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:31:00,929 INFO L158 Benchmark]: Toolchain (without parser) took 22710.96ms. Allocated memory was 142.6MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 110.9MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 843.1MB. Max. memory is 16.1GB. [2025-01-09 16:31:00,929 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:31:00,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.45ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 85.5MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 16:31:00,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.00ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 83.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:31:00,932 INFO L158 Benchmark]: Boogie Preprocessor took 77.84ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 79.4MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:31:00,933 INFO L158 Benchmark]: RCFGBuilder took 848.51ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 54.2MB in the end (delta: 25.2MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2025-01-09 16:31:00,933 INFO L158 Benchmark]: TraceAbstraction took 21090.95ms. Allocated memory was 142.6MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 53.5MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 753.1MB. Max. memory is 16.1GB. [2025-01-09 16:31:00,933 INFO L158 Benchmark]: Witness Printer took 153.80ms. Allocated memory is still 2.9GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 16:31:00,934 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.19ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 472.45ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 85.5MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.00ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 83.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 77.84ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 79.4MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 848.51ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 54.2MB in the end (delta: 25.2MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. * TraceAbstraction took 21090.95ms. Allocated memory was 142.6MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 53.5MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 753.1MB. Max. memory is 16.1GB. * Witness Printer took 153.80ms. Allocated memory is still 2.9GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L739] 0 int x = 0; [L740] 0 _Bool x$flush_delayed; [L741] 0 int x$mem_tmp; [L742] 0 _Bool x$r_buff0_thd0; [L743] 0 _Bool x$r_buff0_thd1; [L744] 0 _Bool x$r_buff0_thd2; [L745] 0 _Bool x$r_buff0_thd3; [L746] 0 _Bool x$r_buff0_thd4; [L747] 0 _Bool x$r_buff1_thd0; [L748] 0 _Bool x$r_buff1_thd1; [L749] 0 _Bool x$r_buff1_thd2; [L750] 0 _Bool x$r_buff1_thd3; [L751] 0 _Bool x$r_buff1_thd4; [L752] 0 _Bool x$read_delayed; [L753] 0 int *x$read_delayed_var; [L754] 0 int x$w_buff0; [L755] 0 _Bool x$w_buff0_used; [L756] 0 int x$w_buff1; [L757] 0 _Bool x$w_buff1_used; [L759] 0 int y = 0; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L871] 0 pthread_t t2245; [L872] FCALL, FORK 0 pthread_create(&t2245, ((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_buff0_thd4=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$r_buff1_thd4=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, t2245=-3, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L873] 0 pthread_t t2246; [L874] FCALL, FORK 0 pthread_create(&t2246, ((void *)0), P1, ((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_buff0_thd4=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$r_buff1_thd4=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, t2245=-3, t2246=-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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L875] 0 pthread_t t2247; [L876] FCALL, FORK 0 pthread_create(&t2247, ((void *)0), P2, ((void *)0)) 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_buff0_thd4=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$r_buff1_thd4=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, t2245=-3, t2246=-2, t2247=-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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 x$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(x) [L814] 3 x$mem_tmp = x [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] EXPR 3 \read(x) [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L816] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L817] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L818] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L819] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L821] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L823] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L824] EXPR 3 \read(x) [L824] 3 __unbuffered_p2_EAX = x [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] 3 x = x$flush_delayed ? x$mem_tmp : x [L826] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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_buff0_thd4=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$r_buff1_thd4=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=0, 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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L829] 3 y = 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_buff0_thd4=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$r_buff1_thd4=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=0, 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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1] [L832] 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) [L832] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L832] EXPR 3 \read(x) [L832] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L832] 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) [L832] 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) [L833] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L834] 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 [L835] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L836] 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}, \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_buff0_thd4=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$r_buff1_thd4=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=0, 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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1] [L877] 0 pthread_t t2248; [L878] FCALL, FORK 0 pthread_create(&t2248, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \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_buff0_thd4=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$r_buff1_thd4=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, t2245=-3, t2246=-2, t2247=-1, t2248=0, weak$$choice0=0, weak$$choice1=0, 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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1] [L846] 4 y = 2 VAL [\old(arg)={0:0}, \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_buff0_thd4=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$r_buff1_thd4=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=0, weak$$choice1=0, 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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L766] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __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_buff0_thd4=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$r_buff1_thd4=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=0, weak$$choice1=0, 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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L769] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 1 x$flush_delayed = weak$$choice2 [L772] EXPR 1 \read(x) [L772] 1 x$mem_tmp = x [L773] 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) [L773] EXPR 1 \read(x) [L773] 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) [L773] 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) [L774] 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)) [L775] 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)) [L776] 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)) [L777] 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)) [L778] 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)) [L779] 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)) [L780] EXPR 1 \read(x) [L780] 1 __unbuffered_p0_EBX = x [L781] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L781] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L781] 1 x = x$flush_delayed ? x$mem_tmp : x [L782] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __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_buff0_thd4=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$r_buff1_thd4=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=0, 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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L849] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L849] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L849] EXPR 4 \read(x) [L849] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L849] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L849] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L850] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L851] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L852] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L853] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __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_buff0_thd4=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$r_buff1_thd4=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=0, 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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L794] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __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_buff0_thd4=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$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L797] 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) [L797] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L797] EXPR 2 \read(x) [L797] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L797] 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) [L797] 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) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 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 [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __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_buff0_thd4=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$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __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_buff0_thd4=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$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __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_buff0_thd4=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$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __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_buff0_thd4=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$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __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_buff0_thd4=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$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __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_buff0_thd4=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$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2245=-3, t2246=-2, t2247=-1, t2248=0, weak$$choice0=1, weak$$choice1=0, 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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 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) [L884] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L884] EXPR 0 \read(x) [L884] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L884] 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) [L884] 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) [L885] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L886] 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 [L887] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L888] 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}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __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_buff0_thd4=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$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2245=-3, t2246=-2, t2247=-1, t2248=0, weak$$choice0=1, weak$$choice1=0, 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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L891] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L892] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L892] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L893] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __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_buff0_thd4=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$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2245=-3, t2246=-2, t2247=-1, t2248=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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __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_buff0_thd4=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$r_buff1_thd4=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}, 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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __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_buff0_thd4=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$r_buff1_thd4=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}, 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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] - UnprovableResult [Line: 874]: 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: 876]: 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: 878]: 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: 872]: 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 9 procedures, 75 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 864 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 819 mSDsluCounter, 211 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 153 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1893 IncrementalHoareTripleChecker+Invalid, 1964 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 58 mSDtfsCounter, 1893 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=288occurred in iteration=9, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 1802 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-01-09 16:31:00,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE